Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
From MaRDI portal
Publication:4588945
DOI10.1137/17M1124152zbMATH Open1386.15033OpenAlexW2766227949MaRDI QIDQ4588945FDOQ4588945
Authors: Jianlin Xia, Zixing Xin 
Publication date: 6 November 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1124152
Recommendations
- scientific article; zbMATH DE number 663836
- A robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
- A robust incomplete factorization preconditioner for positive definite matrices
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
approximation errormultilevel schemeeffective preconditioningpreservation of positive definitenessscaling-and-compression strategystructured incomplete factorization
Cites Work
- Fast algorithms for hierarchically semiseparable matrices
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Numerical experiments on the condition number of the interpolation matrices for radial basis functions
- High quality preconditioning of a general symmetric positive definite matrix based on its \(U^T U + U^T R + R^T U\)-decomposition
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
- A robust incomplete factorization preconditioner for positive definite matrices
- A robust incomplete Choleski-conjugate gradient algorithm
- A Method for Generating Infinite Positive Self-adjoint Test Matrices and Riesz Bases
- On the complexity of some hierarchical structured matrix algorithms
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix
- Robust approximate inverse preconditioning for the conjugate gradient method
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- On the Perturbation of the Cholesky Factorization
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Schur complement-based domain decomposition preconditioners with low-rank corrections
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Divide and conquer low-rank preconditioners for symmetric matrices
- Conditioning analysis of incomplete Cholesky factorizations with orthogonal dropping
Cited In (15)
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices
- A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems
- A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling
- Approximate inversion of discrete Fourier integral operators
- Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
- Hierarchical Orthogonal Factorization: Sparse Square Matrices
- An Empirical Analysis of the Performance of Preconditioners for SPD Systems
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Convergence Analysis of Inexact Two-Grid Methods: A Theoretical Framework
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- A multigrid method for kernel functions acting on interacting structures with applications to biofluids
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
- A robust inner-outer hierarchically semi-separable preconditioner.
Uses Software
This page was built for publication: Effective and robust preconditioning of general SPD matrices via structured incomplete factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4588945)
