Short pages
Jump to navigation
Jump to search
Showing below up to 50 results in range #101 to #150.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- (hist) Newton's method for systems of nonlinear equations, scalability2 [128 bytes]
- (hist) Newton's method for systems of nonlinear equations, scalability3 [128 bytes]
- (hist) Newton's method for systems of nonlinear equations, scalability4 [128 bytes]
- (hist) Classical orthogonalization method [130 bytes]
- (hist) Two-sided Thomas algorithm, block variant [130 bytes]
- (hist) Householder (reflections) method for the QR decomposition, locality [131 bytes]
- (hist) Householder (reflections) method for the QR decomposition, SCALAPACK [132 bytes]
- (hist) Newton's method for systems of nonlinear equations, Numerical Recipes [133 bytes]
- (hist) Gaussian elimination (finding the LU decomposition) [134 bytes]
- (hist) Vertex connectivity of a graph [135 bytes]
- (hist) Orthogonalization method with reorthogonalization [136 bytes]
- (hist) Tarjan's algorithm for finding the bridges of a graph [139 bytes]
- (hist) Householder (reflections) reduction of a matrix to bidiagonal form, locality [140 bytes]
- (hist) Householder (reflections) reduction of a matrix to bidiagonal form, SCALAPACK [141 bytes]
- (hist) Fast Fourier transform for powers-of-two [142 bytes]
- (hist) Newton's method for systems of nonlinear equations [149 bytes]
- (hist) Newton's method for systems of nonlinear equations, Numerical Mathematics - NewtonLib [149 bytes]
- (hist) Repeated two-sided Thomas algorithm, pointwise version [151 bytes]
- (hist) Two-qubit transform of a state vector [151 bytes]
- (hist) Tarjan's biconnected components algorithm [152 bytes]
- (hist) Reducing matrices to compact forms [156 bytes]
- (hist) Numerical quadrature (cubature) rules on an interval (for a multidimensional cube), scalability [159 bytes]
- (hist) Repeated Thomas algorithm, pointwise version [161 bytes]
- (hist) Shiloach-Vishkin algorithm for finding the connected components [161 bytes]
- (hist) Tarjan's strongly connected components algorithm [161 bytes]
- (hist) Gabow's edge connectivity algorithm [163 bytes]
- (hist) Parallel prefix scan algorithm using pairwise summation [165 bytes]
- (hist) Finding minimal-cost flow in a transportation network [166 bytes]
- (hist) Tarjan-Vishkin biconnected components algorithm [167 bytes]
- (hist) Symmetric QR algorithm as implemented in SCALAPACK [167 bytes]
- (hist) Biconjugate gradient stabilized method (BiCGStab) [168 bytes]
- (hist) Stone doubling algorithm for solving bidiagonal SLAEs [170 bytes]
- (hist) Hessenberg QR algorithm as implemented in SCALAPACK [173 bytes]
- (hist) Stochastic dual dynamic programming (SDDP) [182 bytes]
- (hist) QR algorithm for complex Hermitian matrices as implemented in SCALAPACK [184 bytes]
- (hist) Lanczos algorithm in exact algorithm (without reorthogonalization) [184 bytes]
- (hist) Gaussian elimination with row pivoting [185 bytes]
- (hist) Gaussian elimination with column pivoting [187 bytes]
- (hist) Givens (rotations) method for the QR decomposition of a (real) Hessenberg matrix [188 bytes]
- (hist) Singular value decomposition (finding singular values and singular vectors) [190 bytes]
- (hist) Eigenvalue decomposition (finding eigenvalues and eigenvectors) [192 bytes]
- (hist) Gaussian elimination with complete pivoting [196 bytes]
- (hist) Householder (reflections) method for the QR decomposition of a (real) Hessenberg matrix [197 bytes]
- (hist) Serial Jacobi (rotations) method for symmetric matrices [198 bytes]
- (hist) Unitary reductions to Hessenberg form [200 bytes]
- (hist) Householder (reflections) reduction of a matrix to bidiagonal form [201 bytes]
- (hist) The Jacobi (rotations) method for solving the symmetric eigenvalue problem [205 bytes]
- (hist) Gaussian elimination with diagonal pivoting [206 bytes]
- (hist) Unitary reductions to tridiagonal form [206 bytes]
- (hist) Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix [207 bytes]
