The University of Florida sparse matrix collection
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The design and use of a sparse direct solver for skew symmetric matrices
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- A tearing-based hybrid parallel banded linear system solver
- A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix
- A feasible method for optimization with orthogonality constraints
- Parallel algorithms for solving linear systems with sparse triangular matrices
- Preconditioner based on the Sherman-Morrison formula for regularized least squares problems
- An optimal approach for the critical node problem using semidefinite programming
- Spectral coarse grained controllability of complex networks
- Off-diagonal low-rank preconditioner for difficult PageRank problems
- Randomized OBDD-based graph algorithms
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- Block row projection method based on M-matrix splitting
- On convergence rate of the randomized Kaczmarz method
- Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Heavy ball restarted CMRH methods for linear systems
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
- Improved formulations for minimum connectivity network interdiction problems
- A biased random-key genetic algorithm for the maximum quasi-clique problem
- Preconditioning complex symmetric linear systems
- Estimating the trace of the matrix inverse by interpolating from the diagonal of an approximate inverse
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- A parallel computing method using blocked format with optimal partitioning for SpMV on GPU
- SparseMatrix
- Matrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs
- Blankets joint posterior score for learning Markov network structures
- On the structured backward error of inexact Arnoldi methods for (skew)-Hermitian and (skew)-symmetric eigenvalue problems
- Experiments with sparse Cholesky using a sequential task-flow implementation
- An efficient elimination strategy for solving PageRank problems
- A new iterative method for solving complex symmetric linear systems
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- New parallel sparse direct solvers for multicore architectures
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- Threshold incomplete factorization constraint preconditioners for saddle-point matrices
- A block Lanczos method for the linear response eigenvalue problem
- Weighted Golub-Kahan-Lanczos bidiagonalization algorithms
- Varying the \(s\) in your \(s\)-step GMRES
- The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm
- Jagged non-zero submatrix data structure
- The critical node detection problem in networks: a survey
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- A supernodal block factorized sparse approximate inverse for non-symmetric linear systems
- A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems
- Efficient CSR-based sparse matrix-vector multiplication on GPU
- A novel CSR-based sparse matrix-vector multiplication on GPUs
- Ranking hubs and authorities using matrix functions
- A parallel implementation of the CMRH method for dense linear systems
- Data-driven graph drawing techniques with applications for conveyor systems
- A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems
- Algorithms for the computation of the matrix logarithm based on the double exponential formula
- 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
- On exact solution approaches for the longest induced path problem
- A modularity based spectral method for simultaneous community and anti-community detection
- 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
- A hybridized iterative algorithm of the BiCORSTAB and GPBiCOR methods for solving non-Hermitian linear systems
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths
- 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 new randomized Gauss-Seidel method for solving linear least-squares problems
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
- 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
- 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
- Learning chordal extensions
- Spectral residual method for nonlinear equations on Riemannian manifolds
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- Computing the matrix fractional power with the double exponential formula
- Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods
- On the convergence of a randomized block coordinate descent algorithm for a matrix least squares problem
- A \(2/3\)-approximation algorithm for vertex-weighted matching
- Scaling matrices and counting the perfect matchings in graphs
- On two-subspace randomized extended Kaczmarz method for solving large linear least-squares problems
- A simple extrapolation method for clustered eigenvalues
- Improvement of preconditioned bi-Lanczos-type algorithms with residual norm minimization for the stable solution of systems of linear equations
- A multilevel approach to stochastic trace estimation
- Localized Fourier analysis for graph signal processing
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
- A novel ILU preconditioning method with a block structure suitable for SIMD vectorization
- Non-convex exact community recovery in stochastic block model
- Scalability pipelined algorithm of the conjugate gradient method on heterogeneous platforms
- Solving large linear least squares problems with linear equality constraints
- A dimension expanded preconditioning technique for saddle point problems
- A weighted randomized sparse Kaczmarz method for solving linear systems
- A least squares approach for saddle point problems
- On the acceleration of the Barzilai-Borwein method
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- An improved two-sweep iteration method for absolute value equations
- A two-step randomized Gauss-Seidel method for solving large-scale linear least squares problems
- Greedy randomized and maximal weighted residual Kaczmarz methods with oblique projection
- Rational Krylov methods for fractional diffusion problems on graphs
Describes a project that uses
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)
