Harwell-Boeing sparse matrix collection

swMATH8516MaRDI QIDQ20525

No author found.

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 ⋮ A breakdown-free block conjugate gradient method ⋮ BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems ⋮ 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 ⋮ Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning ⋮ An implicitly restarted block Lanczos bidiagonalization method using Leja shifts ⋮ New methods for adapting and for approximating inverses as preconditioners ⋮ Highly nonnormal eigenproblems in the aeronautical industry ⋮ 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 ⋮ Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices ⋮ A new taxonomy of conjugate gradient methods ⋮ A general iterative sparse linear solver and its parallelization for interval Newton methods ⋮ A new shift scheme for the harmonic Arnoldi method ⋮ Improving the numerical stability and the performance of a parallel sparse solver ⋮ Sparse linear least squares problems in optimization ⋮ Super-fast validated solution of linear systems ⋮ 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 ⋮ 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 ⋮ Semidefinite relaxations of ordering problems ⋮ 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 ⋮ An augmented LSQR method ⋮ A linear system solver based on a modified Krylov subspace method for breakdown recovery ⋮ On the augmented system approach to sparse least-squares problems ⋮ Arnoldi-Faber method for large non Hermitian eigenvalue problems ⋮ 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 ⋮ Blankets joint posterior score for learning Markov network structures ⋮ Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning ⋮ A refined Arnoldi type method for large scale eigenvalue problems ⋮ Condition numbers for Lanczos bidiagonalization with complete reorthogonalization ⋮ Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse ⋮ Solving shifted linear systems with restarted GMRES augmented with error approximations ⋮ Modified ST algorithms and numerical experiments ⋮ GRASP and path relinking for the matrix bandwidth minimization. ⋮ On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems ⋮ The solution of large-scale least-squares problems on supercomputers ⋮ A parallel Lanczos method for symmetric generalized eigenvalue problems ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ On the block GMRES method with deflated restarting ⋮ Computing pseudospectra using block implicitly restarted Arnoldi iteration ⋮ On expansion of search subspaces for large non-Hermitian eigenproblems ⋮ Accelerated GCRO-DR method for solving sequences of systems of linear equations ⋮ Discrete-time Lyapunov stability of large matrices ⋮ 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 ⋮ A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations ⋮ Augmented block Householder Arnoldi method ⋮ On a conjugate directions method for solving strictly convex QP problem ⋮ Partitioning strategies for the block Cimmino algorithm ⋮ 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 ⋮ Theoretical and numerical comparisons of GMRES and WZ-GMRES ⋮ Residual algorithm for large-scale positive definite generalized eigenvalue problems ⋮ Restarted block-GMRES with deflation of eigenvalues ⋮ Generalized approximate inverse preconditioners for least squares problems ⋮ A tearing-based hybrid parallel sparse linear system solver ⋮ Multistart search for the cyclic cutwidth minimization 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 ⋮ An extension of the conjugate residual method to nonsymmetric linear systems ⋮ 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 ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ Undulant-block elimination and integer-preserving matrix inversion ⋮ 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 ⋮ 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 ⋮ Modified Krylov acceleration for parallel environments ⋮ A comparative study of sparse approximate inverse preconditioners ⋮ A review of frontal methods for solving linear systems ⋮ On a conjugate gradient-type method for solving complex symmetric linear systems ⋮ A practical algorithm for making filled graphs minimal ⋮ Preconditioning eigenvalues and some comparison of solvers ⋮ A new matrix bandwidth reduction algorithm ⋮ 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 ⋮ Sparse matrix vector multiplication techniques on the IBM 3090 VF ⋮ A general variable neighborhood search for the cyclic antibandwidth problem ⋮ A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm ⋮ Wavelet based preconditioners for sparse linear systems

This page was built for software: Harwell-Boeing sparse matrix collection