Pages that link to "Template:Russian"
Jump to navigation
Jump to search
The following pages link to Template:Russian:
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Repeated Thomas algorithm, pointwise version (transclusion) (← links)
- Tarjan-Vishkin biconnected components algorithm (transclusion) (← links)
- Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix (transclusion) (← links)
- Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix (transclusion) (← links)
- Pairwise summation (transclusion) (← links)
- Parallel prefix scan algorithm using pairwise summation (transclusion) (← links)
- Uniform norm of a vector: Real version, serial-parallel variant (transclusion) (← links)
- Dense matrix multiplication (transclusion) (← links)
- Matrix decomposition problem (transclusion) (← links)
- Triangular decompositions (transclusion) (← links)
- Gaussian elimination (finding the LU decomposition) (transclusion) (← links)
- Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix (transclusion) (← links)
- Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix (transclusion) (← links)
- Gaussian elimination with column pivoting (transclusion) (← links)
- Gaussian elimination with row pivoting (transclusion) (← links)
- Gaussian elimination with diagonal pivoting (transclusion) (← links)
- Gaussian elimination with complete pivoting (transclusion) (← links)
- Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version (transclusion) (← links)
- Classical orthogonalization method (transclusion) (← links)
- Reducing matrices to compact forms (transclusion) (← links)
- Unitary reductions to Hessenberg form (transclusion) (← links)
- Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form (transclusion) (← links)
- Unitary reductions to tridiagonal form (transclusion) (← links)
- Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form (transclusion) (← links)
- Eigenvalue decomposition (finding eigenvalues and eigenvectors) (transclusion) (← links)
- Householder (reflections) reduction of a matrix to bidiagonal form (transclusion) (← links)
- Singular value decomposition (finding singular values and singular vectors) (transclusion) (← links)
- Stone doubling algorithm for solving bidiagonal SLAEs (transclusion) (← links)
- Thomas algorithm (transclusion) (← links)
- Stone doubling algorithm (transclusion) (← links)
- Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions (transclusion) (← links)
- Repeated two-sided Thomas algorithm, pointwise version (transclusion) (← links)
- Complete cyclic reduction (transclusion) (← links)
- Block Thomas algorithm (transclusion) (← links)
- Two-sided Thomas algorithm, block variant (transclusion) (← links)
- High Performance Conjugate Gradient (HPCG) benchmark (transclusion) (← links)
- Biconjugate gradient stabilized method (BiCGStab) (transclusion) (← links)
- Kaczmarz's algorithm (transclusion) (← links)
- QR algorithm (transclusion) (← links)
- QR algorithm as implemented in SCALAPACK (transclusion) (← links)
- Hessenberg QR algorithm as implemented in SCALAPACK (transclusion) (← links)
- Symmetric QR algorithm as implemented in SCALAPACK (transclusion) (← links)
- QR algorithm for complex Hermitian matrices as implemented in SCALAPACK (transclusion) (← links)
- The Jacobi (rotations) method for solving the symmetric eigenvalue problem (transclusion) (← links)
- The classical Jacobi (rotations) method with pivoting for symmetric matrices (transclusion) (← links)
- Serial Jacobi (rotations) method for symmetric matrices (transclusion) (← links)
- Serial Jacobi (rotations) method with thresholds for symmetric matrices (transclusion) (← links)
- Lanczos algorithm in exact algorithm (without reorthogonalization) (transclusion) (← links)
- Jacobi (rotations) method for finding singular values (transclusion) (← links)
- Binary search: Finding the position of a target value within a sorted array (transclusion) (← links)