SparseMatrix

swMATH4629MaRDI QIDQ16799FDOQ16799

Author name not available (Why is that?)

Described by source

• The University of Florida sparse matrix collection

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

• New breakdown-free variant of AINV method for nonsymmetric positive definite matrices
• A least squares approach for saddle point problems
• Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
• Verified bounds for least squares problems and underdetermined linear systems
• On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
• Randomized extended average block Kaczmarz for solving least squares
• Preconditioners for nonsymmetric indefinite linear systems
• On the symmetric componentwise relative backward error for linear systems of equations
• Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
• On greedy randomized average block Kaczmarz method for solving large linear systems
• Robust incomplete factorization for nonsymmetric matrices
• Updating and downdating techniques for optimizing network communicability
• Fast computation of spectral projectors of banded matrices
• Weighted matrix ordering and parallel banded preconditioners for iterative linear system solvers
• Sparse matrix-vector multiplication on NVIDIA GPU
• Multiscale approach for the network compression-friendly ordering
• On greedy randomized block Kaczmarz method for consistent linear systems
• Numerical performance of preconditioning techniques for the solution of complex sparse linear systems
• Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
• The augmented block Cimmino distributed method
• A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication
• A novel partitioning method for accelerating the block Cimmino algorithm
• A tearing-based hybrid parallel banded linear system solver
• Parallel multilevel algorithms for hypergraph partitioning
• One-dimensional partitioning for heterogeneous systems: theory and practice
• Parallelization of multilevel preconditioners constructed from inverse-based ILUs on shared-memory multiprocessors
• Parallel Symbolic Factorization for Sparse LU with Static Pivoting
• A multilevel Crout ILU preconditioner with pivoting and row permutation
• Robust approximate inverse preconditioning for the conjugate gradient method
• On Monte Carlo and quasi-Monte Carlo for matrix computations
• Inexact proximal Newton methods for self-concordant functions
• Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
• Processor-efficient sparse matrix-vector multiplication
• Relaxation-based coarsening and multiscale graph organization
• Algebraic distance on graphs
• A wavelet-based algebraic multigrid preconditioner for sparse linear systems
• An efficient algorithm to construct an orthonormal basis for the extended Krylov subspace
• Variants of algebraic wavelet-based multigrid methods: Application to shifted linear systems
• The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming
• A tridiagonalization method for symmetric saddle-point systems
• Approximating spectral densities of large matrices
• Breakdown-free version of ILU factorization for nonsymmetric positive definite matrices
• A Technique for Accelerating the Convergence of Restarted GMRES
• Some observations on weighted GMRES
• Multilevel algorithms for acyclic partitioning of directed acyclic graphs
• A simple strategy for varying the restart parameter in GMRES\((m)\)
• Parallel hybrid preconditioning: incomplete factorization with selective sparse approximate inversion
• Fast enclosure for solutions in underdetermined systems
• A new preconditioner for indefinite and asymmetric matrices
• Effective preconditioning through minimum degree ordering interleaved with incomplete factorization
• A deflated conjugate gradient method for multiple right hand sides and multiple shifts
• Linear regression models, least-squares problems, normal equations, and stopping criteria for the conjugate gradient method
• Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
• A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
• Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques
• A fast convergent iterative solver for approximate inverse of matrices
• Max-plus singular values
• A block Chebyshev-Davidson method for linear response eigenvalue problems
• Towards a tighter coupling of bottom-up and top-down sparse matrix ordering methods
• Development of the Block BiCGSTAB($\ell$) method for solving linear systems with multiple right hand sides
• Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
• Block conjugate gradient algorithms for least squares problems
• Low-rank updates of balanced incomplete factorization preconditioners
• Three-precision GMRES-based iterative refinement for least squares problems
• Iterative algorithms for least-squares solutions of a quaternion matrix equation
• Sparse approximate inverse preconditioners on high performance GPU platforms
• Preconditioned GMRES solver on multiple-GPU architecture
• A parallel sparse linear system solver based on Hermitian/skew-Hermitian splitting
• Preconditioning techniques based on the Birkhoff-von Neumann decomposition
• Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
• Logarithmic barriers for sparse matrix cones
• Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
• Recovery Patterns for Iterative Methods in a Parallel Unstable Environment
• Partitioning strategies for the block Cimmino algorithm
• Randomized estimation of spectral densities of large matrices made accurate
• Algorithm 1003: Mongoose, a graph coarsening and partitioning library
• Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• Preconditioning techniques for large linear systems: A survey
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• EIA-CNDP: an exact iterative algorithm for critical node detection problem
• Inexact coordinate descent: complexity and preconditioning
• Localization in matrix computations: theory and applications
• 2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications
• A comparison of iterative methods to solve complex valued linear algebraic 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
• ViennaCL-linear algebra library for multi- and many-core architectures
• An integer programming framework for critical elements detection in graphs
• Algorithm 907
• 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
• A fast and robust mixed-precision solver for the solution of sparse symmetric linear systems
• 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
• tpSpMV: a two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures

This page was built for software: SparseMatrix