Reducing operator complexity of Galerkin coarse-grid operators with machine learning

DOI10.1137/23M1583533MaRDI QIDQ6623687zbMATH OpenFDO

Authors Ru Huang, Kai Chang, Huan He, Ruipeng Li, Yuanzhe Xi

Publication date 24 October 2024

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M1583533

zbMATH Keywords

machine learningmultigrid methodsneural networksoperator complexity

Mathematics Subject Classification ID

Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)

Cites work

• A new class of AMG interpolation methods based on matrix-matrix multiplications
• Algebraic multigrid based on element interpolation (AMGe)
• Black-box learning of multigrid parameters
• Bootstrap AMG
• Collocation coarse approximation in multigrid
• Compact high-order stencils with optimal accuracy for numerical solutions of 2-D time-independent elasticity equations
• scientific article; zbMATH DE number 3797122 (Why is no real title available?)
• Learning Optimal Multigrid Smoothers via Neural Networks
• Non-Galerkin coarse grids for algebraic multigrid
• Non-Galerkin multigrid based on sparsified smoothed aggregation
• Parallel performance of algebraic multigrid domain decomposition
• Reducing parallel communication in algebraic multigrid through sparsification

This page was built for publication: Reducing operator complexity of Galerkin coarse-grid operators with machine learning

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