Oldest pages

Jump to navigation Jump to search

Showing below up to 50 results in range #31 to #80.

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

  1. Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version‏‎ (14:58, 14 March 2018)
  2. Classical orthogonalization method‏‎ (14:59, 14 March 2018)
  3. Orthogonalization method with reorthogonalization‏‎ (15:01, 14 March 2018)
  4. Reducing matrices to compact forms‏‎ (15:04, 14 March 2018)
  5. Unitary reductions to Hessenberg form‏‎ (15:05, 14 March 2018)
  6. Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form‏‎ (15:06, 14 March 2018)
  7. Unitary reductions to tridiagonal form‏‎ (15:08, 14 March 2018)
  8. Eigenvalue decomposition (finding eigenvalues and eigenvectors)‏‎ (15:13, 14 March 2018)
  9. Householder (reflections) reduction of a matrix to bidiagonal form‏‎ (15:15, 14 March 2018)
  10. Singular value decomposition (finding singular values and singular vectors)‏‎ (15:16, 14 March 2018)
  11. The dqds algorithm for calculating singular values of bidiagonal matrices‏‎ (15:18, 14 March 2018)
  12. Thomas algorithm‏‎ (15:25, 14 March 2018)
  13. Repeated Thomas algorithm, pointwise version‏‎ (15:27, 14 March 2018)
  14. Stone doubling algorithm‏‎ (15:29, 14 March 2018)
  15. Stone doubling algorithm for solving bidiagonal SLAEs‏‎ (15:32, 14 March 2018)
  16. Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions‏‎ (15:34, 14 March 2018)
  17. Repeated two-sided Thomas algorithm, pointwise version‏‎ (15:36, 14 March 2018)
  18. Complete cyclic reduction‏‎ (15:37, 14 March 2018)
  19. Block Thomas algorithm‏‎ (15:40, 14 March 2018)
  20. Two-sided Thomas algorithm, block variant‏‎ (15:42, 14 March 2018)
  21. High Performance Conjugate Gradient (HPCG) benchmark‏‎ (15:43, 14 March 2018)
  22. Biconjugate gradient stabilized method (BiCGStab)‏‎ (15:45, 14 March 2018)
  23. Kaczmarz's algorithm‏‎ (15:46, 14 March 2018)
  24. QR algorithm‏‎ (15:48, 14 March 2018)
  25. QR algorithm as implemented in SCALAPACK‏‎ (15:50, 14 March 2018)
  26. Hessenberg QR algorithm as implemented in SCALAPACK‏‎ (15:52, 14 March 2018)
  27. Symmetric QR algorithm as implemented in SCALAPACK‏‎ (15:54, 14 March 2018)
  28. QR algorithm for complex Hermitian matrices as implemented in SCALAPACK‏‎ (15:57, 14 March 2018)
  29. Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form‏‎ (16:00, 14 March 2018)
  30. The Jacobi (rotations) method for solving the symmetric eigenvalue problem‏‎ (16:05, 14 March 2018)
  31. The classical Jacobi (rotations) method with pivoting for symmetric matrices‏‎ (16:07, 14 March 2018)
  32. Serial Jacobi (rotations) method for symmetric matrices‏‎ (16:08, 14 March 2018)
  33. Serial Jacobi (rotations) method with thresholds for symmetric matrices‏‎ (16:10, 14 March 2018)
  34. Lanczos algorithm in exact algorithm (without reorthogonalization)‏‎ (16:12, 14 March 2018)
  35. Jacobi (rotations) method for finding singular values‏‎ (16:13, 14 March 2018)
  36. Binary search: Finding the position of a target value within a sorted array‏‎ (16:17, 14 March 2018)
  37. Depth-first search (DFS)‏‎ (16:38, 14 March 2018)
  38. Johnson's algorithm‏‎ (16:42, 14 March 2018)
  39. Longest shortest path‏‎ (16:45, 14 March 2018)
  40. Kruskal's algorithm‏‎ (16:46, 14 March 2018)
  41. Prim's algorithm‏‎ (16:47, 14 March 2018)
  42. GHS algorithm‏‎ (16:49, 14 March 2018)
  43. Ullman's algorithm‏‎ (16:50, 14 March 2018)
  44. VF2 algorithm‏‎ (16:51, 14 March 2018)
  45. Disjoint set union‏‎ (16:54, 14 March 2018)
  46. Tarjan's strongly connected components algorithm‏‎ (16:55, 14 March 2018)
  47. Tarjan's biconnected components algorithm‏‎ (16:57, 14 March 2018)
  48. Tarjan's algorithm for finding the bridges of a graph‏‎ (16:58, 14 March 2018)
  49. Vertex connectivity of a graph‏‎ (16:59, 14 March 2018)
  50. Gabow's edge connectivity algorithm‏‎ (17:00, 14 March 2018)

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