Harwell-Boeing sparse matrix collection

swMATH8516MaRDI QIDQ20525FDOQ20525

Author name not available (Why is that?)

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

• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
• Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
• The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• A refined Arnoldi type method for large scale eigenvalue problems
• Title not available (Why is that?)
• Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Multistart search for the cyclic cutwidth minimization problem
• A branch and bound algorithm for the matrix bandwidth minimization
• Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning
• Alternatives for parallel Krylov subspace basis computation
• Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
• A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
• Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
• An interior point Newton-like method for non-negative least-squares problems with degenerate solution
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
• The university of Florida sparse matrix collection
• Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
• Compressed Graphs and the Minimum Degree Algorithm
• Multilevel ILU With Reorderings for Diagonal Dominance
• Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems
• BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
• A comparative study of sparse approximate inverse preconditioners
• An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
• PSelInv—A Distributed Memory Parallel Algorithm for Selected Inversion
• A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
• The influence of relaxed supernode partitions on the multifrontal method
• Super-fast validated solution of linear systems
• A Class of Spectral Two-Level Preconditioners
• Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
• On a conjugate gradient-type method for solving complex symmetric linear systems
• A new matrix bandwidth reduction algorithm
• Computing in Operations Research Using Julia
• Incomplete Cholesky Factorizations with Limited Memory
• A practical algorithm for making filled graphs minimal
• Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• An extension of the conjugate residual method to nonsymmetric linear systems
• On expansion of search subspaces for large non-Hermitian eigenproblems
• An object-oriented framework for block preconditioning
• Verification of positive definiteness
• Restarted block-GMRES with deflation of eigenvalues
• Gaussian Elimination with Partial Pivoting Can Fail in Practice
• The design of MA48
• Templates for the Solution of Algebraic Eigenvalue Problems
• On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic
• Semidefinite relaxations of ordering problems
• Theoretical and numerical comparisons of GMRES and WZ-GMRES
• Nested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioning
• Improving the Run Time and Quality of Nested Dissection Ordering
• On a binary distance model for the minimum linear arrangement problem
• A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems
• 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
• Title not available (Why is that?)
• Expokit
• NLEVP
• An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
• Algorithm 818
• A column approximate minimum degree ordering algorithm
• Algorithm 845
• MA57---a code for the solution of sparse symmetric definite and indefinite systems
• CUTEr and SifDec
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• Discrete-time Lyapunov stability of large matrices
• Accelerate weighted GMRES by augmenting error approximations
• GRASP and path relinking for the matrix bandwidth minimization.
• Detecting localization in an invariant subspace
• A Comparative Study of Iterative Solvers Exploiting Spectral Information for SPD Systems
• Elimination Structures for Unsymmetric Sparse $LU$ Factors
• Block GMRES Method with Inexact Breakdowns and Deflated Restarting
• Implicitly restarted global FOM and GMRES for nonsymmetric matrix equations and Sylvester equations
• An augmented LSQR method
• Analysis and comparison of two general sparse solvers for distributed memory computers
• A new shift scheme for the harmonic Arnoldi method
• A robust ILU with pivoting based on monitoring the growth of the inverse factors
• Sparse system solution and the HSL library
• Robust preconditioning of large, sparse, symmetric eigenvalue problems
• On convergence of the inexact Rayleigh quotient iteration with the Lanczos method used for solving linear systems
• The subspace projected approximate matrix (SPAM) modification of the Davidson method
• Thick-restart Lanczos method for large symmetric eigenvalue problems
• A frontal code for the solution of sparse positive-definite symmetric systems arising from finite-element applications
• Approximate inverse computation using Frobenius inner product
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Fully automatic \(hp\)-adaptivity in three dimensions
• Solving Sparse Linear Systems with Sparse Backward Error
• A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
• A parallel Lanczos method for symmetric generalized eigenvalue problems
• 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

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