Algorithm 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
From MaRDI portal
Recommendations
Cites work
Cited in
(57)- Thick-restarted joint Lanczos bidiagonalization for the GSVD
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- A fast recursive orthogonalization scheme for the Macaulay matrix
- Control of connectivity and rigidity in prismatic assemblies
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- A fast, spectrally accurate homotopy based numerical method for solving nonlinear differential equations
- Cubic version of the least-squares collocation method and its application to plate bending analysis
- Approximate Generalized Inverses with Iterative Refinement for \epsilon-Accurate Preconditioning of Singular Systems
- Sparse linear least-squares problems
- Hyperpriors for Matérn fields with applications in Bayesian inversion
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- 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
- Optimization of random feature method in the high-precision regime
- 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
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Algorithm 980: Sparse QR factorization on the GPU
- A minimum Sobolev norm technique for the numerical discretization of PDEs
- 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
- 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
- Formulation of non-local space-fractional plate model and validation for composite micro-plates
- Quadratically regularized optimal transport on graphs
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- Weighted triangulations for geometry processing
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Deciding stability of sheaves on curves
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- A variational front-tracking method for multiphase flow with triple junctions
- The anomalous chiral Lagrangian at order \(p^8\)
- High-precision randomized preconditioned iterative methods for the random feature method
- A parametric finite element method for a degenerate multi-phase Stefan problem with triple junctions
- 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
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
- 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
- Meshless moment-free quadrature formulas arising from numerical differentiation
- Parametric approximation of isotropic and anisotropic elastic flow for closed and open curves
- Development and verification of the least-squares collocation method with seventh degree polynomials for the biharmonic equation
- Scalable computation of input-normal/output-diagonal balanced realization for control-affine polynomial systems
- A second order virtual node method for elliptic problems with interfaces and irregular domains
- Solving subsurface flow toward wells in layered soils using hybrid method of fundamental solutions
- 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
- A geometrical approach to finding multivariate approximate LCMs and GCDs
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- Hierarchical orthogonal factorization: sparse square matrices
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)
