Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
From MaRDI portal
Publication:4643332
DOI10.1137/17M1137073zbMath1391.65061WikidataQ129808599 ScholiaQ129808599MaRDI QIDQ4643332
Publication date: 24 May 2018
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Approximate inversion of discrete Fourier integral operators ⋮ Overlapping Domain Decomposition Preconditioner for Integral Equations ⋮ Structured Matrix Approximations via Tensor Decompositions ⋮ A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling ⋮ Robust and Effective eSIF Preconditioning for General Dense SPD Matrices ⋮ Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices
Uses Software
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Constructing nested bases approximations from the entries of non-local operators
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Adaptive low-rank approximation of collocation matrices
- Introduction to hierarchical matrices with applications.
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- A fast block low-rank dense solver with applications to finite-element matrices
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- A robust inner-outer hierarchically semi-separable preconditioner
- Preconditioned Krylov Subspace Methods for Sampling Multivariate Gaussian Distributions
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Fast algorithms for hierarchically semiseparable matrices
- SMASH: Structured matrix approximation by separation and hierarchy
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- Stabilized rounded addition of hierarchical matrices
- Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
- A Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
- New Efficient and Robust HSS Cholesky Factorization of SPD Matrices
- Solving Boundary Integral Problems with BEM++
- A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Scalable Algorithms for Solving Dense Linear Systems with Hierarchically Semiseparable Structures
This page was built for publication: Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
