Harwell-Boeing sparse matrix collection

swMATH8516MaRDI QIDQ20525FDOQ20525

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides
• Limiting Communication in Parallel Sparse Cholesky Factorization
• Title not available (Why is that?)
• On a conjugate directions method for solving strictly convex QP problem
• Reducing the bandwidth of a sparse matrix with tabu search.
• Deflated block Krylov subspace methods for large scale eigenvalue problems
• Computation of the fundamental singular subspace of a large matrix
• Title not available (Why is that?)
• Two improved algorithms for envelope and wavefront reduction
• Arnoldi-Faber method for large non Hermitian eigenvalue problems
• Dynamic data distribution and processor repartitioning for irregularly structured computations
• Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
• A new approach to compute sparse approximate inverse factors of a matrix
• Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices
• A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
• A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
• Conjugate gradient and minimal residual method for solving symmetric indefinite systems
• 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
• Generalized approximate inverse preconditioners for least squares problems
• Preconditioning eigenvalues and some comparison of solvers
• Residual algorithm for large-scale positive definite generalized eigenvalue problems
• Computing the field of values and pseudospectra using the Lanczos method with continuation
• Solving shifted linear systems with restarted GMRES augmented with error approximations
• Modified Krylov acceleration for parallel environments
• A review of frontal methods for solving linear systems
• New methods for adapting and for approximating inverses as preconditioners
• Title not available (Why is that?)
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• A tearing-based hybrid parallel sparse linear system solver
• Spectral portrait for non-Hermitian large sparse matrices
• The solution of large-scale least-squares problems on supercomputers
• Parallel sparse Gaussian elimination with partial pivoting
• A new method for accelerating Arnoldi algorithms for large scale eigenproblems
• Augmented block Householder Arnoldi method
• A new taxonomy of conjugate gradient methods
• A curve tracing algorithm for computing the pseudospectrum
• A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
• Selection of fictitious independent variables for the solution of sparse linear equations
• Data structures to vectorize CG algorithms for general sparsity patterns
• 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
• Conjugate-gradient subroutines for the IBM 3090 Vector Facility
• A compile/Run-time environment for the automatic transformation of linked list data structures
• An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
• Estimating the largest singular values of large sparse matrices via modified moments
• Arnoldi-Riccati method for large eigenvalue problems
• An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems
• Numerical experiments with two approximate inverse preconditioners
• A linear system solver based on a modified Krylov subspace method for breakdown recovery
• On the block GMRES method with deflated restarting
• A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems
• An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
• Sparse matrix vector multiplication techniques on the IBM 3090 VF
• A modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigen\-problems
• Modified ST algorithms and numerical experiments
• Sparse matrix test problems
• A parallel algorithm to approximate inverse factors of a matrix via sparse-sparse iterations
• A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm
• Wavelet based preconditioners for sparse linear systems
• Balancing sparse matrices for computing eigenvalues
• A New Algorithm for Finding a Pseudoperipheral Node in a Graph
• Partitioning strategies for the block Cimmino algorithm
• Polynomial preconditioners based on factorized sparse approximate inverses
• A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
• Undulant-block elimination and integer-preserving matrix inversion
• A Padé-based factorization-free algorithm for identifying the eigenvalues missed by a generalized symmetric eigensolver
• Title not available (Why is that?)
• A Note on Nested Dissection for Rectangular Grids
• Condition numbers for Lanczos bidiagonalization with complete reorthogonalization
• Flexible GMRES with deflated restarting
• A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
• A general variable neighborhood search for the cyclic antibandwidth problem
• The automatic generation of sparse primitives
• On Adaptive Sketch-and-Project for Solving Linear Systems
• Erasure coding for fault-oblivious linear system solvers
• TRAX: an approach for the time rational analysis of complex dynamic systems
• Computing pseudospectra using block implicitly restarted Arnoldi iteration
• Multiway Monte Carlo method for linear systems
• Implicitly restarted refined partially orthogonal projection method with deflation
• Exploiting Structural Symmetry in a Sparse Partial Pivoting Code
• Highly nonnormal eigenproblems in the aeronautical industry
• An invert-free Arnoldi method for computing interior eigenpairs of large matrices
• Out-of-core SVD performance for document indexing
• Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
• Title not available (Why is that?)
• Simpler GMRES with deflated restarting
• A general iterative sparse linear solver and its parallelization for interval Newton methods
• Improving parallel ordering of sparse matrices using genetic algorithms
• A breakdown-free block conjugate gradient method
• Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
• Matrices with tunable infinity-norm condition number and no need for pivoting in LU factorization
• Design of an iterative solution module for a parallel sparse matrix library (P\_SPARSLIB)
• Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation
• Accelerated GCRO-DR method for solving sequences of systems of linear equations
• Linear ordering based MIP formulations for the vertex separation or pathwidth problem
• A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
• Nonlocal pagerank
• Title not available (Why is that?)

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