Reviewed pages
Jump to navigation
Jump to search
This lists contains reviewed pages whose highest attained review level (of a revision) is the specified level. A link is given to the latest revision of that level.
(first | last) View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix (215 bytes) (reviewed versions) [best revision]
- Gaussian elimination with column pivoting (187 bytes) (reviewed versions) [best revision]
- Gaussian elimination with row pivoting (185 bytes) (reviewed versions) [best revision]
- Gaussian elimination with diagonal pivoting (206 bytes) (reviewed versions) [best revision]
- Gaussian elimination with complete pivoting (196 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version (236 bytes) (reviewed versions) [best revision]
- Classical orthogonalization method (130 bytes) (reviewed versions) [best revision]
- Orthogonalization method with reorthogonalization (136 bytes) (reviewed versions) [best revision]
- Reducing matrices to compact forms (156 bytes) (reviewed versions) [best revision]
- Unitary reductions to Hessenberg form (200 bytes) (reviewed versions) [best revision]
- Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form (275 bytes) (reviewed versions) [best revision]
- Unitary reductions to tridiagonal form (206 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form (275 bytes) (reviewed versions) [best revision]
- Eigenvalue decomposition (finding eigenvalues and eigenvectors) (192 bytes) (reviewed versions) [best revision]
- Householder (reflections) reduction of a matrix to bidiagonal form (201 bytes) (reviewed versions) [best revision]
- Singular value decomposition (finding singular values and singular vectors) (190 bytes) (reviewed versions) [best revision]
- Stone doubling algorithm for solving bidiagonal SLAEs (170 bytes) (reviewed versions) [best revision]
- Thomas algorithm (80 bytes) (reviewed versions) [best revision]
- Stone doubling algorithm (108 bytes) (reviewed versions) [best revision]
- Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions (269 bytes) (reviewed versions) [best revision]
- Repeated two-sided Thomas algorithm, pointwise version (151 bytes) (reviewed versions) [best revision]
- Complete cyclic reduction (127 bytes) (reviewed versions) [best revision]
- Block Thomas algorithm (95 bytes) (reviewed versions) [best revision]
- Two-sided Thomas algorithm, block variant (130 bytes) (reviewed versions) [best revision]
- High Performance Conjugate Gradient (HPCG) benchmark (116 bytes) (reviewed versions) [best revision]
- Biconjugate gradient stabilized method (BiCGStab) (168 bytes) (reviewed versions) [best revision]
- Kaczmarz's algorithm (95 bytes) (reviewed versions) [best revision]
- QR algorithm (83 bytes) (reviewed versions) [best revision]
- QR algorithm as implemented in SCALAPACK (122 bytes) (reviewed versions) [best revision]
- Hessenberg QR algorithm as implemented in SCALAPACK (173 bytes) (reviewed versions) [best revision]
- Symmetric QR algorithm as implemented in SCALAPACK (167 bytes) (reviewed versions) [best revision]
- QR algorithm for complex Hermitian matrices as implemented in SCALAPACK (184 bytes) (reviewed versions) [best revision]
- The Jacobi (rotations) method for solving the symmetric eigenvalue problem (205 bytes) (reviewed versions) [best revision]
- The classical Jacobi (rotations) method with pivoting for symmetric matrices (221 bytes) (reviewed versions) [best revision]
- Serial Jacobi (rotations) method for symmetric matrices (198 bytes) (reviewed versions) [best revision]
- Serial Jacobi (rotations) method with thresholds for symmetric matrices (220 bytes) (reviewed versions) [best revision]
- Lanczos algorithm in exact algorithm (without reorthogonalization) (184 bytes) (reviewed versions) [best revision]
- Jacobi (rotations) method for finding singular values (208 bytes) (reviewed versions) [best revision]
- Binary search: Finding the position of a target value within a sorted array (91 bytes) (reviewed versions) [best revision]
- Depth-first search (DFS) (98 bytes) (reviewed versions) [best revision]
- Δ-stepping algorithm (97 bytes) (reviewed versions) [best revision]
- Johnson's algorithm (97 bytes) (reviewed versions) [best revision]
- Floyd-Warshall algorithm (87 bytes) (reviewed versions) [best revision]
- Longest shortest path (114 bytes) (reviewed versions) [best revision]
- Kruskal's algorithm (97 bytes) (reviewed versions) [best revision]
- Prim's algorithm (91 bytes) (reviewed versions) [best revision]
- GHS algorithm (84 bytes) (reviewed versions) [best revision]
- Ullman's algorithm (95 bytes) (reviewed versions) [best revision]
- VF2 algorithm (84 bytes) (reviewed versions) [best revision]
- Shiloach-Vishkin algorithm for finding the connected components (161 bytes) (reviewed versions) [best revision]
