SparseMatrix - MaRDI portal

Cited in

(only showing first 100 items - show all)

On short recurrence Krylov type methods for linear systems with many right-hand sides
Stagnation of block GMRES and its relationship to block FOM
A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
Two-stage spectral preconditioners for iterative eigensolvers.
Preconditioning highly indefinite and nonsymmetric matrices
Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation
Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
Beyond automated multilevel substructuring: domain decomposition with rational filtering
Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
Hierarchical orthogonal factorization: sparse least squares problems
Parallelization of the rational Arnoldi algorithm
The joint bidiagonalization process with partial reorthogonalization
An optimal-storage approach to semidefinite programming using approximate complementarity
A hierarchical low rank Schur complement preconditioner for indefinite linear systems
An implicit wavelet sparse approximate inverse preconditioner using block finger pattern
Estimating Computational Noise
Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory
Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
Algorithms for the computation of the matrix logarithm based on the double exponential formula
The e-MoM approach for approximating matrix functionals
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
A grid-based multilevel incomplete LU factorization preconditioning technique for general sparse matrices
Polynomial preconditioners based on factorized sparse approximate inverses
Lower bounds for the bandwidth problem
Generalizing geometric graphs
scientific article; zbMATH DE number 2065130 (Why is no real title available?)
On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems
Probabilistic bounds for the matrix condition number with extended Lanczos bidiagonalization
Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting
A least squares approach for saddle point problems
Algorithm 971
A generic framework for approximation analysis of greedy algorithms for star bicoloring
Extrapolating the Arnoldi algorithm to improve eigenvector convergence
Algorithm 1003: Mongoose, a graph coarsening and partitioning library
Preconditioning techniques for large linear systems: A survey
Large-Scale Scientific Computing
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
A fast recursive orthogonalization scheme for the Macaulay matrix
A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
Chebyshev acceleration of iterative refinement
IDR(s) for solving shifted nonsymmetric linear systems
A numerical evaluation of preprocessing and ILU-type preconditioners for the solution of unsymmetric sparse linear systems using iterative methods
Chordal decomposition in operator-splitting methods for sparse semidefinite programs
Verified bounds for least squares problems and underdetermined linear systems
On a conjugate directions method for solving strictly convex QP problem
Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
Decomposition methods for sparse matrix nearness problems
EIA-CNDP: an exact iterative algorithm for critical node detection problem
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
NESSIE
Enclosing Moore-Penrose inverses
Improving the convergence behaviour of BiCGSTAB by applying <i>D</i>-norm minimization
Inexact coordinate descent: complexity and preconditioning
A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units
A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
Hierarchical clustering with deep q-learning
Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems
Adaptive techniques for improving the performance of incomplete factorization preconditioning
On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems
Detecting critical node structures on graphs: a mathematical programming approach
A block IDR$(s)$ method for nonsymmetric linear systems with multiple right-hand sides
Randomized extended average block Kaczmarz for solving least squares
Parallel multiprojection preconditioned methods based on subspace compression
An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method
On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
A geometric probability randomized Kaczmarz method for large scale linear systems
Localized Fourier analysis for graph signal processing
An Efficient Variant of the GMRES(m) Method Based on the Error Equations
A robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
An efficient analyse phase for element problems.
Anymatrix: an extensible MATLAB matrix collection
Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
A weighted randomized sparse Kaczmarz method for solving linear systems
A comparison of iterative methods to solve complex valued linear algebraic systems
Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
Localization in matrix computations: theory and applications
2-norm error bounds and estimates for Lanczos approximations to linear systems and rational matrix functions
Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods
High-performance computation of the exponential of a large sparse matrix
MFIX-Exa
Preconditioners for nonsymmetric indefinite linear systems
Accelerating the explicitly restarted Arnoldi method with GPUs using an autotuned matrix vector product
Optimizing sparse matrix-matrix multiplication for the GPU
Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method
A reduced-order discontinuous Galerkin method based on a Krylov subspace technique in nanophotonics
2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications
GMRES using pseudoinverse for range symmetric singular systems
Multi-level direct $K$-way hypergraph partitioning with multiple constraints and fixed vertices

This page was built for software: SparseMatrix