Hierarchical orthogonal factorization: sparse least squares problems
From MaRDI portal
Publication:2147465
DOI10.1007/s10915-022-01824-9zbMath1492.65094arXiv2102.09878OpenAlexW3130355893WikidataQ114225571 ScholiaQ114225571MaRDI QIDQ2147465
Eric Darve, Abeynaya Gnanasekaran
Publication date: 20 June 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.09878
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Complexity and performance of numerical algorithms (65Y20) Orthogonalization in numerical linear algebra (65F25) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast direct solver for elliptic problems on general meshes in 2D
- On the QR decomposition of \({\mathcal {H}}\)-matrices
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Experimental study of ILU preconditioners for indefinite matrices
- Stability analysis of the method of seminormal equations for linear least squares problems
- Recursively preconditioned hierarchical interpolative factorization for elliptic partial differential equations
- Hierarchical interpolative factorization preconditioner for parabolic equations
- Numerical methods for solving linear least squares problems
- Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations
- Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
- The university of Florida sparse matrix collection
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
- Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- Hierarchical Orthogonal Factorization: Sparse Square Matrices
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Incomplete Methods for Solving $A^T Ax = b$
- Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- Nested Dissection of a Regular Finite Element Mesh
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
- Methods of conjugate gradients for solving linear systems
- A fast algorithm for particle simulations
