A deformation-based framework for learning solution mappings of PDEs defined on varying domains

• URL: http://arxiv.org/abs/2412.01379v1
• Date: Mon, 02 Dec 2024 11:07:01 GMT
• Title: A deformation-based framework for learning solution mappings of PDEs defined on varying domains
• Authors: Shanshan Xiao, Pengzhan Jin, Yifa Tang,
• Abstract summary: We establish a deformation-based framework for learning solution mappings of PDEs defined on varying domains.<n>We point out that such a metric-to-Banach mapping can be learned by neural networks, hence the solution mapping is accordingly learned.
• Score: 2.048226951354646
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we establish a deformation-based framework for learning solution mappings of PDEs defined on varying domains. The union of functions defined on varying domains can be identified as a metric space according to the deformation, then the solution mapping is regarded as a continuous metric-to-metric mapping, and subsequently can be represented by another continuous metric-to-Banach mapping using two different strategies, referred to as the D2D framework and the D2E framework, respectively. We point out that such a metric-to-Banach mapping can be learned by neural networks, hence the solution mapping is accordingly learned. With this framework, a rigorous convergence analysis is built for the problem of learning solution mappings of PDEs on varying domains. As the theoretical framework holds based on several pivotal assumptions which need to be verified for a given specific problem, we study the star domains as a typical example, and other situations could be similarly verified. There are three important features of this framework: (1) The domains under consideration are not required to be diffeomorphic, therefore a wide range of regions can be covered by one model provided they are homeomorphic. (2) The deformation mapping is unnecessary to be continuous, thus it can be flexibly established via combining a primary identity mapping and a local deformation mapping. This capability facilitates the resolution of large systems where only local parts of the geometry undergo change. (3) If a linearity-preserving neural operator such as MIONet is adopted, this framework still preserves the linearity of the surrogate solution mapping on its source term for linear PDEs, thus it can be applied to the hybrid iterative method. We finally present several numerical experiments to validate our theoretical results.

Related papers

• Symmetry group based domain decomposition to enhance physics-informed neural networks for solving partial differential equations [3.3360424430642848]
  We propose a symmetry group based domain decomposition strategy to enhance the PINN for solving the forward and inverse problems of the PDEs possessing a Lie symmetry group. For the forward problem, we first deploy the symmetry group to generate the dividing-lines having known solution information which can be adjusted flexibly. We then utilize the PINN and the symmetry-enhanced PINN methods to learn the solutions in each sub-domain and finally stitch them to the overall solution of PDEs.
  arXiv  Detail & Related papers  (2024-04-29T09:27:17Z)
• Learning solution operators of PDEs defined on varying domains via MIONet [2.048226951354646]
  We first extend the approximation theory of MIONet to deal with metric spaces. We then construct a set consisting of some appropriate regions and provide a metric on this set thus make it a metric space. We are able to learn the solution mapping of a PDE with all the parameters varying.
  arXiv  Detail & Related papers  (2024-02-23T05:11:34Z)
• Neural PDE Solvers for Irregular Domains [25.673617202478606]
  We present a framework to neurally solve partial differential equations over domains with irregularly shaped geometric boundaries. Our network takes in the shape of the domain as an input and is able to generalize to novel (unseen) irregular domains.
  arXiv  Detail & Related papers  (2022-11-07T00:00:30Z)
• Unsupervised diffeomorphic cardiac image registration using parameterization of the deformation field [6.343400988017304]
  This study proposes an end-to-end unsupervised diffeomorphic deformable registration framework based on moving mesh parameterization. The effectiveness of the algorithm is investigated by evaluating the proposed method on three different data sets including 2D and 3D cardiac MRI scans.
  arXiv  Detail & Related papers  (2022-08-28T19:34:10Z)
• Measuring dissimilarity with diffeomorphism invariance [94.02751799024684]
  We introduce DID, a pairwise dissimilarity measure applicable to a wide range of data spaces. We prove that DID enjoys properties which make it relevant for theoretical study and practical use.
  arXiv  Detail & Related papers  (2022-02-11T13:51:30Z)
• Message Passing Neural PDE Solvers [60.77761603258397]
  We build a neural message passing solver, replacing allally designed components in the graph with backprop-optimized neural function approximators. We show that neural message passing solvers representationally contain some classical methods, such as finite differences, finite volumes, and WENO schemes. We validate our method on various fluid-like flow problems, demonstrating fast, stable, and accurate performance across different domain topologies, equation parameters, discretizations, etc., in 1D and 2D.
  arXiv  Detail & Related papers  (2022-02-07T17:47:46Z)
• Domain Composition and Attention for Unseen-Domain Generalizable Medical Image Segmentation [12.412110592754729]
  We propose a Domain Composition and Attention-based network (DCA-Net) to improve the ability of domain representation and generalization. First, we present a domain composition method that represents one certain domain by a linear combination of a set of basis representations. Second, a novel plug-and-play parallel domain is proposed to learn these basis representations. Third, a domain attention module is proposed to learn the linear combination coefficients of the basis representations.
  arXiv  Detail & Related papers  (2021-09-18T06:42:47Z)
• Improving Metric Dimensionality Reduction with Distributed Topology [68.8204255655161]
  DIPOLE is a dimensionality-reduction post-processing step that corrects an initial embedding by minimizing a loss functional with both a local, metric term and a global, topological term. We observe that DIPOLE outperforms popular methods like UMAP, t-SNE, and Isomap on a number of popular datasets.
  arXiv  Detail & Related papers  (2021-06-14T17:19:44Z)
• ResNet-LDDMM: Advancing the LDDMM Framework Using Deep Residual Networks [86.37110868126548]
  In this work, we make use of deep residual neural networks to solve the non-stationary ODE (flow equation) based on a Euler's discretization scheme. We illustrate these ideas on diverse registration problems of 3D shapes under complex topology-preserving transformations.
  arXiv  Detail & Related papers  (2021-02-16T04:07:13Z)
• Fork or Fail: Cycle-Consistent Training with Many-to-One Mappings [67.11712279612583]
  Cycle-consistent training is widely used for learning a forward and inverse mapping between two domains of interest. We develop a conditional variational autoencoder (CVAE) approach that can be viewed as converting surjective mappings to implicit bijections. Our pipeline can capture such many-to-one mappings during cycle training while promoting graph-to-text diversity.
  arXiv  Detail & Related papers  (2020-12-14T10:59:59Z)
• Neural Operator: Graph Kernel Network for Partial Differential Equations [57.90284928158383]
  This work is to generalize neural networks so that they can learn mappings between infinite-dimensional spaces (operators) We formulate approximation of the infinite-dimensional mapping by composing nonlinear activation functions and a class of integral operators. Experiments confirm that the proposed graph kernel network does have the desired properties and show competitive performance compared to the state of the art solvers.
  arXiv  Detail & Related papers  (2020-03-07T01:56:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.