Cited in
(only showing first 100 items - show all)- Improving the numerical stability and the performance of a parallel sparse solver
- A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
- A parallel Lanczos method for symmetric generalized eigenvalue problems
- Verified bounds for singular values, in particular for the spectral norm of a matrix and its inverse
- Computing the combinatorial canonical form of a layered mixed matrix
- scientific article; zbMATH DE number 1373525 (Why is no real title available?)
- The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices
- Polynomial preconditioners based on factorized sparse approximate inverses
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides
- A refined Arnoldi type method for large scale eigenvalue problems
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Limiting Communication in Parallel Sparse Cholesky Factorization
- On a conjugate directions method for solving strictly convex QP problem
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- scientific article; zbMATH DE number 828046 (Why is no real title available?)
- Nested splitting conjugate gradient method for matrix equation \(AXB=C\) and preconditioning
- scientific article; zbMATH DE number 733664 (Why is no real title available?)
- Multistart search for the cyclic cutwidth minimization problem
- A branch and bound algorithm for the matrix bandwidth minimization
- Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems
- Reducing the bandwidth of a sparse matrix with tabu search.
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- Undulant-block elimination and integer-preserving matrix inversion
- A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
- Alternatives for parallel Krylov subspace basis computation
- Deflated block Krylov subspace methods for large scale eigenvalue problems
- Dynamic Thick Restarting of the Davidson, and the Implicitly Restarted Arnoldi Methods
- A Padé-based factorization-free algorithm for identifying the eigenvalues missed by a generalized symmetric eigensolver
- A refined harmonic Lanczos bidiagonalization method and an implicitly restarted algorithm for computing the smallest singular triplets of large matrices
- scientific article; zbMATH DE number 1302610 (Why is no real title available?)
- Computation of the fundamental singular subspace of a large matrix
- Condition numbers for Lanczos bidiagonalization with complete reorthogonalization
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- An interior point Newton-like method for non-negative least-squares problems with degenerate solution
- A Note on Nested Dissection for Rectangular Grids
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- scientific article; zbMATH DE number 1113873 (Why is no real title available?)
- A general variable neighborhood search for the cyclic antibandwidth problem
- Block GMRES method with inexact breakdowns and deflated restarting
- Two improved algorithms for envelope and wavefront reduction
- Flexible GMRES with deflated restarting
- Arnoldi-Faber method for large non Hermitian eigenvalue problems
- A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization
- The automatic generation of sparse primitives
- Thick restarting the weighted harmonic Arnoldi algorithm for large interior eigenproblems
- BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
- Dynamic data distribution and processor repartitioning for irregularly structured computations
- Erasure coding for fault-oblivious linear system solvers
- Compressed Graphs and the Minimum Degree Algorithm
- On Adaptive Sketch-and-Project for Solving Linear Systems
- A comparative study of sparse approximate inverse preconditioners
- Multilevel ILU With Reorderings for Diagonal Dominance
- Integration of \(hp\)-adaptivity and a two-grid solver for elliptic problems
- TRAX: an approach for the time rational analysis of complex dynamic systems
- Computing pseudospectra using block implicitly restarted Arnoldi iteration
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- A new approach to compute sparse approximate inverse factors of a matrix
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices
- Multiway Monte Carlo method for linear systems
- Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
- Implicitly restarted refined partially orthogonal projection method with deflation
- A $QL$ Procedure for Computing the Eigenvalues of Complex Symmetric Tridiagonal Matrices
- Super-fast validated solution of linear systems
- A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables
- A parallel preconditioned conjugate gradient package for solving sparse linear systems on a Cray Y-MP
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- On a conjugate gradient-type method for solving complex symmetric linear systems
- The influence of relaxed supernode partitions on the multifrontal method
- Exploiting Structural Symmetry in a Sparse Partial Pivoting Code
- A Class of Spectral Two-Level Preconditioners
- Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
- A new matrix bandwidth reduction algorithm
- 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
- Conjugate gradient and minimal residual method for solving symmetric indefinite systems
- Highly nonnormal eigenproblems in the aeronautical industry
- Out-of-core SVD performance for document indexing
- Generalized approximate inverse preconditioners for least squares problems
- Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
- An invert-free Arnoldi method for computing interior eigenpairs of large matrices
- Simpler GMRES with deflated restarting
- Incomplete Cholesky Factorizations with Limited Memory
- A practical algorithm for making filled graphs minimal
- scientific article; zbMATH DE number 1330398 (Why is no real title available?)
- An extension of the conjugate residual method to nonsymmetric linear systems
- Preconditioning eigenvalues and some comparison of solvers
- Residual algorithm for large-scale positive definite generalized eigenvalue problems
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- Computing the field of values and pseudospectra using the Lanczos method with continuation
- Restarted block-GMRES with deflation of eigenvalues
- On expansion of search subspaces for large non-Hermitian eigenproblems
- A general iterative sparse linear solver and its parallelization for interval Newton methods
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- Verification of positive definiteness
- A breakdown-free block conjugate gradient method
- Improving parallel ordering of sparse matrices using genetic algorithms
- An object-oriented framework for block preconditioning
This page was built for software: Harwell-Boeing sparse matrix collection
