SuitSparseQR
From MaRDI portal
Software:19619
swMATH7592MaRDI QIDQ19619FDOQ19619
Author name not available (Why is that?)
Cited In (39)
- 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
- A fast, spectrally accurate homotopy based numerical method for solving nonlinear differential equations
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
- A MATLAB-based frequency-domain finite-difference package for solving 2D visco-acoustic wave equation
- 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
- The Geometry of Multivariate Polynomial Division and Elimination
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- Multiscale modeling using goal-oriented adaptivity and numerical homogenization. II: Algorithms for the Moore-Penrose pseudoinverse
- Efficient and error minimized coupling procedures for unstructured and moving meshes
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- 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
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- Deciding stability of sheaves on curves
- 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
- A least squares based finite volume method for the Cahn-Hilliard and Cahn-Hilliard-reaction equations
- 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
- 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
- Sparse Approximations of Fractional Matérn Fields
- Solving large linear least squares problems with linear equality constraints
- 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
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
This page was built for software: SuitSparseQR