Efficient update of hierarchical matrices in the case of adaptive discretisation schemes.

MaRDI QIDQ3437697zbMATH OpenFDO

Authors Jelena Đokić

Publication date 9 May 2007

zbMATH Keywords

scientific computingintegral equationsboundary element methodhierarchical matricesnumerical algorithmscollocation\(\mathcal H\)-matrixRitz-Galerkin

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Numerical methods for integral equations (65R20) Boundary element methods for boundary value problems involving PDEs (65N38)

Recommendations

• Adaptive geometrically balanced clustering of \({\mathcal H}\)-matrices
• Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
• Introduction to hierarchical matrices with applications.
• An introduction to hierarchical matrices
• A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems

Cited in

(6)

• A technique for updating hierarchical skeletonization-based factorizations of integral operators
• Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates
• A fast direct solver for boundary value problems on locally perturbed geometries
• Convergence of adaptive 3D BEM for weakly singular integral equations based on isotropic mesh-refinement
• Hierarchical matrix arithmetic with accumulated updates
• Efficient solution of nonlinear elliptic problems using hierarchical matrices with Broyden updates

This page was built for publication: Efficient update of hierarchical matrices in the case of adaptive discretisation schemes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437697)