1. Efficient preconditioning ofhp-FEM matrix sequences with slowly-varying coefficients: An application to topology optimization
- Author
-
Jan S. Hesthaven, Rasmus E. Christiansen, and P. Gatto
- Subjects
Preconditioner ,Nested dissection ,Mechanical Engineering ,Topology optimization ,MathematicsofComputing_NUMERICALANALYSIS ,Computational Mechanics ,General Physics and Astronomy ,hp-FEM ,Context (language use) ,010103 numerical & computational mathematics ,Interpolative decomposition ,01 natural sciences ,Finite element method ,Mathematics::Numerical Analysis ,Computer Science Applications ,010101 applied mathematics ,Matrix (mathematics) ,Mechanics of Materials ,ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION ,Applied mathematics ,0101 mathematics ,Algorithm ,Mathematics - Abstract
We previously introduced a preconditioner that has proven effective for h p -FEM discretizations of various challenging elliptic and hyperbolic problems. The construction is inspired by standard nested dissection, and relies on the assumption that the Schur complements can be approximated, to high precision, by Hierarchically-Semi-Separable matrices. The preconditioner is built as an approximate L D M t factorization through a divide-and-conquer approach. This implies an enhanced flexibility which allows to handle unstructured geometric meshes, anisotropies, and discontinuities. We build on our previous numerical experiments and develop a preconditioner-update strategy that allows us to handle matrix sequences arising from problems with slowly-varying coefficients. We investigate the performance of the preconditioner along with the update strategy in context of topology optimization of an acoustic cavity.
- Published
- 2017
- Full Text
- View/download PDF