SuitSparseQR

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
• 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
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
• 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
• Sparse approximations of fractional Matérn fields
• 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
• Preconditioning linear least-squares problems by identifying a basis matrix
• 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
• 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 915: SuiteSparseQR: multifrontal multithreaded rank-revealing sparse QR factorization
• Quadratically regularized optimal transport on graphs
• Weighted triangulations for geometry processing
• Deciding stability of sheaves on curves
• The geometry of multivariate polynomial division and elimination
• 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
• Uniqueness of low-rank matrix completion by rigidity theory
• 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
• A second order virtual node method for elliptic problems with interfaces and irregular domains
• A MATLAB-based frequency-domain finite difference package for solving 2D visco-acoustic wave equation
• Solving large linear least squares problems with linear equality constraints
• A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
• Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
• Hierarchical orthogonal factorization: sparse square matrices

This page was built for software: SuitSparseQR