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 100 | next 100) (20 | 50 | 100 | 250 | 500)- Description of algorithm properties and structure (23,254 bytes) (reviewed versions) [best revision]
- Algorithm classification (14,160 bytes) (reviewed versions) [best revision]
- Cholesky decomposition (27,885 bytes) (reviewed versions) [best revision]
- About project (7,657 bytes) (reviewed versions) [best revision]
- Cholesky method (36,489 bytes) (reviewed versions) [best revision]
- Horners method (6,835 bytes) (reviewed versions) [best revision]
- Back substitution empty (reviewed versions) [best revision]
- Dot product (8,732 bytes) (reviewed versions) [best revision]
- Forward substitution (10,596 bytes) (reviewed versions) [best revision]
- Dense matrix multiplication (serial version for real matrices) (8,676 bytes) (reviewed versions) [best revision]
- Cooley–Tukey Fast Fourier Transform, radix-2 case (10,606 bytes) (reviewed versions) [best revision]
- Dense matrix-vector multiplication (8,409 bytes) (reviewed versions) [best revision]
- Pairwise summation of numbers (4,707 bytes) (reviewed versions) [best revision]
- Glossary (35,612 bytes) (reviewed versions) [best revision]
- Open Encyclopedia of Parallel Algorithmic Features (110 bytes) (reviewed versions) [best revision]
- LU decomposition via Gaussian elimination (943 bytes) (reviewed versions) [best revision]
- Backward substitution (16,438 bytes) (reviewed versions) [best revision]
- Single Source Shortest Path (SSSP) (7,288 bytes) (reviewed versions) [best revision]
- All Pairs Shortest Path (APSP) (10,383 bytes) (reviewed versions) [best revision]
- Transitive closure of a directed graph (7,508 bytes) (reviewed versions) [best revision]
- Construction of the minimum spanning tree (MST) (9,031 bytes) (reviewed versions) [best revision]
- Search for isomorphic subgraphs (1,659 bytes) (reviewed versions) [best revision]
- Graph connectivity (9,572 bytes) (reviewed versions) [best revision]
- Finding maximal flow in a transportation network (3,721 bytes) (reviewed versions) [best revision]
- Assignment problem (2,797 bytes) (reviewed versions) [best revision]
- Givens method (19,186 bytes) (reviewed versions) [best revision]
- Elimination method, pointwise version empty (reviewed versions) [best revision]
- Repeated Thomas algorithm, pointwise version (161 bytes) (reviewed versions) [best revision]
- Poisson equation, solving with DFT (23,205 bytes) (reviewed versions) [best revision]
- Thomas algorithm, pointwise version (11,793 bytes) (reviewed versions) [best revision]
- Two-sided Thomas algorithm, pointwise version (12,979 bytes) (reviewed versions) [best revision]
- Single-qubit transform of a state vector (11,023 bytes) (reviewed versions) [best revision]
- The serial-parallel summation method (7,465 bytes) (reviewed versions) [best revision]
- Methods for solving tridiagonal SLAEs (10,435 bytes) (reviewed versions) [best revision]
- The dqds algorithm for calculating singular values of bidiagonal matrices (1,840 bytes) (reviewed versions) [best revision]
- One step of the dqds algorithm (12,038 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form (16,217 bytes) (reviewed versions) [best revision]
- Linpack benchmark (11,057 bytes) (reviewed versions) [best revision]
- Breadth-first search (BFS) (11,853 bytes) (reviewed versions) [best revision]
- Dijkstra's algorithm (6,845 bytes) (reviewed versions) [best revision]
- Bellman-Ford algorithm (8,948 bytes) (reviewed versions) [best revision]
- Purdom's algorithm (14,464 bytes) (reviewed versions) [best revision]
- DCSC algorithm for finding the strongly connected components (16,575 bytes) (reviewed versions) [best revision]
- Tarjan-Vishkin biconnected components algorithm (167 bytes) (reviewed versions) [best revision]
- Boruvka's algorithm (14,885 bytes) (reviewed versions) [best revision]
- LU decomposition using Gaussian elimination without pivoting (625 bytes) (reviewed versions) [best revision]
- LU decomposition using Gaussian elimination with pivoting (1,423 bytes) (reviewed versions) [best revision]
- QR decomposition of dense nonsingular matrices (4,050 bytes) (reviewed versions) [best revision]
- Stone doubling algorithm for the LU decomposition of a tridiagonal matrix (11,754 bytes) (reviewed versions) [best revision]
- Gaussian elimination, compact scheme for tridiagonal matrices and its modifications (10,636 bytes) (reviewed versions) [best revision]
- Gaussian elimination, compact scheme for tridiagonal matrices, serial variant (9,486 bytes) (reviewed versions) [best revision]
- Givens (rotations) method for the QR decomposition of a matrix (1,809 bytes) (reviewed versions) [best revision]
- Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix (188 bytes) (reviewed versions) [best revision]
- Orthogonalization method (4,430 bytes) (reviewed versions) [best revision]
- Triangular decomposition of a Gram matrix (950 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition of a matrix (1,401 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix (197 bytes) (reviewed versions) [best revision]
- QR decomposition methods for dense Hessenberg matrices (687 bytes) (reviewed versions) [best revision]
- Unitary-triangular factorizations (527 bytes) (reviewed versions) [best revision]
- Householder (reflections) method for reducing of a matrix to Hessenberg form (2,422 bytes) (reviewed versions) [best revision]
- Pairwise summation (111 bytes) (reviewed versions) [best revision]
- Parallel prefix scan algorithm using pairwise summation (165 bytes) (reviewed versions) [best revision]
- Uniform norm of a vector: Real version, serial-parallel variant (223 bytes) (reviewed versions) [best revision]
- Fast Fourier transform for powers-of-two (142 bytes) (reviewed versions) [best revision]
- Dense matrix multiplication (110 bytes) (reviewed versions) [best revision]
- Matrix decomposition problem (110 bytes) (reviewed versions) [best revision]
- Triangular decompositions (107 bytes) (reviewed versions) [best revision]
- Gaussian elimination (finding the LU decomposition) (134 bytes) (reviewed versions) [best revision]
- Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix (207 bytes) (reviewed versions) [best revision]
- Gaussian elimination, compact scheme for tridiagonal matrices, serial version (9,330 bytes) (reviewed versions) [best revision]
- 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]