The university of Florida sparse matrix collection
From MaRDI portal
Publication:2989137
DOI10.1145/2049662.2049663zbMath1365.65123OpenAlexW2035080386WikidataQ113310429 ScholiaQ113310429MaRDI QIDQ2989137
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
Related Items (only showing first 100 items - show all)
Self-corrective iterations (SCI) for generalized diagonally dominant matrices ⋮ The joint bidiagonalization process with partial reorthogonalization ⋮ Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systems ⋮ An optimal approach for the critical node problem using semidefinite programming ⋮ Spectral coarse grained controllability of complex networks ⋮ 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 ⋮ 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 ⋮ Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Global simpler GMRES for nonsymmetric systems with multiple right-hand sides ⋮ A new method based on generalized Taylor expansion for computing a series solution of the linear systems ⋮ State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control ⋮ Inexact coordinate descent: complexity and preconditioning ⋮ Block row projection method based on M-matrix splitting ⋮ On convergence rate of the randomized Kaczmarz method ⋮ Minimum edge blocker dominating set problem ⋮ Preconditioners for nonsymmetric linear systems with low-rank skew-symmetric part ⋮ On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems ⋮ Combination of numerical and structured approaches to the construction of a second-order incomplete triangular factorization in parallel preconditioning methods ⋮ Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices ⋮ 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 ⋮ Locally optimal and heavy ball GMRES methods ⋮ A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems ⋮ 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 ⋮ A fast recursive orthogonalization scheme for the Macaulay matrix ⋮ Matrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs ⋮ Chebyshev acceleration of iterative refinement ⋮ IDR(\(s\)) for solving shifted nonsymmetric linear systems ⋮ Blankets joint posterior score for learning Markov network structures ⋮ An integer programming framework for critical elements detection in graphs ⋮ On the structured backward error of inexact Arnoldi methods for (skew)-Hermitian and (skew)-symmetric eigenvalue problems ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Computing outer inverses by scaled matrix iterations ⋮ Evaluation of the performance of inexact GMRES ⋮ The importance of structure in incomplete factorization preconditioners ⋮ A new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrences ⋮ A domain-decomposing parallel sparse linear system solver ⋮ Experiments with sparse Cholesky using a sequential task-flow implementation ⋮ Preconditioned conjugate gradient methods for the solution of indefinite least squares problems ⋮ Greville's method for preconditioning least squares problems ⋮ The eigenvectors corresponding to the second eigenvalue of the google matrix and their relation to link spamming ⋮ Some observations on weighted GMRES ⋮ 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 ⋮ An efficient elimination strategy for solving PageRank problems ⋮ A new iterative method for solving complex symmetric linear systems ⋮ Different versions of ILU and IUL factorizations obtained from forward and backward factored approximate inverse processes. I ⋮ 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 ⋮ Continuation methods for approximate large scale object sequencing ⋮ Max-plus singular values ⋮ Threshold incomplete factorization constraint preconditioners for saddle-point matrices ⋮ A block Chebyshev-Davidson method for linear response eigenvalue problems ⋮ Block conjugate gradient algorithms for least squares problems ⋮ Low-rank updates of balanced incomplete factorization preconditioners ⋮ RADI: a low-rank ADI-type algorithm for large scale algebraic Riccati equations ⋮ A multilevel bilinear programming algorithm for the vertex separator problem ⋮ On a conjugate directions method for solving strictly convex QP problem ⋮ Sparse approximate inverse preconditioners on high performance GPU platforms ⋮ Preconditioning techniques based on the Birkhoff-von Neumann decomposition ⋮ A parallel sparse linear system solver based on Hermitian/skew-Hermitian splitting ⋮ Inexact proximal Newton methods for self-concordant functions ⋮ Partitioning strategies for the block Cimmino algorithm ⋮ Randomized estimation of spectral densities of large matrices made accurate ⋮ BiCR variants of the hybrid BiCG methods for solving linear systems with nonsymmetric matrices ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ A feasible method for optimization with orthogonality constraints ⋮ GBi-CGSTAB(\(s,L\)): IDR(\(s\)) with higher-order stabilization polynomials ⋮ A class of preconditioners based on matrix splitting for nonsymmetric linear systems ⋮ Parallel algorithms for bipartite matching problems on distributed memory computers ⋮ A tearing-based hybrid parallel sparse linear system solver ⋮ On the modification of an eigenvalue problem that preserves an eigenspace ⋮ Fast enclosure for solutions in underdetermined systems ⋮ An evaluation of low-cost heuristics for matrix bandwidth and profile reductions ⋮ Do you trust derivatives or differences? ⋮ \(\text{PSPIKE}+\): A family of parallel hybrid sparse linear system solvers ⋮ A method for the automatic selection and tuning of the parameters of a sparse SLE solver ⋮ 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 ⋮ Estimating the condition number of \(f(A)b\) ⋮ A framework of constraint preserving update schemes for optimization on Stiefel manifold ⋮ A sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of an SPD matrix ⋮ SparseMatrix ⋮ An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. ⋮ The simpler block CMRH method for linear systems ⋮ Parallel algorithms for solving linear systems with sparse triangular matrices ⋮ Preconditioner based on the Sherman-Morrison formula for regularized least squares problems ⋮ Notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
Uses Software
This page was built for publication: The university of Florida sparse matrix collection
