Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2308.01773

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2308.01773 (math)
[Submitted on 3 Aug 2023 ]

Title: Registration-based model reduction of parameterized PDEs with spatio-parameter adaptivity

Title: 基于注册的参数化PDEs的时空自适应模型降阶方法

Authors:Nicolas Barral, Tommaso Taddei, Ishak Tifouti
Abstract: We propose an automated nonlinear model reduction and mesh adaptation framework for rapid and reliable solution of parameterized advection-dominated problems, with emphasis on compressible flows. The key features of our approach are threefold: (i) a metric-based mesh adaptation technique to generate an accurate mesh for a range of parameters, (ii) a general (i.e., independent of the underlying equations) registration procedure for the computation of a mapping $\Phi$ that tracks moving features of the solution field, and (iii) an hyper-reduced least-square Petrov-Galerkin reduced-order model for the rapid and reliable estimation of the mapped solution. We discuss a general paradigm -- which mimics the refinement loop considered in mesh adaptation -- to simultaneously construct the high-fidelity and the reduced-order approximations, and we discuss actionable strategies to accelerate the offline phase. We present extensive numerical investigations for a quasi-1D nozzle problem and for a two-dimensional inviscid flow past a Gaussian bump to display the many features of the methodology and to assess the performance for problems with discontinuous solutions.
Abstract: 我们提出了一种自动非线性模型降阶和网格自适应框架,用于快速可靠地求解参数化对流主导问题,重点在于可压缩流。 我们的方法的关键特性有三点:(i) 一种基于度量的网格自适应技术,用于为一系列参数生成精确的网格,(ii) 一种通用的(即与基础方程无关)配准过程,用于计算跟踪解场移动特征的映射$\Phi$,以及 (iii) 一种超降阶最小二乘 Petrov-Galerkin 降阶模型,用于快速可靠地估计映射后的解。 我们讨论了一个通用的范式——模仿网格自适应中考虑的细化循环——以同时构建高保真度和降阶近似,并讨论了加速离线阶段的操作策略。 我们针对一个准一维喷管问题和一个二维无粘流过高斯凸起的问题进行了广泛的数值研究,以展示该方法的诸多特性,并评估具有不连续解的问题的性能。
Subjects: Numerical Analysis (math.NA)
MSC classes: 65N30, 65N50, 41A45, 35L02, 90C26
Cite as: arXiv:2308.01773 [math.NA]
  (or arXiv:2308.01773v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2308.01773
arXiv-issued DOI via DataCite

Submission history

From: Tommaso Taddei [view email]
[v1] Thu, 3 Aug 2023 14:02:11 UTC (3,759 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2023-08
Change to browse by:
cs
cs.NA
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号