swMATH7348MaRDI QIDQ19384FDOQ19384
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=2049670
Cited In (75)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- 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
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- Hyperpriors for Matérn fields with applications in Bayesian inversion
- A fitted finite element method for the numerical approximation of void electro-stress migration
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Elastic flow with junctions: variational approximation and applications to nonlinear splines
- Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
- Fine-grained multithreading for the multifrontal \(QR\) factorization of sparse matrices
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- Fitted front tracking methods for two-phase ncompressible Navier-Stokes flow: Eulerian and ALE finite element discretizations
- Efficient and error minimized coupling procedures for unstructured and moving meshes
- Preconditioning linear least-squares problems by identifying a basis matrix
- Algorithm 980: Sparse QR factorization on the GPU
- 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
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- Domain decomposition and parallel direct solvers as an adaptive multiscale strategy for damage simulation in quasi-brittle materials
- Algorithm 933
- Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
- Quadratically regularized optimal transport on graphs
- Weighted triangulations for geometry processing
- OCVdM
- Deciding stability of sheaves on curves
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- The geometry of multivariate polynomial division and elimination
- Algorithm 844
- CHOLMOD
- SuiteSparse
- Algorithm 853
- CALU
- MarPlex
- MIQR
- SuitSparseQR
- symamd
- SPQR_RANK
- HSL_MA97
- hwloc
- LSMR
- Algorithm 694
- HSL_MA87
- HSL_MI28
- El-Topo
- SYM-ILDL
- HSL_MA77
- CIMGS
- kappa_SQ
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- Algorithm 980
- HSL_MA86
- DIPimage
- STAMPS
- Mongoose
- qr_mumps
- TFMLAB
- TFM
- Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
- 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.
- Title not available (Why is that?)
- Parametric approximation of isotropic and anisotropic elastic flow for closed and open curves
- 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
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Hierarchical orthogonal factorization: sparse square matrices
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Geometric continuity constraints of automatically derived parametrisations in CAD-based shape optimisation
- HILUCSI
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
This page was built for software: SuiteSparseQR
