Machine Learning in Adaptive Domain Decomposition Methods---Predicting the Geometric Location of Constraints
From MaRDI portal
Publication:5208722
DOI10.1137/18M1205364zbMath1429.65065OpenAlexW2904048988MaRDI QIDQ5208722
Janine Weber, Axel Klawonn, Alexander Heinlein, Martin Lanser
Publication date: 10 January 2020
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1205364
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Learning and adaptive systems in artificial intelligence (68T05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10)
Related Items (12)
FROSch Preconditioners for Land Ice Simulations of Greenland and Antarctica ⋮ Surrogate convolutional neural network models for steady computational fluid dynamics simulations ⋮ Hybrid analysis and modeling, eclecticism, and multifidelity computing toward digital twin revolution ⋮ Combining machine learning and domain decomposition methods for the solution of partial differential equations—A review ⋮ On the use of graph centralities to compute generalized inverse of singular finite element operators: Applications to the analysis of floating substructures ⋮ A semi matrix-free twogrid preconditioner for the Helmholtz equation with near optimal shifts ⋮ AI‐enhanced iterative solvers for accelerating the solution of large‐scale parametrized systems ⋮ Learning adaptive coarse basis functions of FETI-DP ⋮ A frugal FETI-DP and BDDC coarse space for heterogeneous problems ⋮ Machine Learning in Adaptive FETI-DP: Reducing the Effort in Sampling ⋮ A multi-stage deep learning based algorithm for multiscale model reduction ⋮ Combining Machine Learning and Adaptive Coarse Spaces---A Hybrid Approach for Robust FETI-DP Methods in Three Dimensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of adaptive coarse spaces for iterative substructuring in two dimensions
- An adaptive choice of primal constraints for BDDC domain decomposition algorithms
- An algebraic theory for primal and dual substructuring methods by constraints
- Adaptive selection of face coarse degrees of freedom in the BDDC and the FETI-DP iterative substructuring methods
- Robust FETI-DP methods for heterogeneous three dimensional elasticity problems
- Multiscale coarse spaces for overlapping Schwarz methods based on the ACMS space in 2D
- Nonlinear BDDC methods with approximate solvers
- Adaptive FETI-DP and BDDC methods with a generalized transformation of basis for heterogeneous problems
- Adaptive BDDC in three dimensions
- Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems
- A unified framework for adaptive BDDC
- A frugal FETI-DP and BDDC coarse space for heterogeneous problems
- Analysis of a two-level Schwarz method with coarse spaces based on local Dirichlet-to-Neumann maps
- Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps
- FETI-DP: a dual-primal unified FETI method?part I: A faster alternative to the two-level FETI method
- Adaptive Coarse Spaces for FETI-DP in Three Dimensions
- Machine Learning Refined
- PCBDDC: A Class of Robust Dual-Primal Methods in PETSc
- Robust domain decomposition preconditioners for abstract symmetric positive definite bilinear forms
- Deflation, Projector Preconditioning, and Balancing in Iterative Substructuring Methods: Connections and New Results
- FETI-DP Methods with an Adaptive Coarse Space
- Automatic spectral coarse spaces for robust finite element tearing and interconnecting and balanced domain decomposition algorithms
- A Parallel Implementation of a Two-Level Overlapping Schwarz Method with Energy-Minimizing Coarse Space Based on Trilinos
- Adaptive Selection of Primal Constraints for Isogeometric BDDC Deluxe Preconditioners
- Domain Decomposition Preconditioners for Multiscale Flows in High-Contrast Media
- Domain Decomposition Preconditioners for Multiscale Flows in High Contrast Media: Reduced Dimension Coarse Spaces
- A Highly Scalable Implementation of Inexact Nonlinear FETI-DP Without Sparse Direct Solvers
- Domain Decomposition for Less Regular Subdomains: Overlapping Schwarz in Two Dimensions
- Dual-primal FETI methods for linear elasticity
- FETI-DP, BDDC, and block Cholesky methods
- Toward Extremely Scalable Nonlinear Domain Decomposition Methods for Elliptic Partial Differential Equations
- Multilevel Balancing Domain Decomposition at Extreme Scales
- A Family of Energy Minimizing Coarse Spaces for Overlapping Schwarz Preconditioners
- An Overlapping Schwarz Algorithm for Almost Incompressible Elasticity
- An Analysis of a FETI–DP Algorithm on Irregular Subdomains in the Plane
- A Preconditioner for Substructuring Based on Constrained Energy Minimization
- Dual-Primal FETI Methods for Three-Dimensional Elliptic Problems with Heterogeneous Coefficients
- Nonlinear FETI-DP and BDDC Methods: A Unified Framework and Parallel Results
- BDDC Algorithms with deluxe scaling and adaptive selection of primal constraints for Raviart-Thomas vector fields
- Improving the Parallel Performance of Overlapping Schwarz Methods by Using a Smaller Energy Minimizing Coarse Space
- Adaptive GDSW Coarse Spaces for Overlapping Schwarz Methods in Three Dimensions
- A BDDC Algorithm with Enriched Coarse Spaces for Two-Dimensional Elliptic Problems with Oscillatory and High Contrast Coefficients
- Adaptive Coarse Spaces for FETI-DP in Three Dimensions with Applications to Heterogeneous Diffusion Problems
- Convergence of a balancing domain decomposition by constraints and energy minimization
- Understanding Machine Learning
- Highly scalable parallel domain decomposition methods with an application to biomechanics
- On the convergence of a dual-primal substructuring method
This page was built for publication: Machine Learning in Adaptive Domain Decomposition Methods---Predicting the Geometric Location of Constraints
