Oldest pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #51 to #100.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- 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)
