Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 27 min ago
PreprintarXiv licencearXiv

Efficient localised model reduction for multiscale PDEs via Grassmannian interpolation

Abstract

Multiscale, parameter-dependent partial differential equations (PDEs) pose severe computational challenges due to strong coefficient heterogeneity and high-dimensional parameter spaces. We develop a geometric interpolation approach within the multiscale generalized finite element method (MS-GFEM) that targets the most expensive component: computing parameter-dependent optimal local approximation spaces. Leveraging the spatial localization of MS-GFEM and assuming local parameter dependence, we decompose the global problem into parametrically low-dimensional local subproblems. The optimal subspaces for each parameter are identified as points on a Grassmann manifold and approximated via Grassmann interpolation on sparse grids, which preserves the geometric structure of these spaces while efficiently handling high-dimensional parameter spaces. The resulting localized model reduction method inherits the nearly exponential spatial convergence of MS-GFEM and the parametric convergence rates of sparse grids. Numerical experiments for elliptic problems confirm the theoretical convergence results.

Related

  1. Online adaptive non-intrusive model reduction via manifold interpolation and subspace updates: application to FSI convergence acceleration
    Azzeddine Tiba, Florian de Vuyst, Iraj Mortazavi
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. A Smaller Subspace is All You Need: Efficient ISAC Beamforming via Dimensionality Reduction
    Ruiqi Liu, Yuanshuo Gang, Tianqi Mao +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  3. Efficient variance reduction for randomized Kaczmarz methods via residual-tracking control variates
    Jiaxin Xie, Hou-Duo Qi, Deren Han
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Dimension Reduction for the Trivariate Normal Product Distribution: An Efficient Numerical Algorithm via Conditional Expectation
    Davood Tofighi
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. D3MI: an efficient and powerful federated imputation method for bias reduction in the analysis of distributed incomplete data by accounting for within-site correlation and between-site heterogeneity.
    Yi Lian, Xiaoqian Jiang, Qi Long
    BMC medical informatics and decision makingPeer-reviewedCC BYFull textStatisticsEurope PMC
BibTeX
@misc{alber2026efficient,
  title = {{Efficient localised model reduction for multiscale PDEs via Grassmannian interpolation}},
  author = {Christian Alber and Markus Bachmayr and Robert Scheichl and Huqing Yang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.08657},
  eprint = {2610.08657},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.08657},
}
RIS
TY  - UNPB
TI  - Efficient localised model reduction for multiscale PDEs via Grassmannian interpolation
AU  - Christian Alber
AU  - Markus Bachmayr
AU  - Robert Scheichl
AU  - Huqing Yang
PY  - 2026
DA  - 2026/10/06
PB  - arXiv
DO  - 10.48550/arxiv.2610.08657
UR  - https://arxiv.org/abs/2610.08657
AB  - Multiscale, parameter-dependent partial differential equations (PDEs) pose severe computational challenges due to strong coefficient heterogeneity and high-dimensional parameter spaces. We develop a geometric interpolation approach within the multiscale generalized finite element method (MS-GFEM) that targets the most expensive component: computing parameter-dependent optimal local approximation spaces. Leveraging the spatial localization of MS-GFEM and assuming local parameter dependence, we decompose the global problem into parametrically low-dimensional local subproblems. The optimal subspaces for each parameter are identified as points on a Grassmann manifold and approximated via Grassmann interpolation on sparse grids, which preserves the geometric structure of these spaces while efficiently handling high-dimensional parameter spaces. The resulting localized model reduction method inherits the nearly exponential spatial convergence of MS-GFEM and the parametric convergence rates of sparse grids. Numerical experiments for elliptic problems confirm the theoretical convergence results.
ER  -