Oldest pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #21 to #70.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Dense matrix multiplication (14:26, 14 March 2018)
- Matrix decomposition problem (14:29, 14 March 2018)
- Triangular decompositions (14:31, 14 March 2018)
- Gaussian elimination (finding the LU decomposition) (14:34, 14 March 2018)
- Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix (14:40, 14 March 2018)
- Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix (14:49, 14 March 2018)
- Gaussian elimination with column pivoting (14:51, 14 March 2018)
- Gaussian elimination with row pivoting (14:54, 14 March 2018)
- Gaussian elimination with diagonal pivoting (14:55, 14 March 2018)
- Gaussian elimination with complete pivoting (14:56, 14 March 2018)
- Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version (14:58, 14 March 2018)
- Classical orthogonalization method (14:59, 14 March 2018)
- Orthogonalization method with reorthogonalization (15:01, 14 March 2018)
- Reducing matrices to compact forms (15:04, 14 March 2018)
- Unitary reductions to Hessenberg form (15:05, 14 March 2018)
- Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form (15:06, 14 March 2018)
- Unitary reductions to tridiagonal form (15:08, 14 March 2018)
- Eigenvalue decomposition (finding eigenvalues and eigenvectors) (15:13, 14 March 2018)
- Householder (reflections) reduction of a matrix to bidiagonal form (15:15, 14 March 2018)
- Singular value decomposition (finding singular values and singular vectors) (15:16, 14 March 2018)
- The dqds algorithm for calculating singular values of bidiagonal matrices (15:18, 14 March 2018)
- Thomas algorithm (15:25, 14 March 2018)
- Repeated Thomas algorithm, pointwise version (15:27, 14 March 2018)
- Stone doubling algorithm (15:29, 14 March 2018)
- Stone doubling algorithm for solving bidiagonal SLAEs (15:32, 14 March 2018)
- Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions (15:34, 14 March 2018)
- Repeated two-sided Thomas algorithm, pointwise version (15:36, 14 March 2018)
- Complete cyclic reduction (15:37, 14 March 2018)
- Block Thomas algorithm (15:40, 14 March 2018)
- Two-sided Thomas algorithm, block variant (15:42, 14 March 2018)
- High Performance Conjugate Gradient (HPCG) benchmark (15:43, 14 March 2018)
- Biconjugate gradient stabilized method (BiCGStab) (15:45, 14 March 2018)
- Kaczmarz's algorithm (15:46, 14 March 2018)
- QR algorithm (15:48, 14 March 2018)
- QR algorithm as implemented in SCALAPACK (15:50, 14 March 2018)
- Hessenberg QR algorithm as implemented in SCALAPACK (15:52, 14 March 2018)
- Symmetric QR algorithm as implemented in SCALAPACK (15:54, 14 March 2018)
- QR algorithm for complex Hermitian matrices as implemented in SCALAPACK (15:57, 14 March 2018)
- Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form (16:00, 14 March 2018)
- The Jacobi (rotations) method for solving the symmetric eigenvalue problem (16:05, 14 March 2018)
- The classical Jacobi (rotations) method with pivoting for symmetric matrices (16:07, 14 March 2018)
- Serial Jacobi (rotations) method for symmetric matrices (16:08, 14 March 2018)
- Serial Jacobi (rotations) method with thresholds for symmetric matrices (16:10, 14 March 2018)
- Lanczos algorithm in exact algorithm (without reorthogonalization) (16:12, 14 March 2018)
- Jacobi (rotations) method for finding singular values (16:13, 14 March 2018)
- Binary search: Finding the position of a target value within a sorted array (16:17, 14 March 2018)
- Depth-first search (DFS) (16:38, 14 March 2018)
- Johnson's algorithm (16:42, 14 March 2018)
- Longest shortest path (16:45, 14 March 2018)
- Kruskal's algorithm (16:46, 14 March 2018)
