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