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)
- A least squares approach for saddle point problems
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- Chebyshev acceleration of iterative refinement
- IDR(\(s\)) for solving shifted nonsymmetric linear systems
- On a conjugate directions method for solving strictly convex QP problem
- 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
- On greedy randomized average block Kaczmarz method for solving large linear systems
- On randomized partial block Kaczmarz method for solving huge linear algebraic systems
- Updating and downdating techniques for optimizing network communicability
- Fast computation of spectral projectors of banded matrices
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- On greedy randomized block Kaczmarz method for consistent linear systems
- Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems
- Parallel algorithms for bipartite matching problems on distributed memory computers
- Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix
- The augmented block Cimmino distributed method
- A novel partitioning method for accelerating the block Cimmino algorithm
- A tearing-based hybrid parallel banded linear system solver
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Community detection in networks via nonlinear modularity eigenvectors
- 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
- A dimension expanded preconditioning technique for saddle point problems
- The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming
- Continuous quadratic programming formulations of optimization problems on graphs
- A tridiagonalization method for symmetric saddle-point systems
- Approximating spectral densities of large matrices
- An efficient elimination strategy for solving PageRank problems
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- Some observations on weighted GMRES
- Solving equations through particle dynamics
- Multilevel algorithms for acyclic partitioning of directed acyclic graphs
- Evaluation of the performance of inexact GMRES
- A simple strategy for varying the restart parameter in GMRES\((m)\)
- Fast enclosure for solutions in underdetermined systems
- 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
- A fast convergent iterative solver for approximate inverse of matrices
- Random Coordinate Descent Methods for Nonseparable Composite Optimization
- An alternative extended block Arnoldi method for solving low-rank Sylvester equations
- Max-plus singular values
- A block Chebyshev-Davidson method for linear response eigenvalue problems
- Greville's method for preconditioning least squares problems
- Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
- 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
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Different versions of ILU and IUL factorizations obtained from forward and backward factored approximate inverse processes. I
- Continuation methods for approximate large scale object sequencing
- Sparse approximate inverse preconditioners on high performance GPU platforms
- A parallel sparse linear system solver based on Hermitian/skew-Hermitian splitting
- Preconditioning techniques based on the Birkhoff-von Neumann decomposition
- Sparse matrix test problems
- Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
- Domain decomposition based preconditioner combined local low-rank approximation with global corrections
- Generalizing geometric graphs
- Partitioning strategies for the block Cimmino algorithm
- Randomized estimation of spectral densities of large matrices made accurate
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Hierarchical clustering with deep q-learning
- On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
- Parallel Schur complement techniques based on multiprojection methods
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- Relaxation-based coarsening for multilevel hypergraph partitioning
- On Adaptive Sketch-and-Project for Solving Linear Systems
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- An improved two-sweep iteration method for absolute value equations
- Mittag-Leffler functions and their applications in network science
- Simultaneous similarity reductions for a pair of matrices to condensed forms
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection
- An accelerated minimal gradient method with momentum for strictly convex quadratic optimization
- Rational Krylov methods for fractional diffusion problems on graphs
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
- Approximation algorithms in combinatorial scientific computing
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- Analysis of centrality measures under differential privacy models
- Fast structured LU factorization for nonsymmetric matrices
- The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- When does the Lanczos algorithm compute exactly?
- A block Lanczos method for the extended trust-region subproblem
- A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems
- An adaptive multigrid method based on path cover
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Compatibility, embedding and regularization of non-local random walks on graphs
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)
