Harwell-Boeing sparse matrix collection
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An extension of the conjugate residual method to nonsymmetric linear systems
- A new method for accelerating Arnoldi algorithms for large scale eigenproblems
- A compile/Run-time environment for the automatic transformation of linked list data structures
- A convergence analysis of the inexact Rayleigh quotient iteration and simplified Jacobi-Davidson method for the large Hermitian matrix eigenproblem
- On the augmented system approach to sparse least-squares problems
- 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
- Estimating the largest singular values of large sparse matrices via modified moments
- Data structures to vectorize CG algorithms for general sparsity patterns
- Numerical experiments with two approximate inverse preconditioners
- Dynamic data distribution and processor repartitioning for irregularly structured computations
- Bi-CG
- CsegGraph
- Modified Krylov acceleration for parallel environments
- A comparative study of sparse approximate inverse preconditioners
- A review of frontal methods for solving linear systems
- EIGIFP
- On a conjugate gradient-type method for solving complex symmetric linear systems
- A new matrix bandwidth reduction algorithm
- HP90
- irbleigs
- 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
- MA48
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- NSPCG
- Spectral portrait for non-Hermitian large sparse matrices
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- PINEAPL
- New methods for adapting and for approximating inverses as preconditioners
- Matrix Depot
- anymatrix
- Computation of the fundamental singular subspace of a large matrix
- A new taxonomy of conjugate gradient methods
- Sparse linear least squares problems in optimization
- Matrix enlarging methods and their application
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks
- Two improved algorithms for envelope and wavefront reduction
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
- Conjugate gradient and minimal residual method for solving symmetric indefinite systems
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- SRRIT
- PREQN
- Condition numbers for Lanczos bidiagonalization with complete reorthogonalization
- Modified ST algorithms and numerical experiments
- GRASP and path relinking for the matrix bandwidth minimization.
- P-SPARSLIB
- DQGMRES
- LINSOL
- BLAS
- A practical algorithm for making filled graphs minimal
- Preconditioning eigenvalues and some comparison of solvers
- HPCC
- eigs
- MatrixMarket
- BiCGstab
- AztecOO
- ITSOL
- NLEVP
- MESHPART
- SparseMatrix
- Blankets joint posterior score for learning Markov network structures
- svdpack
- COCA
- Simpler GMRES with deflated restarting
- Theoretical and numerical comparisons of GMRES and WZ-GMRES
- Undulant-block elimination and integer-preserving matrix inversion
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- Polynomial preconditioners based on factorized sparse approximate inverses
- BiCOR
- CORS
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Highly nonnormal eigenproblems in the aeronautical industry
- A general iterative sparse linear solver and its parallelization for interval Newton methods
- 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
- GpBiCg
- Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
- 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
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- A curve tracing algorithm for computing the pseudospectrum
- Arnoldi-Riccati method for large eigenvalue problems
- ILUS
- BlockSolve95
- A refined Arnoldi type method for large scale eigenvalue problems
- NAGWare
- A parallel Lanczos method for symmetric generalized eigenvalue problems
- SPARSKIT
- Discrete-time Lyapunov stability of large matrices
- Balancing sparse matrices for computing eigenvalues
- CHEBYCODE
- CGS
- Multistart search for the cyclic cutwidth minimization problem
- symrcm
- IRAM
- A general variable neighborhood search for the cyclic antibandwidth problem
- Sparsak
This page was built for software: Harwell-Boeing sparse matrix collection
