Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
From MaRDI portal
Publication:4588945
DOI10.1137/17M1124152zbMath1386.15033OpenAlexW2766227949MaRDI QIDQ4588945
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
approximation errormultilevel schemeeffective preconditioningpreservation of positive definitenessscaling-and-compression strategystructured incomplete factorization
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Approximate inversion of discrete Fourier integral operators ⋮ A multigrid method for kernel functions acting on interacting structures with applications to biofluids ⋮ Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems ⋮ An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations ⋮ A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling ⋮ Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors ⋮ Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations ⋮ Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices ⋮ Robust and Effective eSIF Preconditioning for General Dense SPD Matrices ⋮ A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems ⋮ Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices ⋮ Convergence Analysis of Inexact Two-Grid Methods: A Theoretical Framework ⋮ Hierarchical Orthogonal Factorization: Sparse Square Matrices
Uses Software
Cites Work
- Unnamed Item
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- Numerical experiments on the condition number of the interpolation matrices for radial basis functions
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
- An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices
- Divide and Conquer Low-Rank Preconditioners for Symmetric Matrices
- Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- Schur complement-based domain decomposition preconditioners with low-rank corrections
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Fast algorithms for hierarchically semiseparable matrices
- Sweeping preconditioner for the Helmholtz equation: Hierarchical matrix representation
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- A robust incomplete Choleski-conjugate gradient algorithm
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- On the Perturbation of the Cholesky Factorization
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- A Method for Generating Infinite Positive Self-adjoint Test Matrices and Riesz Bases
- A robust incomplete factorization preconditioner for positive definite matrices
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
This page was built for publication: Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
