SuiteSparse

swMATH4628MaRDI QIDQ16798FDOQ16798

Author name not available (Why is that?)

Source code repository: https://github.com/DrTimothyAldenDavis/SuiteSparse

Cited In (48)

• Performance and stability of direct methods for computing generalized inverses of the graph Laplacian
• Right preconditioned MINRES for singular systems.
• Lower bounds for the bandwidth problem
• AMPS: real-time mesh cutting with augmented matrices for surgical simulations.
• The e-MoM approach for approximating matrix functionals
• A hybrid high-order method for flow simulations in discrete fracture networks
• Sampling and multilevel coarsening algorithms for fast matrix approximations
• Enclosing Moore-Penrose inverses
• High-performance computation of the exponential of a large sparse matrix
• 2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications
• GMRES using pseudoinverse for range symmetric singular systems
• Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
• Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
• Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
• Predicting the convergence of BiCG method from grayscale matrix images
• Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
• Some uses of the field of values in numerical analysis
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• Multicolor low-rank preconditioner for general sparse linear systems.
• Shifted extended global Lanczos processes for trace estimation with application to network analysis
• A splitting scheme for flip-free distortion energies
• Domain decomposition methods for 3D crack propagation problems using XFEM
• A comparative study of null-space factorizations for sparse symmetric saddle point systems.
• An efficient way to assemble finite element matrices in vector languages
• On a new variant of Arnoldi method for approximation of eigenpairs
• Hardening and strengthening behavior in rate-independent strain gradient crystal plasticity
• Unsymmetric multi-level hanging nodes and anisotropic polynomial degrees in \(H^1\)-conforming higher-order finite element methods
• Stabilized equal low-order finite elements in ice sheet modeling -- accuracy and robustness
• GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
• Low-rank updates of matrix functions
• Global balancing of a triangular mesh
• Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
• A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields
• Extended nonsymmetric global Lanczos method for matrix function approximation
• A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
• Structured Matrix Approximations via Tensor Decompositions
• Monte Carlo estimators for the Schatten \(p\)-norm of symmetric positive semidefinite matrices
• Dipole excitation of surface plasmon on a conducting sheet: finite element approximation and validation
• Wilkinson's inertia-revealing factorization and its application to sparse matrices.
• The global Golub-Kahan method and Gauss quadrature for tensor function approximation
• Bregman primal-dual first-order method and application to sparse semidefinite programming
• An extended-rational Arnoldi method for large matrix exponential evaluations
• Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
• COSMO: a conic operator splitting method for convex conic problems
• Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices
• Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems
• Design and implementation of a modular interior-point solver for linear optimization
• \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria

This page was built for software: SuiteSparse