Sparse matrix test problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A new method for accelerating Arnoldi algorithms for large scale eigenproblems
- 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
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- 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
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- Spectral portrait for non-Hermitian large sparse matrices
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- New methods for adapting and for approximating inverses as preconditioners
- Computation of the fundamental singular subspace of a large matrix
- A new taxonomy of conjugate gradient methods
- 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
- Condition numbers for Lanczos bidiagonalization with complete reorthogonalization
- A practical algorithm for making filled graphs minimal
- Preconditioning eigenvalues and some comparison of solvers
- Simpler GMRES with deflated restarting
- Theoretical and numerical comparisons of GMRES and WZ-GMRES
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
- Polynomial preconditioners based on factorized sparse approximate inverses
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- 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
- Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Obtaining test problems via Internet
- 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
- A refined Arnoldi type method for large scale eigenvalue problems
- Discrete-time Lyapunov stability of large matrices
- Balancing sparse matrices for computing eigenvalues
- Solving shifted linear systems with restarted GMRES augmented with error approximations
- A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides
- Generalized approximate inverse preconditioners for least squares problems
- A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
- Out-of-core SVD performance for document indexing
- Fully automatic \(hp\)-adaptivity in three dimensions
- A new shift scheme for the harmonic Arnoldi method
- On expansion of search subspaces for large non-Hermitian eigenproblems
- Accelerated GCRO-DR method for solving sequences of systems of linear equations
- A review of linear and nonlinear Cauchy singular integral and integro-differential equations arising in mechanics
- Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems
- Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
- Balanced incomplete factorization preconditioner with pivoting
- Diagonal threshold techniques in robust multi-level ILU preconditioners for general sparse linear systems
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- Bounds for an estimate of the optimal backward error for linear least squares problems
- Nondegenerate piecewise linear systems: finite Newton algorithm and applications in machine learning
- Erasure coding for fault-oblivious linear system solvers
- The University of Florida sparse matrix collection
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Performance and numerical accuracy evaluation of heterogeneous multicore systems for Krylov orthogonal basis computation
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- Computing in operations research using Julia
- CsegGraph: a graph colouring instance generator
- Truncated envelope peconditioning technique
- A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- scientific article; zbMATH DE number 1062852 (Why is no real title available?)
- EVALUATION OF AUTOMATIC DOMAIN PARTITIONING ALGORITHMS FOR PARALLEL FINITE ELEMENT ANALYSIS
- Data-Parallel Sparse Factorization
- Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
- scientific article; zbMATH DE number 2098313 (Why is no real title available?)
- TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗
- COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Implicitly restarted refined generalised Arnoldi method with deflation for the polynomial eigenvalue problem
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Nonlocal pagerank
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- Implicitly restarted refined partially orthogonal projection method with deflation
- Approximations with Real Linear Modules
- Restarted block-GMRES with deflation of eigenvalues
- A survey of direct methods for sparse linear systems
- A projected derivative-free algorithm for nonlinear equations with convex constraints
- Accelerate weighted GMRES by augmenting error approximations
- Matrices with tunable infinity-norm condition number and no need for pivoting in LU factorization
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Application of the Cramer rule in the solution of sparse systems of linear algebraic equations
- A robust ILU with pivoting based on monitoring the growth of the inverse factors
- Accelerated Componentwise Gradient Boosting Using Efficient Data Representation and Momentum-Based Optimization
- On the block GMRES method with deflated restarting
- Spherical harmonics method applied to the multi-dimensional radiation transfer
- On a conjugate directions method for solving strictly convex QP problem
- Meta-heuristic algorithms for quasi total double Roman domination problem
- 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
- Parallel sparse Gaussian elimination with partial pivoting
- A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
This page was built for publication: Sparse matrix test problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3819903)
