Pages that link to "Item:Q3519429"
From MaRDI portal
The following pages link to Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices (Q3519429):
Displayed 9 items.
- Block computation and representation of a sparse nullspace basis of a rectangular matrix (Q924318) (← links)
- Approximation of solution operators of elliptic partial differential equations by \({\mathcal H}\)- and \({\mathcal H}^2\)-matrices (Q967581) (← links)
- Finite element network approximation of conductivity in particle composites (Q1950447) (← links)
- Domain decomposition based \({\mathcal H}\)-LU preconditioning (Q2391123) (← links)
- Construction of a discrete divergence-free basis through orthogonal factorization in \({\mathcal{H}}\)-arithmetic (Q2471830) (← links)
- Efficient solution of nonlinear elliptic problems using hierarchical matrices with Broyden updates (Q2471831) (← links)
- Efficient linear solvers for incompressible flow simulations using Scott-Vogelius finite elements (Q2846180) (← links)
- On the purely algebraic data-sparse approximation of the inverse and the triangular factors of sparse matrices (Q2889373) (← links)
- ℋ︁-LU factorization in preconditioners for augmented Lagrangian and grad-div stabilized saddle point systems (Q2893549) (← links)