SparseMatrix - MaRDI portal

Cited in

(only showing first 100 items - show all)

Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
On the symmetric componentwise relative backward error for linear systems of equations
Solving the Distance-Based Critical Node Problem
On greedy randomized average block Kaczmarz method for solving large linear systems
Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
Self-corrective iterations (SCI) for generalized diagonally dominant matrices
ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
Iterative ILU preconditioners for linear systems and eigenproblems
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
Parallel Schur complement techniques based on multiprojection methods
Distributed algebraic tearing and interconnecting techniques
On the maximum small-world subgraph problem
Mixed precision algorithms in numerical linear algebra
Robust incomplete factorization for nonsymmetric matrices
On positive semidefinite modification schemes for incomplete Cholesky factorization
Iterative methods and preconditioning for large and sparse linear systems with applications
A Note on Inexact Inner Products in GMRES
Minimization principles and computation for the generalized linear response eigenvalue problem
Sharp 2-norm error bounds for LSQR and the conjugate gradient method
Accelerating block coordinate descent methods with identification strategies
Krylov subspace recycling for sequences of shifted linear systems
Matrix-free preconditioning using partial matrix estimation
Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
Graph models and their efficient implementation for sparse Jacobian matrix determination
A new projected variant of the deflated block conjugate gradient method
ViennaCL-linear algebra library for multi- and many-core architectures
Efficient (partial) determination of derivative matrices via automatic differentiation
A block bidiagonalization method for fixed-accuracy low-rank matrix approximation
GMRES convergence bounds that depend on the right-hand-side vector
Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
A high-order numerical method for the Helmholtz equation with nonstandard boundary conditions
A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems
New parallel sparse direct solvers for multicore architectures
Parallel hybrid sparse linear system solvers
An integer programming framework for critical elements detection in graphs
Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
Updating and downdating techniques for optimizing network communicability
Unsymmetric Ordering Using A Constrained Markowitz Scheme
Fortification Against Cascade Propagation Under Uncertainty
Optimal detection of critical nodes: improvements to model structure and performance
Inflationary dynamics for matrix eigenvalue problems
Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
On a fast deterministic block Kaczmarz method for solving large-scale linear systems
Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
A class of preconditioners based on matrix splitting for nonsymmetric linear systems
Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
COAST: A Convex Optimization Approach to Stress-Based Embedding
Discrete trace theorems and energy minimizing spring embeddings of planar graphs
\texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics
QuickMatch
Fast computation of spectral projectors of banded matrices
On Improving Linear Solver Performance: A Block Variant of GMRES
Algorithm 907
Imalytics Preclinical
BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
Sparse matrix-vector multiplication on the single-chip cloud computer many-core processor
New block quadrature rules for the approximation of matrix functions
A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
Using Polynomial Chaos to Compute the Influence of Multiple Random Surfers in the PageRank Model
A fast block coordinate descent method for solving linear least-squares problems
Multiscale approach for the network compression-friendly ordering
Relaxation-based coarsening for multilevel hypergraph partitioning
Level-based heuristics and hill climbing for the antibandwidth maximization problem
Numerical recovery strategies for parallel resilient Krylov linear solvers.
Erasure coding for fault-oblivious linear system solvers
A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
On Adaptive Sketch-and-Project for Solving Linear Systems
SOR-like iteration method for solving absolute value equations
A comparative study of sparse approximate inverse preconditioners
An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
Weighted matrix ordering and parallel banded preconditioners for iterative linear system solvers
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
Multilevel ILU With Reorderings for Diagonal Dominance
Multilevel Preconditioners Constructed From Inverse-Based ILUs
Spectral coarse grained controllability of complex networks
Off-diagonal low-rank preconditioner for difficult PageRank problems
A Cholesky out-of-core factorization
A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
Interpolation-restart strategies for resilient eigensolvers
tpSpMV: a two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures
On the stability of network indices defined by means of matrix functions
A domain-decomposing parallel sparse linear system solver
Fine-grained multithreading for the multifrontal \(QR\) factorization of sparse matrices
A variant of the IDR\((s)\) method with the quasi-minimal residual strategy
PageRank beyond the web
Threshold incomplete factorization constraint preconditioners for saddle-point matrices
Approximating spectral sums of large-scale matrices using stochastic Chebyshev approximations
Sparse matrix-vector multiplication on NVIDIA GPU
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
The ILUCP Preconditioner
LQ-Schur projection on large sparse matrix equations
A new deflated block GCROT(\(m,k\)) method for the solution of linear systems with multiple right-hand sides
Randomized extended Kaczmarz for solving least squares
Complete pivoting strategy for the left-looking robust incomplete factorization preconditioner

This page was built for software: SparseMatrix