Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
From MaRDI portal
Publication:2989145
DOI10.1145/2049662.2049670zbMATH Open1365.65122OpenAlexW2053999255WikidataQ113310423 ScholiaQ113310423MaRDI QIDQ2989145FDOQ2989145
Authors: Timothy A. Davis 
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2049662.2049670
Recommendations
Cites Work
Cited In (49)
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Control of connectivity and rigidity in prismatic assemblies
- 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
- 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
- Optimization of random feature method in the high-precision regime
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Scalar fields in causal dynamical triangulations
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation
- A structure-preserving finite element method for the multi-phase Mullins-Sekerka problem with triple junctions
- Fitted front tracking methods for two-phase ncompressible Navier-Stokes flow: Eulerian and ALE finite element discretizations
- Sparse approximations of fractional Matérn fields
- 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
- 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
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- Formulation of non-local space-fractional plate model and validation for composite micro-plates
- 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
- Quadratically regularized optimal transport on graphs
- Weighted triangulations for geometry processing
- Deciding stability of sheaves on curves
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- The anomalous chiral Lagrangian at order \(p^8\)
- Efficient multi-modal fusion on supergraph for scalable image annotation
- 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
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- Dipole excitation of surface plasmon on a conducting sheet: finite element approximation and validation
- Parametric approximation of isotropic and anisotropic elastic flow for closed and open curves
- Solving subsurface flow toward wells in layered soils using hybrid method of fundamental solutions
- A second order virtual node method for elliptic problems with interfaces and irregular domains
- Solving large linear least squares problems with linear equality constraints
- Efficient Natural Gradient Descent Methods for Large-Scale PDE-Based Optimization Problems
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Hierarchical orthogonal factorization: sparse square matrices
- Thick-restarted joint Lanczos bidiagonalization for the GSVD
Uses Software
This page was built for publication: Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989145)
