SuiteSparseQR
From MaRDI portal
Software:19384
swMATH7348MaRDI QIDQ19384FDOQ19384
Author name not available (Why is that?)
Cited In (44)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- Hyperpriors for Matérn fields with applications in Bayesian inversion
- A fitted finite element method for the numerical approximation of void electro-stress migration
- Weighted Triangulations for Geometry Processing
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Fine-grained multithreading for the multifrontal \(QR\) factorization of sparse matrices
- The Geometry of Multivariate Polynomial Division and Elimination
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- Wilkinson's inertia‐revealing factorization and its application to sparse matrices
- Efficient and error minimized coupling procedures for unstructured and moving meshes
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Towards a reliable implementation of least-squares collocation for higher index differential-algebraic equations. I: Basics and ansatz function choices
- Towards a reliable implementation of least-squares collocation for higher index differential-algebraic equations. II: The discrete least-squares problem
- A minimum Sobolev norm technique for the numerical discretization of PDEs
- Parallel Minimum Norm Solution of Sparse Block Diagonal Column Overlapped Underdetermined Systems
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- Algorithm 933
- Deciding stability of sheaves on curves
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Hierarchical Orthogonal Factorization: Sparse Square Matrices
- Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- Geometric continuity constraints of automatically derived parametrisations in CAD-based shape optimisation
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix
- Dipole excitation of surface plasmon on a conducting sheet: finite element approximation and validation
- Domain Decomposition and Parallel Direct Solvers as an Adaptive Multiscale Strategy for Damage Simulation in Quasi-Brittle Materials
- Parallel QR Factorization of Block-Tridiagonal Matrices
- ELASTIC FLOW WITH JUNCTIONS: VARIATIONAL APPROXIMATION AND APPLICATIONS TO NONLINEAR SPLINES
- Title not available (Why is that?)
- Parametric approximation of isotropic and anisotropic elastic flow for closed and open curves
- Algorithm 915, SuiteSparseQR
- Quadratically Regularized Optimal Transport on Graphs
- A second order virtual node method for elliptic problems with interfaces and irregular domains
- Solving large linear least squares problems with linear equality constraints
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- Fitted front tracking methods for two-phase incompressible Navier--Stokes flow: Eulerian and ALE finite element discretizations
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Algorithm 980
This page was built for software: SuiteSparseQR