Cited in
(56)- Weighted triangulations for geometry processing
- A fitted finite element method for the numerical approximation of void electro-stress migration
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Sparse approximations of fractional Matérn fields
- Deciding stability of sheaves on curves
- A least squares based finite volume method for the Cahn-Hilliard and Cahn-Hilliard-reaction equations
- Multiscale modeling using goal-oriented adaptivity and numerical homogenization. II: Algorithms for the Moore-Penrose pseudoinverse
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- A MATLAB-based frequency-domain finite difference package for solving 2D visco-acoustic wave equation
- Uniqueness of low-rank matrix completion by rigidity theory
- Hierarchical orthogonal factorization: sparse square matrices
- Hyperpriors for Matérn fields with applications in Bayesian inversion
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Solving large linear least squares problems with linear equality constraints
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Parametric approximation of isotropic and anisotropic elastic flow for closed and open curves
- OCVdM
- FLIPS
- QSHEP3D
- Algorithm 844
- SuiteSparse
- MIQR
- SuiteSparseQR
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- 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
- HSL_MA87
- El-Topo
- SYM-ILDL
- HSL_MA77
- CIMGS
- kappa_SQ
- Efficient and error minimized coupling procedures for unstructured and moving meshes
- The geometry of multivariate polynomial division and elimination
- Dipole excitation of surface plasmon on a conducting sheet: finite element approximation and validation
- Algorithm 980
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- A minimum Sobolev norm technique for the numerical discretization of PDEs
- Mongoose
- qr_mumps
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- Domain decomposition and parallel direct solvers as an adaptive multiscale strategy for damage simulation in quasi-brittle materials
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- HILUCSI
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
- A second order virtual node method for elliptic problems with interfaces and irregular domains
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- Fitted front tracking methods for two-phase ncompressible Navier-Stokes flow: Eulerian and ALE finite element discretizations
- A fast, spectrally accurate homotopy based numerical method for solving nonlinear differential equations
- Preconditioning linear least-squares problems by identifying a basis matrix
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Quadratically regularized optimal transport on graphs
- Approximate Generalized Inverses with Iterative Refinement for $\epsilon$-Accurate Preconditioning of Singular Systems
This page was built for software: SuitSparseQR
