Long pages

Showing below up to 20 results in range #1 to #20.

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)

1. (hist) ‎Cholesky method ‎[36,489 bytes]
2. (hist) ‎Glossary ‎[35,612 bytes]
3. (hist) ‎Cholesky decomposition ‎[27,885 bytes]
4. (hist) ‎Description of algorithm properties and structure ‎[23,254 bytes]
5. (hist) ‎Poisson equation, solving with DFT ‎[23,205 bytes]
6. (hist) ‎Givens method ‎[19,186 bytes]
7. (hist) ‎DCSC algorithm for finding the strongly connected components ‎[16,575 bytes]
8. (hist) ‎Backward substitution ‎[16,438 bytes]
9. (hist) ‎Householder (reflections) method for reducing a symmetric matrix to tridiagonal form ‎[16,217 bytes]
10. (hist) ‎Boruvka's algorithm ‎[14,885 bytes]
11. (hist) ‎Purdom's algorithm ‎[14,464 bytes]
12. (hist) ‎Algorithm classification ‎[14,160 bytes]
13. (hist) ‎Two-sided Thomas algorithm, pointwise version ‎[12,979 bytes]
14. (hist) ‎One step of the dqds algorithm ‎[12,038 bytes]
15. (hist) ‎Breadth-first search (BFS) ‎[11,853 bytes]
16. (hist) ‎Thomas algorithm, pointwise version ‎[11,793 bytes]
17. (hist) ‎Stone doubling algorithm for the LU decomposition of a tridiagonal matrix ‎[11,754 bytes]
18. (hist) ‎Linpack benchmark ‎[11,057 bytes]
19. (hist) ‎Single-qubit transform of a state vector ‎[11,023 bytes]
20. (hist) ‎Gaussian elimination, compact scheme for tridiagonal matrices and its modifications ‎[10,636 bytes]

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)