Pages that link to "Item:Q3079777"
From MaRDI portal
The following pages link to Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices (Q3079777):
Displaying 31 items.
- An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures (Q724535) (← links)
- Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients (Q724571) (← links)
- Sum of Kronecker products representation and its Cholesky factorization for spatial covariance matrices from large grids (Q830501) (← links)
- Multi-core parallel robust structured multifrontal factorization method for large discretized PDEs (Q898930) (← links)
- An \(O(N)\) algorithm for computing expectation of \(N\)-dimensional truncated multi-variate normal distribution. II: computing moments and sparse grid acceleration (Q2095529) (← links)
- Single-pass randomized QLP decomposition for low-rank approximation (Q2107279) (← links)
- Approximate inversion of discrete Fourier integral operators (Q2133539) (← links)
- Randomized quaternion QLP decomposition for low-rank approximation (Q2162234) (← links)
- A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling (Q2222456) (← links)
- A fast and stable algorithm for downdating the singular value decomposition (Q2363845) (← links)
- Effective matrix-free preconditioning for the augmented immersed interface method (Q2374867) (← links)
- Fast structured LU factorization for nonsymmetric matrices (Q2450863) (← links)
- An Algebraic Multilevel Preconditioner with Low-Rank Corrections for Sparse Symmetric Matrices (Q2797101) (← links)
- On the Stability of Some Hierarchical Rank Structured Matrix Algorithms (Q2827062) (← links)
- A robust inner-outer hierarchically semi-separable preconditioner (Q2864487) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem (Q2955975) (← links)
- Schur complement-based domain decomposition preconditioners with low-rank corrections (Q2955978) (← links)
- Scalable Gaussian Process Computations Using Hierarchical Matrices (Q3391422) (← links)
- Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization (Q4588945) (← links)
- Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations (Q4643332) (← links)
- Low-Rank Factorizations in Data Sparse Hierarchical Algorithms for Preconditioning Symmetric Positive Definite Matrices (Q4644411) (← links)
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations (Q5113365) (← links)
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors (Q5147979) (← links)
- Robust and Effective eSIF Preconditioning for General Dense SPD Matrices (Q5161769) (← links)
- Subspace Iteration Randomization and Singular Value Problems (Q5254699) (← links)
- A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements (Q5282901) (← links)
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners (Q5348229) (← links)
- An efficient implementation of the ensemble Kalman filter based on an iterative Sherman-Morrison formula (Q5963729) (← links)
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations (Q6039243) (← links)
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems (Q6092276) (← links)
