Pages with the most revisions
Jump to navigation
Jump to search
Showing below up to 100 results in range #1 to #100.
View (previous 100 | next 100) (20 | 50 | 100 | 250 | 500)
- Cholesky decomposition (120 revisions)
- Givens method (78 revisions)
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form (75 revisions)
- Poisson equation, solving with DFT (72 revisions)
- Elimination method, pointwise version (62 revisions)
- Bellman-Ford algorithm (60 revisions)
- Dijkstra's algorithm (59 revisions)
- One step of the dqds algorithm (58 revisions)
- Boruvka's algorithm (55 revisions)
- The serial-parallel summation method (54 revisions)
- Repeated Thomas algorithm, pointwise version (53 revisions)
- Single-qubit transform of a state vector (50 revisions)
- Linpack benchmark (48 revisions)
- Methods for solving tridiagonal SLAEs (45 revisions)
- DCSC algorithm for finding the strongly connected components (39 revisions)
- Purdom's algorithm (38 revisions)
- Stone doubling algorithm for the LU decomposition of a tridiagonal matrix (37 revisions)
- Gaussian elimination, compact scheme for tridiagonal matrices, serial variant (34 revisions)
- Breadth-first search (BFS) (34 revisions)
- Algorithm classification (32 revisions)
- Horners method (30 revisions)
- Gaussian elimination, compact scheme for tridiagonal matrices and its modifications (30 revisions)
- Cholesky method (30 revisions)
- Back substitution (28 revisions)
- Dense matrix multiplication (serial version for real matrices) (15 revisions)
- QR decomposition of dense nonsingular matrices (14 revisions)
- Forward substitution (13 revisions)
- Dot product (13 revisions)
- Single Source Shortest Path (SSSP) (12 revisions)
- Description of algorithm properties and structure (11 revisions)
- Cooley–Tukey Fast Fourier Transform, radix-2 case (10 revisions)
- The dqds algorithm for calculating singular values of bidiagonal matrices (10 revisions)
- Orthogonalization method (10 revisions)
- About project (9 revisions)
- Δ-stepping algorithm (8 revisions)
- Dense matrix-vector multiplication (8 revisions)
- BFS, C++, MPI, Boost Graph Library (7 revisions)
- Cooley-Tukey, scalability (7 revisions)
- BFS, RCC for CPU (7 revisions)
- BFS, RCC for GPU (7 revisions)
- LU decomposition via Gaussian elimination (6 revisions)
- Pairwise summation of numbers (6 revisions)
- BFS, GAP (6 revisions)
- Backward substitution (6 revisions)
- BFS, C++, Boost Graph Library (6 revisions)
- LU decomposition using Gaussian elimination with pivoting (6 revisions)
- Construction of the minimum spanning tree (MST) (5 revisions)
- QR decomposition methods for dense Hessenberg matrices (5 revisions)
- BFS, Java, WebGraph (5 revisions)
- BFS, Python, NetworkX (5 revisions)
- Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix (5 revisions)
- Glossary (5 revisions)
- BFS, Ligra (5 revisions)
- BFS, Python/C++, NetworKit (4 revisions)
- Purdom's, Boost Graph Library (4 revisions)
- Cholesky decomposition, scalability (4 revisions)
- Triangular decomposition of a Gram matrix (4 revisions)
- Gaussian elimination, compact scheme for tridiagonal matrices, serial version (4 revisions)
- Graph connectivity (4 revisions)
- Cholesky decomposition, locality (4 revisions)
- Help (3 revisions)
- Unitary-triangular factorizations (3 revisions)
- Two-sided Thomas algorithm, pointwise version (3 revisions)
- Transitive closure of a directed graph (3 revisions)
- Cooley-Tukey, locality (3 revisions)
- All Pairs Shortest Path (APSP) (3 revisions)
- LU decomposition using Gaussian elimination without pivoting (3 revisions)
- Floyd-Warshall algorithm (3 revisions)
- Shiloach-Vishkin algorithm for finding the connected components (3 revisions)
- Dijkstra, VGL, push (3 revisions)
- Finding maximal flow in a transportation network (3 revisions)
- Search for isomorphic subgraphs (3 revisions)
- Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix (3 revisions)
- Givens (rotations) method for the QR decomposition of a matrix (3 revisions)
- Tarjan-Vishkin biconnected components algorithm (2 revisions)
- Householder (reflections) method for reducing of a matrix to Hessenberg form (2 revisions)
- Stone doubling algorithm for solving bidiagonal SLAEs (2 revisions)
- Assignment problem (2 revisions)
- Ford–Fulkerson, Java, JGraphT (2 revisions)
- Cholesky decomposition, SCALAPACK (2 revisions)
- Gaussian elimination with row pivoting (2 revisions)
- Householder (reflections) method for the QR decomposition of a matrix (2 revisions)
- Kruskal's, C++, MPI, Parallel Boost Graph Library (2 revisions)
- Gaussian elimination (finding the LU decomposition) (2 revisions)
- BFS, VGL (2 revisions)
- Tarjan's strongly connected components, Java, JGraphT (2 revisions)
- Thomas algorithm, pointwise version (2 revisions)
- Open Encyclopedia of Parallel Algorithmic Features (2 revisions)
- Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form (2 revisions)
- Unitary reductions to Hessenberg form (1 revision)
- K-means clustering, SAP HANA (1 revision)
- Floyd-Warshall, C++, Boost Graph Library (1 revision)
- Longest shortest path, Python/C++, NetworKit (1 revision)
- Kaczmarz's, MATLAB3 (1 revision)
- K-means clustering, Spark (1 revision)
- K-means clustering, scalability1 (1 revision)
- Complete cyclic reduction, locality (1 revision)
- Matrix decomposition problem (1 revision)
- Complete cyclic reduction (1 revision)
- Householder (reflections) reduction of a matrix to bidiagonal form, locality (1 revision)
