Model reduction for the material point method via learning the
deformation map and its spatial-temporal gradients
- URL: http://arxiv.org/abs/2109.12390v1
- Date: Sat, 25 Sep 2021 15:45:14 GMT
- Title: Model reduction for the material point method via learning the
deformation map and its spatial-temporal gradients
- Authors: Peter Yichen Chen, Maurizio Chiaramonte, Eitan Grinspun, Kevin
Carlberg
- Abstract summary: The technique approximates the $textitkinematics$ by approximating the deformation map in a manner that restricts deformation trajectories to reside on a low-dimensional manifold.
The ability to generate material points also allows for adaptive quadrature rules for stress update.
- Score: 9.509644638212773
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This work proposes a model-reduction approach for the material point method
on nonlinear manifolds. The technique approximates the $\textit{kinematics}$ by
approximating the deformation map in a manner that restricts deformation
trajectories to reside on a low-dimensional manifold expressed from the
extrinsic view via a parameterization function. By explicitly approximating the
deformation map and its spatial-temporal gradients, the deformation gradient
and the velocity can be computed simply by differentiating the associated
parameterization function. Unlike classical model reduction techniques that
build a subspace for a finite number of degrees of freedom, the proposed method
approximates the entire deformation map with infinite degrees of freedom.
Therefore, the technique supports resolution changes in the reduced simulation,
attaining the challenging task of zero-shot super-resolution by generating
material points unseen in the training data. The ability to generate material
points also allows for adaptive quadrature rules for stress update. A family of
projection methods is devised to generate $\textit{dynamics}$, i.e., at every
time step, the methods perform three steps: (1) generate quadratures in the
full space from the reduced space, (2) compute position and velocity updates in
the full space, and (3) perform a least-squares projection of the updated
position and velocity onto the low-dimensional manifold and its tangent space.
Computational speedup is achieved via hyper-reduction, i.e., only a subset of
the original material points are needed for dynamics update. Large-scale
numerical examples with millions of material points illustrate the method's
ability to gain an order-of-magnitude computational-cost saving -- indeed
$\textit{real-time simulations}$ in some cases -- with negligible errors.
Related papers
- Diffeomorphic Mesh Deformation via Efficient Optimal Transport for Cortical Surface Reconstruction [40.73187749820041]
Mesh deformation plays a pivotal role in many 3D vision tasks including dynamic simulations, rendering, and reconstruction.
A prevalent approach in current deep learning is the set-based approach which measures the discrepancy between two surfaces by comparing two randomly sampled point-clouds from the two meshes with Chamfer pseudo-distance.
We propose a novel metric for learning mesh deformation, defined by sliced Wasserstein distance on meshes represented as probability measures that generalize the set-based approach.
arXiv Detail & Related papers (2023-05-27T19:10:19Z) - Automatic Parameterization for Aerodynamic Shape Optimization via Deep
Geometric Learning [60.69217130006758]
We propose two deep learning models that fully automate shape parameterization for aerodynamic shape optimization.
Both models are optimized to parameterize via deep geometric learning to embed human prior knowledge into learned geometric patterns.
We perform shape optimization experiments on 2D airfoils and discuss the applicable scenarios for the two models.
arXiv Detail & Related papers (2023-05-03T13:45:40Z) - IKOL: Inverse kinematics optimization layer for 3D human pose and shape
estimation via Gauss-Newton differentiation [44.00115413716392]
This paper presents an inverse kinematic layer (IKOL) for 3D human pose shape estimation.
IKOL has a much over over than most existing regression-based methods.
It provides a more accurate range of 3D human pose estimation.
arXiv Detail & Related papers (2023-02-02T12:43:29Z) - Gaussian process regression and conditional Karhunen-Lo\'{e}ve models
for data assimilation in inverse problems [68.8204255655161]
We present a model inversion algorithm, CKLEMAP, for data assimilation and parameter estimation in partial differential equation models.
The CKLEMAP method provides better scalability compared to the standard MAP method.
arXiv Detail & Related papers (2023-01-26T18:14:12Z) - {\phi}-SfT: Shape-from-Template with a Physics-Based Deformation Model [69.27632025495512]
Shape-from-Template (SfT) methods estimate 3D surface deformations from a single monocular RGB camera.
This paper proposes a new SfT approach explaining 2D observations through physical simulations.
arXiv Detail & Related papers (2022-03-22T17:59:57Z) - The Neural Network shifted-Proper Orthogonal Decomposition: a Machine
Learning Approach for Non-linear Reduction of Hyperbolic Equations [0.0]
In this work we approach the problem of automatically detecting the correct pre-processing transformation in a statistical learning framework.
The purely data-driven method allowed us to generalise the existing approaches of linear subspace manipulation to non-linear hyperbolic problems with unknown advection fields.
The proposed algorithm has been validated against simple test cases to benchmark its performances and later successfully applied to a multiphase simulation.
arXiv Detail & Related papers (2021-08-14T15:13:35Z) - Manifold learning-based polynomial chaos expansions for high-dimensional
surrogate models [0.0]
We introduce a manifold learning-based method for uncertainty quantification (UQ) in describing systems.
The proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.
arXiv Detail & Related papers (2021-07-21T00:24:15Z) - Data-Driven Shadowgraph Simulation of a 3D Object [50.591267188664666]
We are replacing the numerical code by a computationally cheaper projection based surrogate model.
The model is able to approximate the electric fields at a given time without computing all preceding electric fields as required by numerical methods.
This model has shown a good quality reconstruction in a problem of perturbation of data within a narrow range of simulation parameters and can be used for input data of large size.
arXiv Detail & Related papers (2021-06-01T08:46:04Z) - Deep Magnification-Flexible Upsampling over 3D Point Clouds [103.09504572409449]
We propose a novel end-to-end learning-based framework to generate dense point clouds.
We first formulate the problem explicitly, which boils down to determining the weights and high-order approximation errors.
Then, we design a lightweight neural network to adaptively learn unified and sorted weights as well as the high-order refinements.
arXiv Detail & Related papers (2020-11-25T14:00:18Z) - Fast Gravitational Approach for Rigid Point Set Registration with
Ordinary Differential Equations [79.71184760864507]
This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA)
In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field.
We show that the new method class has characteristics not found in previous alignment methods.
arXiv Detail & Related papers (2020-09-28T15:05:39Z) - Curvature Regularized Surface Reconstruction from Point Cloud [4.389913383268497]
We propose a variational functional and fast algorithms to reconstruct implicit surface from point cloud data with a curvature constraint.
The proposed method shows against noise, and recovers concave features and sharp corners better compared to models without curvature constraint.
arXiv Detail & Related papers (2020-01-22T05:34:40Z)
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.