Long pages
Jump to navigation
Jump to search
Showing below up to 250 results in range #1 to #250.
View (previous 250 | next 250) (20 | 50 | 100 | 250 | 500)
- (hist) Cholesky method [36,489 bytes]
- (hist) Glossary [35,612 bytes]
- (hist) Cholesky decomposition [27,885 bytes]
- (hist) Description of algorithm properties and structure [23,254 bytes]
- (hist) Poisson equation, solving with DFT [23,205 bytes]
- (hist) Givens method [19,186 bytes]
- (hist) DCSC algorithm for finding the strongly connected components [16,575 bytes]
- (hist) Backward substitution [16,438 bytes]
- (hist) Householder (reflections) method for reducing a symmetric matrix to tridiagonal form [16,217 bytes]
- (hist) Boruvka's algorithm [14,885 bytes]
- (hist) Purdom's algorithm [14,464 bytes]
- (hist) Algorithm classification [14,160 bytes]
- (hist) Two-sided Thomas algorithm, pointwise version [12,979 bytes]
- (hist) One step of the dqds algorithm [12,038 bytes]
- (hist) Breadth-first search (BFS) [11,853 bytes]
- (hist) Thomas algorithm, pointwise version [11,793 bytes]
- (hist) Stone doubling algorithm for the LU decomposition of a tridiagonal matrix [11,754 bytes]
- (hist) Linpack benchmark [11,057 bytes]
- (hist) Single-qubit transform of a state vector [11,023 bytes]
- (hist) Gaussian elimination, compact scheme for tridiagonal matrices and its modifications [10,636 bytes]
- (hist) Cooley–Tukey Fast Fourier Transform, radix-2 case [10,606 bytes]
- (hist) Forward substitution [10,596 bytes]
- (hist) Methods for solving tridiagonal SLAEs [10,435 bytes]
- (hist) All Pairs Shortest Path (APSP) [10,383 bytes]
- (hist) Graph connectivity [9,572 bytes]
- (hist) Gaussian elimination, compact scheme for tridiagonal matrices, serial variant [9,486 bytes]
- (hist) Dense matrix multiplication, locality [9,363 bytes]
- (hist) Gaussian elimination, compact scheme for tridiagonal matrices, serial version [9,330 bytes]
- (hist) Two-sided Thomas, locality [9,199 bytes]
- (hist) Construction of the minimum spanning tree (MST) [9,031 bytes]
- (hist) Bellman-Ford algorithm [8,948 bytes]
- (hist) Dot product [8,732 bytes]
- (hist) Dense matrix multiplication (serial version for real matrices) [8,676 bytes]
- (hist) Thomas algorithm, locality [8,498 bytes]
- (hist) Thomas, locality [8,488 bytes]
- (hist) Dense matrix-vector multiplication [8,409 bytes]
- (hist) Dijkstra, Google [8,387 bytes]
- (hist) About project [7,657 bytes]
- (hist) Backward substitution, locality [7,648 bytes]
- (hist) LU decomposition via Gaussian elimination, locality [7,632 bytes]
- (hist) Transitive closure of a directed graph [7,508 bytes]
- (hist) Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, SCALAPACK [7,498 bytes]
- (hist) The serial-parallel summation method [7,465 bytes]
- (hist) Single Source Shortest Path (SSSP) [7,288 bytes]
- (hist) Dijkstra's algorithm [6,845 bytes]
- (hist) Horners method [6,835 bytes]
- (hist) Poisson equation, solving with DFT, locality [6,763 bytes]
- (hist) Linpack, locality [6,582 bytes]
- (hist) Dijkstra, locality [6,409 bytes]
- (hist) Cholesky decomposition, locality [6,337 bytes]
- (hist) Single-qubit transform of a state vector, locality [6,157 bytes]
- (hist) Boruvka's, scalability [5,868 bytes]
- (hist) Horners, locality [5,792 bytes]
- (hist) Single-qubit transform of a state vector, scalability [5,789 bytes]
- (hist) Bellman-Ford, scalability [5,787 bytes]
- (hist) Cholesky decomposition, SCALAPACK [5,529 bytes]
- (hist) Householder (reflections) method for reducing a symmetric matrix to tridiagonal form, locality [5,336 bytes]
- (hist) Boruvka's, locality [5,049 bytes]
- (hist) Bellman-Ford, locality [4,769 bytes]
- (hist) Pairwise summation of numbers [4,707 bytes]
- (hist) One step of the dqds, LAPACK [4,696 bytes]
- (hist) Cholesky decomposition, scalability [4,546 bytes]
- (hist) Orthogonalization method [4,430 bytes]
- (hist) QR decomposition of dense nonsingular matrices [4,050 bytes]
- (hist) Linpack, HPL [4,026 bytes]
- (hist) Dot product, locality [3,730 bytes]
- (hist) Finding maximal flow in a transportation network [3,721 bytes]
- (hist) The serial-parallel summation method, scalability [3,552 bytes]
- (hist) Dense matrix multiplication, scalability [3,550 bytes]
- (hist) The serial-parallel summation method, locality [3,524 bytes]
- (hist) Givens method, locality [3,509 bytes]
- (hist) LU decomposition via Gaussian elimination, scalability [3,407 bytes]
- (hist) Dot product, scalability [3,105 bytes]
- (hist) Assignment problem [2,797 bytes]
- (hist) DCSC for finding the strongly connected components, C++, MPI, Parallel Boost Graph Library [2,639 bytes]
- (hist) Poisson equation, solving with DFT, scalability [2,604 bytes]
- (hist) Householder (reflections) method for reducing of a matrix to Hessenberg form [2,422 bytes]
- (hist) Purdom's, Boost Graph Library [2,304 bytes]
- (hist) The dqds algorithm for calculating singular values of bidiagonal matrices [1,840 bytes]
- (hist) Givens (rotations) method for the QR decomposition of a matrix [1,809 bytes]
- (hist) Search for isomorphic subgraphs [1,659 bytes]
- (hist) Kruskal's, C++, MPI, Parallel Boost Graph Library [1,457 bytes]
- (hist) LU decomposition using Gaussian elimination with pivoting [1,423 bytes]
- (hist) Householder (reflections) method for the QR decomposition of a matrix [1,401 bytes]
- (hist) Dijkstra, C++, MPI: Parallel Boost Graph Library, 2 [1,350 bytes]
- (hist) Boruvka's, C++, MPI, Parallel Boost Graph Library [1,261 bytes]
- (hist) Longest shortest path, Java, WebGraph [1,256 bytes]
- (hist) Cooley-Tukey, locality [1,114 bytes]
- (hist) Dijkstra, C++, MPI: Parallel Boost Graph Library, 1 [1,009 bytes]
- (hist) Δ-stepping, C++, MPI, Parallel Boost Graph Library [964 bytes]
- (hist) Dijkstra, C++, Boost Graph Library [963 bytes]
- (hist) DFS, C++, Boost Graph Library [957 bytes]
- (hist) Triangular decomposition of a Gram matrix [950 bytes]
- (hist) LU decomposition via Gaussian elimination [943 bytes]
- (hist) Ford–Fulkerson, C++, Boost Graph Library [937 bytes]
- (hist) Poisson equation, solving with DFT, PFFT [918 bytes]
- (hist) Poisson equation, solving with DFT, AccFFT [908 bytes]
- (hist) Poisson equation, solving with DFT, MKL FFT [902 bytes]
- (hist) Poisson equation, solving with DFT, FFTE [898 bytes]
- (hist) Poisson equation, solving with DFT, cuFFT [897 bytes]
- (hist) Tarjan's strongly connected components, Python/C++, NetworKit [897 bytes]
- (hist) Tarjan's strongly connected components, Python, NetworkX [893 bytes]
- (hist) Dijkstra, Python [891 bytes]
- (hist) Poisson equation, solving with DFT, P3DFFT [890 bytes]
- (hist) Preflow-Push, Python, NetworkX [886 bytes]
- (hist) Poisson equation, solving with DFT, FFTW [882 bytes]
- (hist) Ford–Fulkerson, Python, NetworkX [871 bytes]
- (hist) Tarjan's biconnected components, Python, NetworkX [865 bytes]
- (hist) DFS, C++, MPI, Parallel Boost Graph Library [845 bytes]
- (hist) Longest shortest path, Python/C++, NetworKit [842 bytes]
- (hist) Hungarian, Java, JGraphT [837 bytes]
- (hist) Kruskal's, C++, Boost Graph Library [832 bytes]
- (hist) Prim's, C++, Boost Graph Library [831 bytes]
- (hist) Floyd-Warshall, Python, NetworkX [830 bytes]
- (hist) Bellman-Ford, Python, NetworkX [827 bytes]
- (hist) Preflow-Push, C++, Boost Graph Library [823 bytes]
- (hist) Kruskal's, Python, NetworkX [821 bytes]
- (hist) Tarjan's strongly connected components, Java, WebGraph [820 bytes]
- (hist) BFS, C++, Boost Graph Library [820 bytes]
- (hist) Ford–Fulkerson, Java, JGraphT [819 bytes]
- (hist) DFS, Python, NetworkX [817 bytes]
- (hist) Tarjan's biconnected components, C++, Boost Graph Library [812 bytes]
- (hist) Tarjan's strongly connected components, C++, Boost Graph Library [809 bytes]
- (hist) Johnson's, C++, Boost Graph Library [804 bytes]
- (hist) Dijkstra, Python/C++ [803 bytes]
- (hist) Floyd-Warshall, C++, Boost Graph Library [797 bytes]
- (hist) Disjoint set union, Boost Graph Library [794 bytes]
- (hist) Tarjan's strongly connected components, Java, JGraphT [792 bytes]
- (hist) Bellman-Ford, C++, Boost Graph Library [791 bytes]
- (hist) Dijkstra, VGL, pull [779 bytes]
- (hist) Dijkstra, VGL, push [779 bytes]
- (hist) Tarjan's biconnected components, Java, JGraphT [777 bytes]
- (hist) Hopcroft–Karp, Java, JGraphT [773 bytes]
- (hist) VF2, C++, Boost Graph Library [773 bytes]
- (hist) BFS, Python, NetworkX [773 bytes]
- (hist) BFS, Java, WebGraph [772 bytes]
- (hist) Ullman's, C++, Chemical Descriptors Library [767 bytes]
- (hist) Floyd-Warshall, Java, JGraphT [765 bytes]
- (hist) Kruskal's, Java, JGraphT [761 bytes]
- (hist) BFS, C++, MPI, Boost Graph Library [761 bytes]
- (hist) Bellman-Ford, Java, JGraphT [758 bytes]
- (hist) BFS, Python/C++, NetworKit [757 bytes]
- (hist) VF2, Python, NetworkX [754 bytes]
- (hist) Prim's, Java, JGraphT [752 bytes]
- (hist) BFS, VGL [743 bytes]
- (hist) Disjoint set union, Java, JGraphT [741 bytes]
- (hist) PageRank, VGL [731 bytes]
- (hist) HITS, VGL [726 bytes]
- (hist) Ullman's, C++, VF Library [723 bytes]
- (hist) Bellman-Ford, Nvidia nvGraph [719 bytes]
- (hist) Bellman-Ford, OpenMP, Stinger [712 bytes]
- (hist) Bellman-Ford, MPI, Graph500 [705 bytes]
- (hist) Bellman-Ford, Ligra [703 bytes]
- (hist) Cooley-Tukey, scalability [701 bytes]
- (hist) Δ-stepping, Gap [698 bytes]
- (hist) QR decomposition methods for dense Hessenberg matrices [687 bytes]
- (hist) Boruvka's, RCC for CPU [677 bytes]
- (hist) K-means clustering, SAP HANA [674 bytes]
- (hist) VF2, C++, VF Library [669 bytes]
- (hist) BFS, Ligra [642 bytes]
- (hist) BFS, RCC for GPU [637 bytes]
- (hist) K-means clustering, Ayasdi [635 bytes]
- (hist) Boruvka's, RCC for GPU [625 bytes]
- (hist) LU decomposition using Gaussian elimination without pivoting [625 bytes]
- (hist) BFS, MPI, Graph500 [624 bytes]
- (hist) K-means clustering, RapidMiner [621 bytes]
- (hist) K-means clustering, MATLAB [616 bytes]
- (hist) BFS, RCC for CPU [615 bytes]
- (hist) BFS, GAP [608 bytes]
- (hist) K-means clustering, Mathematica [605 bytes]
- (hist) K-means clustering, SAS [590 bytes]
- (hist) K-means clustering, Stata [579 bytes]
- (hist) Unitary-triangular factorizations [527 bytes]
- (hist) Help [379 bytes]
- (hist) Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form [275 bytes]
- (hist) Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form [275 bytes]
- (hist) Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions [269 bytes]
- (hist) Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version [236 bytes]
- (hist) Numerical quadrature (cubature) rules on an interval (for a multidimensional cube) [230 bytes]
- (hist) Uniform norm of a vector: Real version, serial-parallel variant [223 bytes]
- (hist) The classical Jacobi (rotations) method with pivoting for symmetric matrices [221 bytes]
- (hist) Serial Jacobi (rotations) method with thresholds for symmetric matrices [220 bytes]
- (hist) Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix [215 bytes]
- (hist) Jacobi (rotations) method for finding singular values [208 bytes]
- (hist) Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix [207 bytes]
- (hist) Unitary reductions to tridiagonal form [206 bytes]
- (hist) Gaussian elimination with diagonal pivoting [206 bytes]
- (hist) The Jacobi (rotations) method for solving the symmetric eigenvalue problem [205 bytes]
- (hist) Householder (reflections) reduction of a matrix to bidiagonal form [201 bytes]
- (hist) Unitary reductions to Hessenberg form [200 bytes]
- (hist) Serial Jacobi (rotations) method for symmetric matrices [198 bytes]
- (hist) Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix [197 bytes]
- (hist) Gaussian elimination with complete pivoting [196 bytes]
- (hist) Eigenvalue decomposition (finding eigenvalues and eigenvectors) [192 bytes]
- (hist) Singular value decomposition (finding singular values and singular vectors) [190 bytes]
- (hist) Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix [188 bytes]
- (hist) Gaussian elimination with column pivoting [187 bytes]
- (hist) Gaussian elimination with row pivoting [185 bytes]
- (hist) Lanczos algorithm in exact algorithm (without reorthogonalization) [184 bytes]
- (hist) QR algorithm for complex Hermitian matrices as implemented in SCALAPACK [184 bytes]
- (hist) Stochastic dual dynamic programming (SDDP) [182 bytes]
- (hist) Hessenberg QR algorithm as implemented in SCALAPACK [173 bytes]
- (hist) Stone doubling algorithm for solving bidiagonal SLAEs [170 bytes]
- (hist) Biconjugate gradient stabilized method (BiCGStab) [168 bytes]
- (hist) Symmetric QR algorithm as implemented in SCALAPACK [167 bytes]
- (hist) Tarjan-Vishkin biconnected components algorithm [167 bytes]
- (hist) Finding minimal-cost flow in a transportation network [166 bytes]
- (hist) Parallel prefix scan algorithm using pairwise summation [165 bytes]
- (hist) Gabow's edge connectivity algorithm [163 bytes]
- (hist) Tarjan's strongly connected components algorithm [161 bytes]
- (hist) Shiloach-Vishkin algorithm for finding the connected components [161 bytes]
- (hist) Repeated Thomas algorithm, pointwise version [161 bytes]
- (hist) Numerical quadrature (cubature) rules on an interval (for a multidimensional cube), scalability [159 bytes]
- (hist) Reducing matrices to compact forms [156 bytes]
- (hist) Tarjan's biconnected components algorithm [152 bytes]
- (hist) Two-qubit transform of a state vector [151 bytes]
- (hist) Repeated two-sided Thomas algorithm, pointwise version [151 bytes]
- (hist) Newton's method for systems of nonlinear equations, Numerical Mathematics - NewtonLib [149 bytes]
- (hist) Newton's method for systems of nonlinear equations [149 bytes]
- (hist) Fast Fourier transform for powers-of-two [142 bytes]
- (hist) Householder (reflections) reduction of a matrix to bidiagonal form, SCALAPACK [141 bytes]
- (hist) Householder (reflections) reduction of a matrix to bidiagonal form, locality [140 bytes]
- (hist) Tarjan's algorithm for finding the bridges of a graph [139 bytes]
- (hist) Orthogonalization method with reorthogonalization [136 bytes]
- (hist) Vertex connectivity of a graph [135 bytes]
- (hist) Gaussian elimination (finding the LU decomposition) [134 bytes]
- (hist) Newton's method for systems of nonlinear equations, Numerical Recipes [133 bytes]
- (hist) Householder (reflections) method for the QR decomposition, SCALAPACK [132 bytes]
- (hist) Householder (reflections) method for the QR decomposition, locality [131 bytes]
- (hist) Two-sided Thomas algorithm, block variant [130 bytes]
- (hist) Classical orthogonalization method [130 bytes]
- (hist) Newton's method for systems of nonlinear equations, scalability4 [128 bytes]
- (hist) Newton's method for systems of nonlinear equations, scalability3 [128 bytes]
- (hist) Newton's method for systems of nonlinear equations, scalability2 [128 bytes]
- (hist) Newton's method for systems of nonlinear equations, scalability1 [128 bytes]
- (hist) Preflow-Push algorithm [128 bytes]
- (hist) Disjoint set union [128 bytes]
- (hist) Complete cyclic reduction [127 bytes]
- (hist) Newton's method for systems of nonlinear equations, parallel3 [125 bytes]
- (hist) Newton's method for systems of nonlinear equations, parallel2 [125 bytes]
- (hist) Newton's method for systems of nonlinear equations, parallel1 [125 bytes]
- (hist) Newton's method for systems of nonlinear equations, ALIAS C++ [125 bytes]
- (hist) Newton's method for systems of nonlinear equations, Sundials [124 bytes]
- (hist) QR algorithm as implemented in SCALAPACK [122 bytes]
- (hist) Newton's method for systems of nonlinear equations, PETSc [121 bytes]
- (hist) High Performance Conjugate Gradient (HPCG) benchmark [116 bytes]
- (hist) Tarjan-Vishkin biconnected components, scalability [114 bytes]
- (hist) Longest shortest path [114 bytes]
- (hist) Ford–Fulkerson algorithm [112 bytes]
- (hist) Dense matrix-vector multiplication, scalability [111 bytes]