The University of Florida sparse matrix collection
From MaRDI portal
Publication:2989137
DOI10.1145/2049662.2049663zbMATH Open1365.65123OpenAlexW2035080386WikidataQ113310429 ScholiaQ113310429MaRDI QIDQ2989137FDOQ2989137
Authors: Timothy A. Davis, Yifan Hu 
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2049662.2049663
Recommendations
Cited In (only showing first 100 items - show all)
- Algorithms for the computation of the matrix logarithm based on the double exponential formula
- Detecting critical node structures on graphs: a mathematical programming approach
- An Efficient Variant of the GMRES(m) Method Based on the Error Equations
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- 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
- A geometric probability randomized Kaczmarz method for large scale linear systems
- A reduced-order discontinuous Galerkin method based on a Krylov subspace technique in nanophotonics
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- Accelerating block coordinate descent methods with identification strategies
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Optimal detection of critical nodes: improvements to model structure and performance
- Accelerating algebraic multigrid solvers on NVIDIA GPUs
- Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations
- Level-based heuristics and hill climbing for the antibandwidth maximization problem
- On the stability of network indices defined by means of matrix functions
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- Jagged non-zero submatrix data structure
- A generalization of the optimal diagonal approximate inverse preconditioner
- Block conjugate gradient type methods for the approximation of bilinear form \(C^HA^{-1}B\)
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems
- Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
- A truncated Taylor series algorithm for computing the action of trigonometric and hyperbolic matrix functions
- On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
- Efficient preconditioner updates for unsymmetric shifted linear systems
- A new randomized Gauss-Seidel method for solving linear least-squares problems
- A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems
- Incomplete LU preconditioner based on max-plus approximation of LU factorization
- A sparse completely positive relaxation of the modularity maximization for community detection
- The inexact Euler-extrapolated block preconditioners for a class of complex linear systems
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- A block Krylov method to compute the action of the Fréchet derivative of a matrix function on a vector with applications to condition number estimation
- A robust iterative scheme for symmetric indefinite systems
- The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study
- Low complexity matrix projections preserving actions on vectors
- On restarted and deflated block FOM and GMRES methods for sequences of shifted linear systems
- A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers
- A survey of Shanks' extrapolation methods and their applications
- A parallel multithreaded sparse triangular linear system solver
- On maximum residual block and two-step Gauss-Seidel algorithms for linear least-squares problems
- Randomized double and triple Kaczmarz for solving extended normal equations
- Spectral residual method for nonlinear equations on Riemannian manifolds
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
- Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations.
- Hybrid iterative refined method for computing a few extreme eigenpairs of a symmetric matrix
- A greedy block Kaczmarz algorithm for solving large-scale linear systems
- Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms
- Efficient CSR-based sparse matrix-vector multiplication on GPU
- A novel CSR-based sparse matrix-vector multiplication on GPUs
- A doubly stochastic block Gauss-Seidel algorithm for solving linear equations
- Learning chordal extensions
- A factored sparse approximate inverse preconditioned conjugate gradient solver on graphics processing units
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- Approximate residual-minimizing shift parameters for the low-rank ADI iteration
- On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations
- A fast block low-rank dense solver with applications to finite-element matrices
- Estimating the largest elements of a matrix
- A sparse stress model
- A 2/3-approximation algorithm for vertex weighted matching in bipartite graphs
- Beyond non-backtracking: non-cycling network centrality measures
- Data-driven graph drawing techniques with applications for conveyor systems
- On short recurrence Krylov type methods for linear systems with many right-hand sides
- Beyond automated multilevel substructuring: domain decomposition with rational filtering
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned systems
- Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- A fast recursive orthogonalization scheme for the Macaulay matrix
- 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
- Iterative ILU preconditioners for linear systems and eigenproblems
- Self-corrective iterations (SCI) for generalized diagonally dominant matrices
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Krylov subspace recycling for sequences of shifted linear systems
- ViennaCL-linear algebra library for multi- and many-core architectures
- A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems
- An integer programming framework for critical elements detection in graphs
- BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems
- Estimation of the bilinear form \(y^\ast f(A)x\) for Hermitian matrices
- 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
- PageRank beyond the web
- A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems
- A domain-decomposing parallel sparse linear system solver
- Left-looking version of AINV preconditioner with complete pivoting strategy
- GBi-CGSTAB(\(s,L\)): IDR(\(s\)) with higher-order stabilization polynomials
- Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
- ParILUT---A New Parallel Threshold ILU Factorization
- Balanced incomplete factorization preconditioner with pivoting
- RADI: a low-rank ADI-type algorithm for large scale algebraic Riccati equations
- Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
- Complex network partitioning using label propagation
- GPU-accelerated preconditioned GMRES method for two-dimensional Maxwell's equations
- Finding maximum subgraphs with relatively large vertex connectivity
- A new method based on generalized Taylor expansion for computing a series solution of the linear systems
- Global simpler GMRES for nonsymmetric systems with multiple right-hand sides
Uses Software
This page was built for publication: The University of Florida sparse matrix collection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989137)
