Sparse matrix test problems

DOI10.1145/62038.62043zbMath0667.65040OpenAlexW2147542748MaRDI QIDQ3819903

John Lewis, Roger. G. Grimes, Iain S. Duff

Publication date: 1989

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1989-15/

zbMATH Keywords

performancelinear systemseigenvaluemathematical softwareleast squaresmeasurementlarge-scale computationcounter-examplessparse and very large systemsHarwell-Boeing sparse matrix collectionstandard test matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (only showing first 100 items - show all)

A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices ⋮ Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems ⋮ Bounds for an estimate of the optimal backward error for linear least squares problems ⋮ A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems ⋮ Spectral portrait for non-Hermitian large sparse matrices ⋮ A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems ⋮ A locally optimized reordering algorithm and its application to a parallel sparse linear system solver ⋮ EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS ⋮ An invert-free Arnoldi method for computing interior eigenpairs of large matrices ⋮ New methods for adapting and for approximating inverses as preconditioners ⋮ Out-of-core SVD performance for document indexing ⋮ Computation of the fundamental singular subspace of a large matrix ⋮ Fully automatic \(hp\)-adaptivity in three dimensions ⋮ A new taxonomy of conjugate gradient methods ⋮ A general iterative sparse linear solver and its parallelization for interval Newton methods ⋮ Computing in Operations Research Using Julia ⋮ Nondegenerate Piecewise Linear Systems: A Finite Newton Algorithm and Applications in Machine Learning ⋮ A new shift scheme for the harmonic Arnoldi method ⋮ Truncated envelope peconditioning technique ⋮ TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗ ⋮ COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ ⋮ Improving the numerical stability and the performance of a parallel sparse solver ⋮ An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems ⋮ Matrix enlarging methods and their application ⋮ Solving sparse linear least-squares problems on some supercomputers by using large dense blocks ⋮ Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems ⋮ Harmonic projection methods for large non-symmetric eigenvalue problems ⋮ Robust preconditioning of large, sparse, symmetric eigenvalue problems ⋮ A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides ⋮ A linear system solver based on a modified Krylov subspace method for breakdown recovery ⋮ On the augmented system approach to sparse least-squares problems ⋮ Unnamed Item ⋮ A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ Balanced incomplete factorization preconditioner with pivoting ⋮ A refined Arnoldi type method for large scale eigenvalue problems ⋮ Condition numbers for Lanczos bidiagonalization with complete reorthogonalization ⋮ Erasure Coding for Fault-Oblivious Linear System Solvers ⋮ A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization ⋮ Solving shifted linear systems with restarted GMRES augmented with error approximations ⋮ Implicitly Restarted Refined Partially Orthogonal Projection Method with Deflation ⋮ The solution of large-scale least-squares problems on supercomputers ⋮ On the block GMRES method with deflated restarting ⋮ On expansion of search subspaces for large non-Hermitian eigenproblems ⋮ On restarting the Arnoldi method for large nonsymmetric eigenvalue problems ⋮ Accelerated GCRO-DR method for solving sequences of systems of linear equations ⋮ Discrete-time Lyapunov stability of large matrices ⋮ Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems ⋮ Selection of fictitious independent variables for the solution of sparse linear equations ⋮ QMR: A quasi-minimal residual method for non-Hermitian linear systems ⋮ A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP ⋮ Balancing sparse matrices for computing eigenvalues ⋮ Estimating the largest singular values of large sparse matrices via modified moments ⋮ Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems ⋮ On a conjugate directions method for solving strictly convex QP problem ⋮ A review of linear and nonlinear Cauchy singular integral and integro-differential equations arising in mechanics ⋮ Data-Parallel Sparse Factorization ⋮ A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides ⋮ Deflated block Krylov subspace methods for large scale eigenvalue problems ⋮ A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems ⋮ Simpler GMRES with deflated restarting ⋮ A survey of direct methods for sparse linear systems ⋮ Unnamed Item ⋮ Theoretical and numerical comparisons of GMRES and WZ-GMRES ⋮ Residual algorithm for large-scale positive definite generalized eigenvalue problems ⋮ A projected derivative-free algorithm for nonlinear equations with convex constraints ⋮ Restarted block-GMRES with deflation of eigenvalues ⋮ Accelerate weighted GMRES by augmenting error approximations ⋮ Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems ⋮ Generalized approximate inverse preconditioners for least squares problems ⋮ Application of the Cramer rule in the solution of sparse systems of linear algebraic equations ⋮ A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables ⋮ Linear ordering based MIP formulations for the vertex separation or pathwidth problem ⋮ A robust ILU with pivoting based on monitoring the growth of the inverse factors ⋮ An approach based on dwindling filter method for positive definite generalized eigenvalue problem ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ Approximations with Real Linear Modules ⋮ Performance and Numerical Accuracy Evaluation of Heterogeneous Multicore Systems for Krylov Orthogonal Basis Computation ⋮ Data structures to vectorize CG algorithms for general sparsity patterns ⋮ DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices ⋮ Numerical experiments with two approximate inverse preconditioners ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ CsegGraph: a graph colouring instance generator ⋮ Implicitly Restarted Refined Generalised Arnoldi Method with Deflation for the Polynomial Eigenvalue Problem ⋮ An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems ⋮ A new method for accelerating Arnoldi algorithms for large scale eigenproblems ⋮ On Adaptive Sketch-and-Project for Solving Linear Systems ⋮ Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations ⋮ Nonlocal pagerank ⋮ A practical algorithm for making filled graphs minimal ⋮ Preconditioning eigenvalues and some comparison of solvers ⋮ Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization ⋮ Unnamed Item ⋮ Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems ⋮ Polynomial preconditioners based on factorized sparse approximate inverses ⋮ Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms ⋮ The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices ⋮ A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems ⋮ A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm ⋮ Accelerated Componentwise Gradient Boosting Using Efficient Data Representation and Momentum-Based Optimization

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Sparse matrix test problems