Oldest pages
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)
- Help (12:37, 25 March 2015)
- Back substitution (14:21, 30 July 2015)
- Open Encyclopedia of Parallel Algorithmic Features (22:46, 3 September 2015)
- Elimination method, pointwise version (17:41, 1 March 2016)
- Glossary (11:37, 18 June 2016)
- Description of algorithm properties and structure (10:23, 24 October 2017)
- Methods for solving tridiagonal SLAEs (15:32, 9 November 2017)
- Householder (reflections) method for the QR decomposition of a matrix (13:42, 2 March 2018)
- LU decomposition using Gaussian elimination without pivoting (11:23, 5 March 2018)
- LU decomposition using Gaussian elimination with pivoting (11:40, 5 March 2018)
- All Pairs Shortest Path (APSP) (17:06, 6 March 2018)
- Transitive closure of a directed graph (17:06, 6 March 2018)
- Search for isomorphic subgraphs (17:07, 6 March 2018)
- Graph connectivity (17:07, 6 March 2018)
- Finding maximal flow in a transportation network (17:08, 6 March 2018)
- Assignment problem (17:08, 6 March 2018)
- Pairwise summation (14:11, 14 March 2018)
- Parallel prefix scan algorithm using pairwise summation (14:14, 14 March 2018)
- Uniform norm of a vector: Real version, serial-parallel variant (14:18, 14 March 2018)
- Fast Fourier transform for powers-of-two (14:22, 14 March 2018)
- 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)
- Prim's algorithm (16:47, 14 March 2018)
- GHS algorithm (16:49, 14 March 2018)
- Ullman's algorithm (16:50, 14 March 2018)
- VF2 algorithm (16:51, 14 March 2018)
- Disjoint set union (16:54, 14 March 2018)
- Tarjan's strongly connected components algorithm (16:55, 14 March 2018)
- Tarjan's biconnected components algorithm (16:57, 14 March 2018)
- Tarjan's algorithm for finding the bridges of a graph (16:58, 14 March 2018)
- Vertex connectivity of a graph (16:59, 14 March 2018)
- Gabow's edge connectivity algorithm (17:00, 14 March 2018)
- Ford–Fulkerson algorithm (17:01, 14 March 2018)
- Preflow-Push algorithm (17:04, 14 March 2018)
- Finding minimal-cost flow in a transportation network (17:06, 14 March 2018)
- Hungarian algorithm (17:08, 14 March 2018)
- Auction algorithm (17:09, 14 March 2018)
- Hopcroft–Karp algorithm (17:10, 14 March 2018)
- Two-qubit transform of a state vector (17:12, 14 March 2018)
- K-means clustering (17:14, 14 March 2018)
- Face recognition (17:20, 14 March 2018)
- Stochastic dual dynamic programming (SDDP) (17:23, 14 March 2018)
- Newton's method for systems of nonlinear equations (17:24, 14 March 2018)
- Cubature rules (17:26, 14 March 2018)
- Numerical quadrature (cubature) rules on an interval (for a multidimensional cube) (17:28, 14 March 2018)
- Meet-in-the-middle attack (17:30, 14 March 2018)
- Householder (reflections) method for reducing of a matrix to Hessenberg form (13:03, 15 March 2018)
- Algorithm classification (13:06, 15 March 2018)
- QR decomposition of dense nonsingular matrices (16:14, 16 March 2018)
- Gaussian elimination, compact scheme for tridiagonal matrices and its modifications (16:41, 16 March 2018)
- Gaussian elimination, compact scheme for tridiagonal matrices, serial variant (16:53, 16 March 2018)
- Orthogonalization method (16:58, 16 March 2018)