Pages that link to "Algowiki:Levels of classification"
Jump to navigation
Jump to search
The following pages link to Algowiki:Levels of classification:
View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)- Algorithm classification (← links)
- Cholesky decomposition (← links)
- Cholesky method (← links)
- Horners method (← links)
- Dot product (← links)
- Forward substitution (← links)
- Dense matrix multiplication (serial version for real matrices) (← links)
- Cooley–Tukey Fast Fourier Transform, radix-2 case (← links)
- Dense matrix-vector multiplication (← links)
- Pairwise summation of numbers (← links)
- LU decomposition via Gaussian elimination (← links)
- Backward substitution (← links)
- Single Source Shortest Path (SSSP) (← links)
- All Pairs Shortest Path (APSP) (← links)
- Transitive closure of a directed graph (← links)
- Construction of the minimum spanning tree (MST) (← links)
- Search for isomorphic subgraphs (← links)
- Graph connectivity (← links)
- Finding maximal flow in a transportation network (← links)
- Assignment problem (← links)
- Givens method (← links)
- Repeated Thomas algorithm, pointwise version (← links)
- Poisson equation, solving with DFT (← links)
- Thomas algorithm, pointwise version (← links)
- Algowiki:Levels of classification (← links)
- Two-sided Thomas algorithm, pointwise version (← links)
- Single-qubit transform of a state vector (← links)
- The serial-parallel summation method (← links)
- Methods for solving tridiagonal SLAEs (← links)
- One step of the dqds algorithm (← links)
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form (← links)
- Linpack benchmark (← links)
- Breadth-first search (BFS) (← links)
- Dijkstra's algorithm (← links)
- Bellman-Ford algorithm (← links)
- Purdom's algorithm (← links)
- DCSC algorithm for finding the strongly connected components (← links)
- Tarjan-Vishkin biconnected components algorithm (← links)
- Boruvka's algorithm (← links)
- LU decomposition using Gaussian elimination without pivoting (← links)
- LU decomposition using Gaussian elimination with pivoting (← links)
- QR decomposition of dense nonsingular matrices (← links)
- Stone doubling algorithm for the LU decomposition of a tridiagonal matrix (← links)
- Gaussian elimination, compact scheme for tridiagonal matrices and its modifications (← links)
- Gaussian elimination, compact scheme for tridiagonal matrices, serial variant (← links)
- Givens (rotations) method for the QR decomposition of a matrix (← links)
- Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix (← links)
- Orthogonalization method (← links)
- Triangular decomposition of a Gram matrix (← links)
- Householder (reflections) method for the QR decomposition of a matrix (← links)
- Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix (← links)
- QR decomposition methods for dense Hessenberg matrices (← links)
- Unitary-triangular factorizations (← links)
- Householder (reflections) method for reducing of a matrix to Hessenberg form (← links)
- Pairwise summation (← links)
- Parallel prefix scan algorithm using pairwise summation (← links)
- Uniform norm of a vector: Real version, serial-parallel variant (← links)
- Fast Fourier transform for powers-of-two (← links)
- Dense matrix multiplication (← links)
- Matrix decomposition problem (← links)
- Triangular decompositions (← links)
- Gaussian elimination (finding the LU decomposition) (← links)
- Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix (← links)
- Gaussian elimination, compact scheme for tridiagonal matrices, serial version (← links)
- Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix (← links)
- Gaussian elimination with column pivoting (← links)
- Gaussian elimination with row pivoting (← links)
- Gaussian elimination with diagonal pivoting (← links)
- Gaussian elimination with complete pivoting (← links)
- Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version (← links)
- Classical orthogonalization method (← links)
- Orthogonalization method with reorthogonalization (← links)
- Reducing matrices to compact forms (← links)
- Unitary reductions to Hessenberg form (← links)
- Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form (← links)
- Unitary reductions to tridiagonal form (← links)
- Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form (← links)
- Eigenvalue decomposition (finding eigenvalues and eigenvectors) (← links)
- Householder (reflections) reduction of a matrix to bidiagonal form (← links)
- Singular value decomposition (finding singular values and singular vectors) (← links)
- Stone doubling algorithm for solving bidiagonal SLAEs (← links)
- Thomas algorithm (← links)
- Stone doubling algorithm (← links)
- Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions (← links)
- Repeated two-sided Thomas algorithm, pointwise version (← links)
- Complete cyclic reduction (← links)
- Block Thomas algorithm (← links)
- Two-sided Thomas algorithm, block variant (← links)
- High Performance Conjugate Gradient (HPCG) benchmark (← links)
- Biconjugate gradient stabilized method (BiCGStab) (← links)
- Kaczmarz's algorithm (← links)
- QR algorithm (← links)
- QR algorithm as implemented in SCALAPACK (← links)
- Hessenberg QR algorithm as implemented in SCALAPACK (← links)
- Symmetric QR algorithm as implemented in SCALAPACK (← links)
- QR algorithm for complex Hermitian matrices as implemented in SCALAPACK (← links)
- The Jacobi (rotations) method for solving the symmetric eigenvalue problem (← links)
- The classical Jacobi (rotations) method with pivoting for symmetric matrices (← links)
- Serial Jacobi (rotations) method for symmetric matrices (← links)
- Serial Jacobi (rotations) method with thresholds for symmetric matrices (← links)
- Lanczos algorithm in exact algorithm (without reorthogonalization) (← links)
- Jacobi (rotations) method for finding singular values (← links)
- Binary search: Finding the position of a target value within a sorted array (← links)
- Depth-first search (DFS) (← links)
- Δ-stepping algorithm (← links)
- Johnson's algorithm (← links)
- Floyd-Warshall algorithm (← links)
- Longest shortest path (← links)
- Kruskal's algorithm (← links)
- Prim's algorithm (← links)
- GHS algorithm (← links)
- Ullman's algorithm (← links)
- VF2 algorithm (← links)
- Shiloach-Vishkin algorithm for finding the connected components (← links)
- Disjoint set union (← links)
- Tarjan's strongly connected components algorithm (← links)
- Tarjan's biconnected components algorithm (← links)
- Tarjan's algorithm for finding the bridges of a graph (← links)
- Vertex connectivity of a graph (← links)
- Gabow's edge connectivity algorithm (← links)
- Ford–Fulkerson algorithm (← links)
- Preflow-Push algorithm (← links)
- Finding minimal-cost flow in a transportation network (← links)
- Hungarian algorithm (← links)
- Auction algorithm (← links)
- Hopcroft–Karp algorithm (← links)
- Two-qubit transform of a state vector (← links)
- K-means clustering (← links)
- Face recognition (← links)
- Stochastic dual dynamic programming (SDDP) (← links)
- Newton's method for systems of nonlinear equations (← links)
- Cubature rules (← links)
- Numerical quadrature (cubature) rules on an interval (for a multidimensional cube) (← links)
- Meet-in-the-middle attack (← links)
- BFS, RCC for CPU (← links)
- BFS, RCC for GPU (← links)
- BFS, C++, Boost Graph Library (← links)
- BFS, C++, MPI, Boost Graph Library (← links)
- BFS, GAP (← links)
- BFS, Java, WebGraph (← links)
- BFS, Python, NetworkX (← links)
- BFS, Python/C++, NetworKit (← links)
- BFS, Ligra (← links)
- Cooley-Tukey, locality (← links)
- Cooley-Tukey, scalability (← links)
- Cholesky decomposition, locality (← links)
- Cholesky decomposition, SCALAPACK (← links)
- Cholesky decomposition, scalability (← links)
- Dijkstra, C++, Boost Graph Library (← links)
- Dijkstra, Python (← links)
- Dijkstra, Python/C++ (← links)
- Dijkstra, C++, MPI: Parallel Boost Graph Library, 1 (← links)
- Dijkstra, C++, MPI: Parallel Boost Graph Library, 2 (← links)
- Dijkstra, locality (← links)
- Dijkstra, Google (← links)
- Bellman-Ford, C++, Boost Graph Library (← links)
- Bellman-Ford, Python, NetworkX (← links)
- Bellman-Ford, Java, JGraphT (← links)
- Bellman-Ford, OpenMP, Stinger (← links)
- Bellman-Ford, Nvidia nvGraph (← links)
- Bellman-Ford, MPI, Graph500 (← links)
- Bellman-Ford, Ligra (← links)
- Bellman-Ford, locality (← links)
- Bellman-Ford, scalability (← links)
- BFS, MPI, Graph500 (← links)
- Δ-stepping, C++, MPI, Parallel Boost Graph Library (← links)
- Δ-stepping, Gap (← links)
- Johnson's, C++, Boost Graph Library (← links)
- Floyd-Warshall, C++, Boost Graph Library (← links)
- Floyd-Warshall, Python, NetworkX (← links)
- Floyd-Warshall, Java, JGraphT (← links)
- Floyd-Warshall, scalability (← links)
- Purdom's, Boost Graph Library (← links)
- Boruvka's, C++, MPI, Parallel Boost Graph Library (← links)
- Boruvka's, RCC for CPU (← links)
- Boruvka's, RCC for GPU (← links)
- Boruvka's, scalability (← links)
- Boruvka's, locality (← links)
- Kruskal's, C++, Boost Graph Library (← links)
- Kruskal's, C++, MPI, Parallel Boost Graph Library (← links)
- Kruskal's, Python, NetworkX (← links)
- Kruskal's, Java, JGraphT (← links)
- Prim's, C++, Boost Graph Library (← links)
- Prim's, Java, JGraphT (← links)
- Ullman's, C++, Chemical Descriptors Library (← links)
- Ullman's, C++, VF Library (← links)
- VF2, C++, VF Library (← links)
- VF2, C++, Boost Graph Library (← links)
- VF2, Python, NetworkX (← links)
- Disjoint set union, Boost Graph Library (← links)
- Disjoint set union, Java, JGraphT (← links)
- Tarjan's strongly connected components, C++, Boost Graph Library (← links)
- Tarjan's strongly connected components, Java, WebGraph (← links)
- Tarjan's strongly connected components, Java, JGraphT (← links)
- Tarjan's strongly connected components, Python, NetworkX (← links)
- Tarjan's strongly connected components, Python/C++, NetworKit (← links)
- DCSC for finding the strongly connected components, C++, MPI, Parallel Boost Graph Library (← links)
- Tarjan's biconnected components, C++, Boost Graph Library (← links)
- Tarjan's biconnected components, Python, NetworkX (← links)
- Tarjan's biconnected components, Java, JGraphT (← links)
- Tarjan-Vishkin biconnected components, scalability (← links)
- Ford–Fulkerson, C++, Boost Graph Library (← links)
- Ford–Fulkerson, Python, NetworkX (← links)
- Ford–Fulkerson, Java, JGraphT (← links)
- Preflow-Push, C++, Boost Graph Library (← links)
- Preflow-Push, Python, NetworkX (← links)
- Hungarian, Java, JGraphT (← links)
- Hopcroft–Karp, Java, JGraphT (← links)
- Longest shortest path, Java, WebGraph (← links)
- Longest shortest path, Python/C++, NetworKit (← links)
- DFS, C++, Boost Graph Library (← links)
- DFS, C++, MPI, Parallel Boost Graph Library (← links)
- DFS, Python, NetworkX (← links)
- Lanczos, MPI, OpenMP (← links)
- Lanczos, C++, MPI (← links)
- Lanczos, C++, MPI, 2 (← links)
- Lanczos, C, MPI (← links)
- Lanczos, C++, MPI, 3 (← links)
- One step of the dqds, LAPACK (← links)
- Horners, locality (← links)
- Dense matrix-vector multiplication, locality (← links)
- Dense matrix-vector multiplication, scalability (← links)
- Dense matrix multiplication, locality (← links)
- Dense matrix multiplication, scalability (← links)
- Pairwise summation of numbers, locality (← links)
- Pairwise summation of numbers, scalability (← links)
- Uniform norm of a vector, locality (← links)
- Dot product, locality (← links)
- Dot product, scalability (← links)
- The serial-parallel summation method, locality (← links)
- The serial-parallel summation method, scalability (← links)
- LU decomposition via Gaussian elimination, locality (← links)
- LU decomposition via Gaussian elimination, scalability (← links)
- Givens method, locality (← links)
- Householder (reflections) method for the QR decomposition, locality (← links)
- Householder (reflections) method for the QR decomposition, SCALAPACK (← links)
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, locality (← links)
- Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, SCALAPACK (← links)
- Householder (reflections) reduction of a matrix to bidiagonal form, locality (← links)
- Householder (reflections) reduction of a matrix to bidiagonal form, SCALAPACK (← links)
- HPCG, locality (← links)
- HPCG, scalability (← links)
- BiCGStab, MIT (← links)
- BiCGStab, HYPRE (← links)
- BiCGStab, NVIDIA AmgX (← links)
- Kaczmarz's, MATLAB1 (← links)
- Kaczmarz's, MATLAB2 (← links)
- Kaczmarz's, MATLAB3 (← links)
- Linpack, locality (← links)
- Linpack, HPL (← links)