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:2404.03756

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2404.03756 (math)
[Submitted on 4 Apr 2024 ]

Title: Robust finite element solvers for distributed hyperbolic optimal control problems

Title: 分布式双曲最优控制问题的鲁棒有限元求解器

Authors:Ulrich Langer, Richard Löscher, Olaf Steinbach, Huidong Yang
Abstract: We propose, analyze, and test new robust iterative solvers for systems of linear algebraic equations arising from the space-time finite element discretization of reduced optimality systems defining the approximate solution of hyperbolic distributed, tracking-type optimal control problems with both the standard $L^2$ and the more general energy regularizations. In contrast to the usual time-stepping approach, we discretize the optimality system by space-time continuous piecewise-linear finite element basis functions which are defined on fully unstructured simplicial meshes. If we aim at the asymptotically best approximation of the given desired state $y_d$ by the computed finite element state $y_{\varrho h}$, then the optimal choice of the regularization parameter $\varrho$ is linked to the space-time finite element mesh-size $h$ by the relations $\varrho=h^4$ and $\varrho=h^2$ for the $L^2$ and the energy regularization, respectively. For this setting, we can construct robust (parallel) iterative solvers for the reduced finite element optimality systems. These results can be generalized to variable regularization parameters adapted to the local behavior of the mesh-size that can heavily change in the case of adaptive mesh refinements. The numerical results illustrate the theoretical findings firmly.
Abstract: 我们提出、分析并测试了新的鲁棒迭代求解器,用于求解由减少的最优性系统空间-时间有限元离散化产生的线性代数方程组,这些最优性系统定义了具有标准$L^2$和更一般的能量正则化的双曲分布式跟踪型最优控制问题的近似解。 与通常的时间步进方法不同,我们通过在完全非结构化单形网格上定义的空间-时间连续分段线性有限元基函数对最优性系统进行离散化。 如果我们旨在通过计算的有限元状态 $y_{\varrho h}$ 来得到给定期望状态 $y_d$ 的渐近最优逼近,那么正则化参数 $\varrho$ 的最佳选择通过关系式 $\varrho=h^4$ 和 $\varrho=h^2$ 分别与时空有限元网格尺寸 $h$ 相关联,分别针对 $L^2$ 和能量正则化。 对于这种设置,我们可以为约简的有限元最优系统构建鲁棒的(并行)迭代求解器。 这些结果可以推广到适应网格尺寸局部行为的可变正则化参数,在自适应网格细化的情况下,网格尺寸可能会发生剧烈变化。 数值结果牢固地说明了理论发现。
Subjects: Numerical Analysis (math.NA) ; Optimization and Control (math.OC)
MSC classes: 49J20, 49M05, 35L05, 65M60, 65M15, 65N22
Cite as: arXiv:2404.03756 [math.NA]
  (or arXiv:2404.03756v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2404.03756
arXiv-issued DOI via DataCite

Submission history

From: Huidong Yang Dr [view email]
[v1] Thu, 4 Apr 2024 18:58:28 UTC (106 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2024-04
Change to browse by:
cs
cs.NA
math
math.OC

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号