Pages that link to "Item:Q4902926"
From MaRDI portal
The following pages link to New Efficient and Robust HSS Cholesky Factorization of SPD Matrices (Q4902926):
Displaying 9 items.
- Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexity (Q92247) (← links)
- \(\mathcal {H}\)-matrix approximability of the inverses of FEM matrices (Q899715) (← links)
- An improved divide-and-conquer algorithm for the banded matrices with narrow bandwidths (Q2007234) (← links)
- \({\mathscr{H}} \)-matrix approximability of inverses of discretizations of the fractional Laplacian (Q2305555) (← links)
- A fast and stable algorithm for downdating the singular value decomposition (Q2363845) (← links)
- An inverse model and mathematical solution for inferring viscoelastic properties and dynamic deformations of heterogeneous structures (Q2414653) (← links)
- Fast structured LU factorization for nonsymmetric matrices (Q2450863) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems (Q6092276) (← links)
