The following pages link to Sparse matrix test problems (Q3819903):
Displaying 50 items.
- Restarted block-GMRES with deflation of eigenvalues (Q557941) (← links)
- On the block GMRES method with deflated restarting (Q654694) (← links)
- On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
- An approach based on dwindling filter method for positive definite generalized eigenvalue problem (Q725751) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- Parallel sparse Gaussian elimination with partial pivoting (Q753685) (← links)
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm (Q814247) (← links)
- The solution of large-scale least-squares problems on supercomputers (Q918420) (← links)
- Deflated block Krylov subspace methods for large scale eigenvalue problems (Q966072) (← links)
- A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems (Q966098) (← links)
- Residual algorithm for large-scale positive definite generalized eigenvalue problems (Q975355) (← links)
- A new method for accelerating Arnoldi algorithms for large scale eigenproblems (Q1037802) (← links)
- On the augmented system approach to sparse least-squares problems (Q1124275) (← links)
- Selection of fictitious independent variables for the solution of sparse linear equations (Q1178988) (← links)
- QMR: A quasi-minimal residual method for non-Hermitian linear systems (Q1180764) (← links)
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP (Q1181505) (← links)
- Estimating the largest singular values of large sparse matrices via modified moments (Q1186625) (← links)
- Data structures to vectorize CG algorithms for general sparsity patterns (Q1262077) (← links)
- Numerical experiments with two approximate inverse preconditioners (Q1267015) (← links)
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811) (← links)
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices (Q1326400) (← links)
- Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems (Q1326401) (← links)
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems (Q1334205) (← links)
- Spectral portrait for non-Hermitian large sparse matrices (Q1340876) (← links)
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver (Q1343678) (← links)
- New methods for adapting and for approximating inverses as preconditioners (Q1349143) (← links)
- Computation of the fundamental singular subspace of a large matrix (Q1355206) (← links)
- A new taxonomy of conjugate gradient methods (Q1361262) (← links)
- Matrix enlarging methods and their application (Q1371659) (← links)
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks (Q1371662) (← links)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
- Condition numbers for Lanczos bidiagonalization with complete reorthogonalization (Q1406300) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Preconditioning eigenvalues and some comparison of solvers (Q1591177) (← links)
- Simpler GMRES with deflated restarting (Q1761667) (← links)
- Theoretical and numerical comparisons of GMRES and WZ-GMRES (Q1767852) (← links)
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems (Q1827036) (← links)
- Polynomial preconditioners based on factorized sparse approximate inverses (Q1855875) (← links)
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices (Q1862016) (← links)
- A general iterative sparse linear solver and its parallelization for interval Newton methods (Q1904308) (← links)
- Improving the numerical stability and the performance of a parallel sparse solver (Q1905913) (← links)
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems (Q1908927) (← links)
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems (Q1916981) (← links)
- Robust preconditioning of large, sparse, symmetric eigenvalue problems (Q1917916) (← links)
- A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides (Q1919396) (← links)
- A linear system solver based on a modified Krylov subspace method for breakdown recovery (Q1921331) (← links)
- A refined Arnoldi type method for large scale eigenvalue problems (Q1943090) (← links)
- Discrete-time Lyapunov stability of large matrices (Q1971848) (← links)
- Balancing sparse matrices for computing eigenvalues (Q1976919) (← links)
- Solving shifted linear systems with restarted GMRES augmented with error approximations (Q2203248) (← links)
