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
Monte Carlo Methods for Estimating the Diagonal of a Real Symmetric Matrix, GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems, The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision, Preconditioning Sparse Matrices with Alternating and Multiplicative Operator Splittings, Mixed precision algorithms in numerical linear algebra, Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement, The extended block Arnoldi method for solving generalized differential Sylvester equations, An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations, ILP-Based Local Search for Graph Partitioning, Better Process Mapping and Sparse Quadratic Assignment, An almost-maximal residual tensor block Kaczmarz method for large tensor linear systems, An efficient randomized QLP algorithm for approximating the singular value decomposition, Numerical methods for solving large-scale systems of differential equations, A Block Krylov Method to Compute the Action of the Fréchet Derivative of a Matrix Function on a Vector with Applications to Condition Number Estimation, Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations, On adaptive block coordinate descent methods for ridge regression, A dimension expanded preconditioning technique for block two-by-two linear equations, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices, Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems, Accelerated greedy randomized augmented Kaczmarz algorithm for inconsistent linear systems, On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems, In search of dense subgraphs: How good is greedy peeling?, Automated tuning for the parameters of linear solvers, An exact algorithm for the maximum quasi‐clique problem, Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems, Krylov-Aware Stochastic Trace Estimation, Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning, Efficient Algebraic Two-Level Schwarz Preconditioner for Sparse Matrices, On convergence rates of Kaczmarz-type methods with different selection rules of working rows, Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold, A gradient method exploiting the two dimensional quadratic termination property, Row Replicated Block Cimmino, Probabilistic Rounding Error Analysis of Householder QR Factorization, Spherical graph drawing by multi-dimensional scaling, Shape-faithful graph drawings, On a family of low-rank algorithms for large-scale algebraic Riccati equations, Thick-restarted joint Lanczos bidiagonalization for the GSVD, The constant solution method for solving large-scale differential Sylvester matrix equations with time invariant coefficients, Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors, Faster Deterministic Pseudoinverse-Free Block Extension of Motzkin Method for Large Consistent Linear Systems, Sparse sampling Kaczmarz–Motzkin method with linear convergence, 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, Linearly convergent adjoint free solution of least squares problems by random descent, On greedy randomized block Gauss-Seidel method with averaging for sparse linear least-squares problems, Fast Computation of Spectral Projectors of Banded Matrices, Inexact rational Krylov Subspace methods for approximating the action of functions of matrices, Projection Improved SPAI Preconditioner for FGMRES, Computation of the von Neumann entropy of large matrices via trace estimators and rational Krylov methods, Five-Precision GMRES-Based Iterative Refinement, Adaptively restarted block Krylov subspace methods with low-synchronization skeletons, Krylov Subspace Restarting for Matrix Laplace Transforms, Proximal quasi-Newton method for composite optimization over the Stiefel manifold, A collection of efficient retractions for the symplectic Stiefel manifold, Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods, Unnamed Item, Unnamed Item, Finding the most degree-central walks and paths in a graph: exact and heuristic approaches, Random Coordinate Descent Methods for Nonseparable Composite Optimization, On the Preconditioned Delayed Weighted Gradient Method, XT<scp>race</scp>: Making the Most of Every Sample in Stochastic Trace Estimation, An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval, The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations, Adaptive Precision Sparse Matrix–Vector Product and Its Application to Krylov Solvers, On optimal universal first-order methods for minimizing heterogeneous sums, Parallelization of the Rational Arnoldi Algorithm, Multipreconditioned Gmres for Shifted Systems, An Efficient Multigrid Method for Graph Laplacian Systems II: Robust Aggregation, A Lanczos Method for Large-Scale Extreme Lorentz Eigenvalue Problems, Fast Estimation of Approximate Matrix Ranks Using Spectral Densities, An Efficient Variant of the GMRES(m) Method Based on the Error Equations, Deflation as a Method of Variance Reduction for Estimating the Trace of a Matrix Inverse, Computing the Action of Trigonometric and Hyperbolic Matrix Functions, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, Algorithms for the CMRH method for dense linear systems, On short recurrence Krylov type methods for linear systems with many right-hand sides, Generalizing Geometric Graphs, A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc, Algorithm 937, A fast convergent iterative solver for approximate inverse of matrices, Restrictively Preconditioned Conjugate Gradient Method for a Series of Constantly Augmented Least Squares Problems, Tree decompositions and social graphs, A Domain Decomposition Rayleigh--Ritz Algorithm for Symmetric Generalized Eigenvalue Problems, Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems, Polynomial Preconditioned Arnoldi with Stability Control, Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems, Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization, SIMD Parallel Sparse Matrix-Vector and Transposed-Matrix-Vector Multiplication in DD Precision, A Data-Parallel ILUPACK for Sparse General and Symmetric Indefinite Linear Systems, Parametric Multi-step Scheme for GPU-Accelerated Graph Decomposition into Strongly Connected Components, A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation, A Block Minimum Residual Norm Subspace Solver with Partial Convergence Management for Sequences of Linear Systems, Greedy Kaczmarz Algorithm Using Optimal Intermediate Projection Technique for Coherent Linear Systems, A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large 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, An accelerated minimal gradient method with momentum for strictly convex quadratic optimization, A stabilized GMRES method for singular and severely ill-conditioned systems of linear equations, Metaheuristic algorithms for the bandwidth reduction of large-scale matrices, On greedy randomized average block Kaczmarz method for solving large linear systems, Hierarchical orthogonal factorization: sparse least squares problems, When does the Lanczos algorithm compute exactly?, An extended delayed weighted gradient algorithm for solving strongly convex optimization problems, A class of residual-based extended Kaczmarz methods for solving inconsistent linear systems, On randomized partial block Kaczmarz method for solving huge linear algebraic systems, The inexact Euler-extrapolated block preconditioners for a class of complex linear systems, A greedy block Kaczmarz algorithm for solving large-scale linear systems, An opposition-based memetic algorithm for the maximum quasi-clique problem, Changing over stopping criterion for stable solving nonsymmetric linear equations by preconditioned conjugate gradient squared method, A parallel multithreaded sparse triangular linear system solver, On relaxed greedy randomized coordinate descent methods for solving large linear least-squares problems, Ranking hubs and authorities using matrix functions, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides, An alternative extended block Arnoldi method for solving low-rank Sylvester equations, Matrix LSQR algorithm for structured solutions to quaternionic least squares problem, Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems, A parallel implementation of the CMRH method for dense linear systems, Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms, Algorithms for approximate subtropical matrix factorization, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, Two new variants of the simpler block GMRES method with vector deflation and eigenvalue deflation for multiple linear systems, Discrete trace theorems and energy minimizing spring embeddings of planar graphs, On convergence rate of the randomized Gauss-Seidel method, Block sampling Kaczmarz-Motzkin methods for consistent linear systems, \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM, COSMO: a conic operator splitting method for convex conic problems, Data-driven graph drawing techniques with applications for conveyor systems, A block Lanczos method for the linear response eigenvalue problem, Weighted Golub-Kahan-Lanczos bidiagonalization algorithms, Varying the \(s\) in your \(s\)-step GMRES, On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs, A spectral Newton-Schur algorithm for the solution of symmetric generalized eigenvalue problems, 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, A doubly stochastic block Gauss-Seidel algorithm for solving linear equations, Algorithms for the computation of the matrix logarithm based on the double exponential formula, A count sketch maximal weighted residual Kaczmarz method for solving highly overdetermined linear systems, Jagged non-zero submatrix data structure, Analysis of centrality measures under differential privacy models, The critical node detection problem in networks: a survey, Efficient algorithms for updating betweenness centrality in fully dynamic graphs, Parallel multiprojection preconditioned methods based on subspace compression, A supernodal block factorized sparse approximate inverse for non-symmetric linear systems, An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method, Convergent homotopy analysis method for solving linear systems, Improved componentwise verified error bounds for least squares problems and underdetermined linear systems, A geometric probability randomized Kaczmarz method for large scale linear systems, On exact solution approaches for the longest induced path problem, A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems, 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, Efficient CSR-based sparse matrix-vector multiplication on GPU, 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 novel CSR-based sparse matrix-vector multiplication on GPUs, 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, A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices, Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix, Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization, AmgX: A Library for GPU Accelerated Algebraic Multigrid and Preconditioned Iterative Methods, Sparse Matrix Methods for Circuit Simulation Problems, Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures, A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners, A Nested Lanczos Method for the Trust-Region Subproblem, Beyond Automated Multilevel Substructuring: Domain Decomposition with Rational Filtering, ParILUT---A New Parallel Threshold ILU Factorization, A Hierarchical Low Rank Schur Complement Preconditioner for Indefinite Linear Systems, GPU-accelerated preconditioned GMRES method for two-dimensional Maxwell's equations, Decomposition Methods for Sparse Matrix Nearness Problems, Increasing the Performance of the Jacobi--Davidson Method by Blocking, Updating and Downdating Techniques for Optimizing Network Communicability, Randomized OBDD-Based Graph Algorithms, Computation of Generalized Matrix Functions, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units, The $QR$ Steps with Perfect Shifts, Randomized Complete Pivoting for Solving Symmetric Indefinite Linear Systems, On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices, A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm, A Truncated Taylor Series Algorithm for Computing the Action of Trigonometric and Hyperbolic Matrix Functions, An efficient analyse phase for element problems, Parallel Schur Complement Techniques Based on Multiprojection Methods, Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD, LSMB: Minimizing the Backward Error for Least-Squares Problems, The Adaptive $s$-Step Conjugate Gradient Method, The Open Graph Archive: A Community-Driven Effort, Fast Estimation of $tr(f(A))$ via Stochastic Lanczos Quadrature, On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations, Incomplete LU Preconditioner Based on Max-Plus Approximation of LU Factorization, Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis, A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics, Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods, Schur complement-based domain decomposition preconditioners with low-rank corrections, Numerical recovery strategies for parallel resilient Krylov linear solvers, A New Analysis of Iterative Refinement and Its Application to Accurate Solution of Ill-Conditioned Sparse Linear Systems, Randomized Quasi-Newton Updates Are Linearly Convergent Matrix Inversion Algorithms, A Sparse Stress Model, How to Generate Effective Block Jacobi Preconditioners for Solving Large Sparse Linear Systems, A Multithreaded Recursive and Nonrecursive Parallel Sparse Direct Solver, Constrained Min-Cut Replication for K-Way Hypergraph Partitioning, Erasure Coding for Fault-Oblivious Linear System Solvers, 1.5D Parallel Sparse Matrix-Vector Multiply, On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems, A Robust Multilevel Approximate Inverse Preconditioner for Symmetric Positive Definite Matrices, Computing the Weighted Geometric Mean of Two Large-Scale Matrices and Its Inverse Times a Vector, Enhancing Performance and Robustness of ILU Preconditioners by Blocking and Selective Transposition, Localization in Matrix Computations: Theory and Applications, Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting, On Hessenberg type methods for low-rank Lyapunov matrix equations, Localized spectrum slicing, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, Drawing Big Graphs Using Spectral Sparsification, Detecting critical node structures on graphs: A mathematical programming approach, A Block Lanczos Method for the Extended Trust-Region Subproblem, On Monte Carlo and Quasi-Monte Carlo for Matrix Computations, Graph Coloring Using GPUs, Parallel Hybrid Sparse Linear System Solvers, Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices, Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems, A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error, A Hypergraph Partitioning Model for Profile Minimization, A Novel Algebraic Multigrid Approach Based on Adaptive Smoothing and Prolongation for Ill-Conditioned Systems, Community Detection in Networks via Nonlinear Modularity Eigenvectors, Communication lower bounds and optimal algorithms for numerical linear algebra, A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection, On the Stability of Network Indices Defined by Means of Matrix Functions, A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver, Factors Impacting Performance of Multithreaded Sparse Triangular Solve, TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector, Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes, An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph, A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows, Parallel Jacobi-Davidson with block FSAI preconditioning and controlled inner iterations, Level-based heuristics and hill climbing for the antibandwidth maximization problem, Estimating the Largest Elements of a Matrix, ViennaCL---Linear Algebra Library for Multi- and Many-Core Architectures, Efficient Approximation Algorithms for Weighted $b$-Matching, Complex Network Partitioning Using Label Propagation, Performance-Based Numerical Solver Selection in the Lighthouse Framework, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication, A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems, On the cost of iterative computations, Algebraic Algorithms for Betweenness and Percolation Centrality, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, A Lipschitz Matrix for Parameter Reduction in Computational Science, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, On Adaptive Sketch-and-Project for Solving Linear Systems, Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR$^2$ Format, Stable Computation of Generalized Matrix Functions via Polynomial Interpolation, Euclidean-Norm Error Bounds for SYMMLQ and CG, Max-Balanced Hungarian Scalings, A Two-Level Preconditioning Framework Based on a Richardson Iterative Process, GMRES Acceleration of Restricted Schwarz Iterations, On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations, A breakdown-free block conjugate gradient method, Variants of the groupwise update strategy for short-recurrence Krylov subspace methods, Block Krylov-type complex moment-based eigensolvers for solving generalized eigenvalue problems, Updating preconditioners for modified least squares problems, A quasi-minimal residual variant of the BiCORSTAB method for nonsymmetric linear systems, Solving equations through particle dynamics, Continuous quadratic programming formulations of optimization problems on graphs, A fast block low-rank dense solver with applications to finite-element matrices, Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems, An implicitly restarted block Lanczos bidiagonalization method using Leja shifts, 2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications, Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking, A simple strategy for varying the restart parameter in GMRES\((m)\), Efficient preconditioner updates for unsymmetric shifted linear systems, Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations, A fixed-point method for approximate projection onto the positive semidefinite cone, On greedy randomized block Kaczmarz method for consistent linear systems, Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices, Finding near-optimal independent sets at scale, On the algorithm by Al-Mohy and Higham for computing the action of the matrix exponential: a posteriori roundoff error estimation, LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory, A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix, tpSpMV: a two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures, A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching, Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis, Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems, On extended Kaczmarz methods with random sampling and maximum-distance for solving large inconsistent linear systems, Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors, Compatibility, embedding and regularization of non-local random walks on graphs, On randomized trace estimates for indefinite matrices with an application to determinants, Domain decomposition based preconditioner combined local low-rank approximation with global corrections, Hierarchical clustering with deep q-learning, Anymatrix: an extensible MATLAB matrix collection, A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization, Implicit steepest descent algorithm for optimization with orthogonality constraints, Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair, Accelerating block coordinate descent methods with identification strategies, A new shifted block GMRES method with inexact breakdowns for solving multi-shifted and multiple right-hand sides linear systems, Optimal size of the block in block GMRES on GPUs: computational model and experiments, Hybrid iterative refined restarted Lanczos bidiagonalization methods, A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair, Balanced incomplete factorization preconditioner with pivoting, Low complexity matrix projections preserving actions on vectors, On fast greedy block Kaczmarz methods for solving large consistent linear systems, On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems, The intrinsic Toeplitz structure and its applications in algebraic Riccati equations, Global GPBiCGstab\((L)\) method for solving linear matrix equations, The randomized Kaczmarz algorithm with the probability distribution depending on the angle, Randomized block subsampling Kaczmarz-Motzkin method, A harmonic framework for stepsize selection in gradient methods, Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud, Componentwise enclosure for solutions of least squares problems and underdetermined systems, Left-looking version of AINV preconditioner with complete pivoting strategy, Graph models and their efficient implementation for sparse Jacobian matrix determination, Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows, Exact identification of critical nodes in sparse networks via new compact formulations, On the choice of preconditioner for minimum residual methods for non-Hermitian matrices, A Cholesky out-of-core factorization, Fast structured LU factorization for nonsymmetric matrices, Minimization principles and computation for the generalized linear response eigenvalue problem, Krylov subspace recycling for sequences of shifted linear systems, An efficient and accurate method to compute the Fiedler vector based on Householder deflation and inverse power iteration, A block \(\mathrm{GCROT}(m, k)\) method for linear systems with multiple right-hand sides, Simultaneous similarity reductions for a pair of matrices to condensed forms, Verified bounds for all the singular values of matrix, Variants of residual smoothing with a small residual gap, A reduced-order discontinuous Galerkin method based on a Krylov subspace technique in nanophotonics, An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices, On the error estimate of the randomized double block Kaczmarz method, Barzilai-Borwein-like methods for the extreme eigenvalue problem, A note on the adaptive simpler block GMRES method, PageRank Beyond the Web, Approximating Spectral Densities of Large Matrices, Preconditioners for rank deficient least squares problems, Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs, Chordal decomposition in operator-splitting methods for sparse semidefinite programs, The Leja Method Revisited: Backward Error Analysis for the Matrix Exponential, Preconditioning of the Reduced System Associated with the Restricted Additive Schwarz Method, Factorized Approximate Inverses with Adaptive Dropping, Finding strongly connected components of simple digraphs based on granulation strategy, On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices, Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously, Optimal \(K\)-node disruption on a node-capacitated network, Computing Partial Spectra with Least-Squares Rational Filters, Interpolation-Restart Strategies for Resilient Eigensolvers, Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems, Variant of greedy randomized Kaczmarz for ridge regression, Optimizing Sparse Matrix—Matrix Multiplication for the GPU, A Sparse Symmetric Indefinite Direct Solver for GPU Architectures, Efficient Matching for Column Intersection Graphs, A new projected variant of the deflated block conjugate gradient method, On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, On the maximum small-world subgraph problem, An inexact dual logarithmic barrier method for solving sparse semidefinite programs, Preconditioners for nonsymmetric indefinite linear systems, Distributed algebraic tearing and interconnecting techniques, The effect of graph partitioning techniques on parallel block FSAI preconditioning: a computational study, An integer programming approach for finding the most and the least central cliques, 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, Efficient approximation of functions of some large matrices by partial fraction expansions, Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem, Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting, Computation of generalized matrix functions with rational Krylov methods, On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems, A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems, On Convergence of the Partially Randomized Extended Kaczmarz Method, Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel, GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU, Reproduced Computational Results Report for “Ginkgo: A Modern Linear Operator Algebra Framework for High Performance Computing”, Exactly Solving Sparse Rational Linear Systems via Roundoff-Error-Free Cholesky Factorizations, A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations, Iterative ILU Preconditioners for Linear Systems and Eigenproblems, Fortification Against Cascade Propagation Under Uncertainty, A generic framework for approximation analysis of greedy algorithms for star bicoloring, Solving the Distance-Based Critical Node Problem, Improved Variants of the Hutch++ Algorithm for Trace Estimation, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, A Robust Algebraic Multilevel Domain Decomposition Preconditioner for Sparse Symmetric Positive Definite Matrices, Reordering Strategy for Blocking Optimization in Sparse Linear Solvers, Cross-Interactive Residual Smoothing for Global and Block Lanczos-Type Solvers for Linear Systems with Multiple Right-Hand Sides, A Note on Inexact Inner Products in GMRES, The Short-Term Rational Lanczos Method and Applications, A Numerical Comparison of Different Solvers for Large-Scale, Continuous-Time Algebraic Riccati Equations and LQR Problems, Design and Implementation of a Parallel Markowitz Threshold Algorithm, An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations, Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM, Extrapolating the Arnoldi Algorithm To Improve Eigenvector Convergence, HSL_MI28, FSAIPACK, A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs, Finding Critical Links for Closeness Centrality, BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property, Randomized Extended Average Block Kaczmarz for Solving Least Squares, Sharp 2-Norm Error Bounds for LSQR and the Conjugate Gradient Method, Norm and Trace Estimation with Random Rank-one Vectors, MPI+OpenMP реализация метода сопряженных градиентов с факторизованными неявными предобусловливателями, Adaptive Relaxation Strategy on Basic Iterative Methods for Solving Linear Systems with Single and Multiple Right-Hand Sides, Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Beyond non-backtracking: non-cycling network centrality measures, Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems, A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians, Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning, Two-Level Nyström--Schur Preconditioner for Sparse Symmetric Positive Definite Matrices, Unnamed Item, Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning, Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm, Approximate residual-minimizing shift parameters for the low-rank ADI iteration, Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition, Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem, Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices, A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting, Approximation algorithms in combinatorial scientific computing, A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units, On Inner Iterations of Jacobi--Davidson Type Methods for Large SVD Computations, Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems, A Robust Iterative Scheme for Symmetric Indefinite Systems, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software, Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs, A Golub--Kahan Davidson Method for Accurately Computing a Few Singular Triplets of Large Sparse Matrices, Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems, LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property, Modifying AMG Coarse Spaces with Weak Approximation Property to Exhibit Approximation in Energy Norm, Unnamed Item, Unnamed Item, A New Approach to Probabilistic Rounding Error Analysis, Unnamed Item, Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions, An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation, An Adaptive Multigrid Method Based on Path Cover, A Tridiagonalization Method for Symmetric Saddle-Point Systems, Multiway Monte Carlo Method for Linear Systems, Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin, Projected Newton method for noise constrained Tikhonov regularization, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems, Rational Spectral Filters with Optimal Convergence Rate, Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems, Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds, Nonlocal pagerank, Communication Avoiding ILU0 Preconditioner, Subspace Iteration Randomization and Singular Value Problems, The Augmented Block Cimmino Distributed Method, Computing Eigenvalues of Real Symmetric Matrices with Rational Filters in Real Arithmetic, Improving Multifrontal Methods by Means of Block Low-Rank Representations, Stochastic Gradient Descent Works Really Well for Stress Minimization, Mittag--Leffler Functions and their Applications in Network Science, On Greedy Randomized Augmented Kaczmarz Method for Solving Large Sparse Inconsistent Linear Systems, Spectral Analysis of Large Sparse Matrices for Scalable Direct Solvers, Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation, New analytical lower bounds on the clique number of a graph, A Nonlinear Spectral Method for Core--Periphery Detection in Networks, Metric-Constrained Optimization for Graph Clustering Algorithms, DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations, Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems, A simpler GMRES and its adaptive variant for shifted linear systems, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning, Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems, Hierarchical Orthogonal Factorization: Sparse Square Matrices, Divide-and-Conquer Methods for Functions of Matrices with Banded or Hierarchical Low-Rank Structure
Uses Software
