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

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2409.02860 (math)
[Submitted on 4 Sep 2024 ]

Title: Adaptive and frugal BDDC coarse spaces for virtual element discretizations of a Stokes problem with heterogeneous viscosity

Title: 自适应且经济的BDDC粗空间用于具有异质粘度的Stokes问题的虚拟元离散化

Authors:Tommaso Bevilacqua, Axel Klawonn, Martin Lanser
Abstract: The virtual element method (VEM) is a family of numerical methods to discretize partial differential equations on general polygonal or polyhedral computational grids. However, the resulting linear systems are often ill-conditioned and robust preconditioning techniques are necessary for an iterative solution. Here, a balancing domain decomposition by constraints (BDDC) preconditioner is considered. Techniques to enrich the coarse space of BDDC applied to a Stokes problem with heterogeneous viscosity are proposed. In this framework a comparison between two adaptive techniques and a computationally cheaper heuristic approach is carried out. Numerical results computed on a physically realistic model show that the latter approach in combination with the deluxe scaling is a promising alternative.
Abstract: 虚拟单元方法(VEM)是一类在一般多边形或多面体计算网格上离散偏微分方程的数值方法。 然而,得到的线性系统通常病态,为了迭代求解需要稳健的预处理技术。 这里考虑了一种基于约束的平衡域分解(BDDC)预处理器。 提出了用于具有异质粘度的斯托克斯问题的BDDC粗空间增强技术。 在此框架下,对两种自适应技术与一种计算成本更低的启发式方法进行了比较。 在物理上现实的模型上计算的数值结果表明,后者与豪华尺度结合是一种有前景的替代方案。
Subjects: Numerical Analysis (math.NA)
MSC classes: 65F08, 65N30, 65N55
Cite as: arXiv:2409.02860 [math.NA]
  (or arXiv:2409.02860v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2409.02860
arXiv-issued DOI via DataCite

Submission history

From: Axel Klawonn [view email]
[v1] Wed, 4 Sep 2024 16:40:02 UTC (709 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
math.NA
< prev   |   next >
new | recent | 2024-09
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号