Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
From MaRDI portal
Recommendations
- An incomplete Cholesky factorization for dense symmetric positive definite matrices
- Full rank Cholesky factorization for rank deficient matrices
- Low rank approximation of the symmetric positive semidefinite matrix
- A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
- MODIFLED INCOMPLETE CHOLESKY FACTORIZATION PRECONDITIONERS FOR A SYMMETRIC POSITIVE DEFINITE MATRIX
- scientific article; zbMATH DE number 4135294
- On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- scientific article; zbMATH DE number 18873
- Robust incomplete factorization for nonsymmetric matrices
Cited in
(40)- An \(O(N)\) algorithm for computing expectation of \(N\)-dimensional truncated multi-variate normal distribution. II: computing moments and sparse grid acceleration
- Single-pass randomized QLP decomposition for low-rank approximation
- Approximate inversion of discrete Fourier integral operators
- Randomized quaternion QLP decomposition for low-rank approximation
- A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling
- On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
- A fast and stable algorithm for downdating the singular value decomposition
- Effective matrix-free preconditioning for the augmented immersed interface method
- Fast structured LU factorization for nonsymmetric matrices
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- On the stability of some hierarchical rank structured matrix algorithms
- A robust inner-outer hierarchically semi-separable preconditioner.
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem.
- Schur complement-based domain decomposition preconditioners with low-rank corrections.
- Scalable Gaussian Process Computations Using Hierarchical Matrices
- Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems
- New efficient and robust HSS Cholesky factorization of SPD matrices
- RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- Subspace Iteration Randomization and Singular Value Problems
- A direct elliptic solver based on hierarchically low-rank Schur complements
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
- Linear-Cost Covariance Functions for Gaussian Random Fields
- Sparse hierarchical solvers with guaranteed convergence
- Universal matrix sparsifiers and fast deterministic algorithms for linear algebra
- Fast measure modification of orthogonal polynomials via matrices with displacement or hierarchical off-diagonal low-rank structure
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
- Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients
- Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids
- Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs
This page was built for publication: Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079777)
