The following pages link to SuiteSparse (Q16798):
Displaying 48 items.
- A sparse linear algebra algorithm for fast computation of prediction variances with Gaussian Markov random fields (Q148999) (← links)
- An efficient way to assemble finite element matrices in vector languages (Q329010) (← links)
- Extended nonsymmetric global Lanczos method for matrix function approximation (Q780408) (← links)
- Dipole excitation of surface plasmon on a conducting sheet: finite element approximation and validation (Q1685642) (← links)
- Hybrid algorithms for solving the algebraic eigenvalue problem with sparse matrices (Q1699408) (← links)
- Stabilized equal low-order finite elements in ice sheet modeling -- accuracy and robustness (Q1787642) (← links)
- Hardening and strengthening behavior in rate-independent strain gradient crystal plasticity (Q1788050) (← links)
- The e-MoM approach for approximating matrix functionals (Q1989169) (← links)
- Some uses of the field of values in numerical analysis (Q2024162) (← links)
- Shifted extended global Lanczos processes for trace estimation with application to network analysis (Q2035644) (← links)
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- Multi-step greedy Kaczmarz algorithms with simple random sampling for solving large linear systems (Q2085033) (← links)
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
- GMRES using pseudoinverse for range symmetric singular systems (Q2104052) (← links)
- An extended-rational Arnoldi method for large matrix exponential evaluations (Q2144973) (← links)
- Enclosing Moore-Penrose inverses (Q2174195) (← links)
- Performance and stability of direct methods for computing generalized inverses of the graph Laplacian (Q2208933) (← links)
- On a new variant of Arnoldi method for approximation of eigenpairs (Q2229927) (← links)
- COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
- Unsymmetric multi-level hanging nodes and anisotropic polynomial degrees in \(H^1\)-conforming higher-order finite element methods (Q2403738) (← links)
- 2LEV-D2P4: a package of high-performance preconditioners for scientific and engineering applications (Q2642893) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Monte Carlo estimators for the Schatten \(p\)-norm of symmetric positive semidefinite matrices (Q2672173) (← links)
- Domain decomposition methods for 3D crack propagation problems using XFEM (Q2679306) (← links)
- The global Golub-Kahan method and Gauss quadrature for tensor function approximation (Q2679650) (← links)
- Parallel Minimum Norm Solution of Sparse Block Diagonal Column Overlapped Underdetermined Systems (Q3133582) (← links)
- Right preconditioned MINRES for singular systems <sup>†</sup> (Q3297075) (← links)
- Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization (Q4588945) (← links)
- (Q4625049) (← links)
- A comparative study of null‐space factorizations for sparse symmetric saddle point systems (Q4637390) (← links)
- Wilkinson's inertia‐revealing factorization and its application to sparse matrices (Q4637399) (← links)
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error (Q4646451) (← links)
- High-Performance Computation of the Exponential of a Large Sparse Matrix (Q5021020) (← links)
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation (Q5022491) (← links)
- Structured Matrix Approximations via Tensor Decompositions (Q5057769) (← links)
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number (Q5058377) (← links)
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU (Q5066588) (← links)
- A Splitting Scheme for Flip-Free Distortion Energies (Q5094625) (← links)
- Predicting the convergence of BiCG method from grayscale matrix images (Q5121403) (← links)
- Multicolor low‐rank preconditioner for general sparse linear systems (Q5122244) (← links)
- AMPS: Real‐time mesh cutting with augmented matrices for surgical simulations (Q5140457) (← links)
- A Hybrid High-Order Method for Flow Simulations in Discrete Fracture Networks (Q5152846) (← links)
- Sampling and multilevel coarsening algorithms for fast matrix approximations (Q5227180) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems (Q5270774) (← links)
- Low-Rank Updates of Matrix Functions (Q5373925) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
