The University of Florida sparse matrix collection
From MaRDI portal
Publication:2989137
Recommendations
Cited in
(only showing first 100 items - show all)- On short recurrence Krylov type methods for linear systems with many right-hand sides
- A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems
- An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation
- Beyond automated multilevel substructuring: domain decomposition with rational filtering
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Hierarchical orthogonal factorization: sparse least squares problems
- Parallelization of the rational Arnoldi algorithm
- The joint bidiagonalization process with partial reorthogonalization
- A hierarchical low rank Schur complement preconditioner for indefinite linear systems
- Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
- LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory
- An exact algorithm for the maximum quasi‐clique problem
- A novel algebraic multigrid approach based on adaptive smoothing and prolongation for ill-conditioned 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
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Generalizing geometric graphs
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- The constant solution method for solving large-scale differential Sylvester matrix equations with time invariant coefficients
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems
- Probabilistic bounds for the matrix condition number with extended Lanczos bidiagonalization
- Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting
- A least squares approach for saddle point problems
- A generic framework for approximation analysis of greedy algorithms for star bicoloring
- Extrapolating the Arnoldi algorithm to improve eigenvector convergence
- Recent advancements in preconditioning techniques for large size linear systems suited for high performance computing
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
- Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
- A fast recursive orthogonalization scheme for the Macaulay matrix
- A domain decomposition Rayleigh-Ritz algorithm for symmetric generalized eigenvalue problems
- Chebyshev acceleration of iterative refinement
- IDR(s) for solving shifted nonsymmetric linear systems
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- On a conjugate directions method for solving strictly convex QP problem
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Decomposition methods for sparse matrix nearness problems
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices.
- Inexact coordinate descent: complexity and preconditioning
- A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units
- A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching
- Hierarchical clustering with deep q-learning
- Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems
- On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems
- A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems
- Detecting critical node structures on graphs: a mathematical programming approach
- Randomized extended average block Kaczmarz for solving least squares
- 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
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- A geometric probability randomized Kaczmarz method for large scale linear systems
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- Localized Fourier analysis for graph signal processing
- An Efficient Variant of the GMRES(m) Method Based on the Error Equations
- A robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
- Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors
- Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems
- Tuning soft mutations of the evolution algorithm for optimizing the linear solver parameters
- An efficient analyse phase for element problems.
- Anymatrix: an extensible MATLAB matrix collection
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- A weighted randomized sparse Kaczmarz method for solving linear systems
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
- Localization in matrix computations: theory and applications
- On constrained Kaczmarz algorithm with momentum for image reconstruction
- Balancing between the local and global structures (LGS) in graph embedding
- A skew-symmetric Lanczos bidiagonalization method for computing several extremal eigenpairs of a large skew-symmetric matrix
- Preconditioners for nonsymmetric indefinite linear systems
- Optimizing sparse matrix-matrix multiplication for the GPU
- A reduced-order discontinuous Galerkin method based on a Krylov subspace technique in nanophotonics
- 2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications
- On the symmetric componentwise relative backward error for linear systems of equations
- Solving the Distance-Based Critical Node Problem
- On greedy randomized average block Kaczmarz method for solving large linear systems
- On randomized partial block Kaczmarz method for solving huge linear algebraic systems
- Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems
- The appeals of quadratic majorization-minimization
- Self-corrective iterations (SCI) for generalized diagonally dominant matrices
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector
- Iterative ILU preconditioners for linear systems and eigenproblems
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- Parallel Schur complement techniques based on multiprojection methods
- Distributed algebraic tearing and interconnecting techniques
- On the maximum small-world subgraph problem
- Mixed precision algorithms in numerical linear algebra
- Linearly convergent adjoint free solution of least squares problems by random descent
- Inexact rational Krylov Subspace methods for approximating the action of functions of matrices
- A Note on Inexact Inner Products in GMRES
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Sharp 2-norm error bounds for LSQR and the conjugate gradient method
- Accelerating block coordinate descent methods with identification strategies
- Krylov subspace recycling for sequences of shifted linear systems
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Graph models and their efficient implementation for sparse Jacobian matrix determination
- A new projected variant of the deflated block conjugate gradient method
- ViennaCL-linear algebra library for multi- and many-core architectures
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)
