Long 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)
- (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]