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)
- 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
- A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences
- BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control
- An optimal approach for the critical node problem using semidefinite programming
- Minimum edge blocker dominating set problem
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods
- Scaling matrices and counting the perfect matchings in graphs
- SparseMatrix
- Ranking hubs and authorities using matrix functions
- A feasible method for optimization with orthogonality constraints
- A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems
- OSQP: an operator splitting solver for quadratic programs
- An integer programming approach for finding the most and the least central cliques
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
- Exact identification of critical nodes in sparse networks via new compact formulations
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- A multilevel bilinear programming algorithm for the vertex separator problem
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- Locally optimal and heavy ball GMRES methods
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- A new iterative method for solving complex symmetric linear systems
- Computing the matrix fractional power with the double exponential formula
- Convergent homotopy analysis method for solving linear systems
- Finding strongly connected components of simple digraphs based on granulation strategy
- The importance of structure in incomplete factorization preconditioners
- Computation of generalized matrix functions
- The critical node detection problem in networks: a survey
- Sparse matrix methods for circuit simulation problems
- TRACEMIN-Fiedler: a parallel algorithm for computing the Fiedler vector
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- AmgX: a library for GPU accelerated algebraic multigrid and preconditioned iterative methods
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- \texttt{HSL\_MI28}: an efficient and robust limited-memory incomplete Cholesky factorization code
- DAESA -- a Matlab tool for structural analysis of differential-algebraic equations: theory
- FSAIPACK: a software package for high-performance factored sparse approximate inverse preconditioning
- Efficient matching for column intersection graphs
- Factors impacting performance of multithreaded sparse triangular solve
- The eigenvalues slicing library (EVSL): algorithms, implementation, and software
- Preconditioning complex symmetric linear systems
- 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
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)
