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

Stable time-stepping via residual minimization: finite-element and neural-network approximations for transient parabolic problems

Abstract

We propose a time-stepping minimum-residual (MinRes) framework for transient coercive variational problems, applicable to finite-element and neural-network trial approximations. For the Backward Euler scheme, we measure the residual at each time level in the dual norm induced by the steady test-space norm, scaled by the time step. This choice yields stability estimates controlling a discrete parabolic energy quantity, up to the time-discretization defect. We develop conforming and broken-test formulations and specialize the analysis to diffusion-advection-reaction problems. For finite-dimensional test spaces, we derive fully discrete reliability estimates by supplementing the computable discrete residual with a complementary contribution that accounts for residual components the test space does not resolve. We then extend the framework to neural-network trial classes and obtain computable residual decompositions for conforming and broken polynomial test spaces. Numerical experiments confirm the expected finite-element convergence rates, examine the effect of test-space refinement for a global space-time neural approximation, and demonstrate residual-driven spatial refinement for a transient problem with a moving localized feature.

Related

  1. Deep Weighted Bellman Residual Minimization for Q* Estimation
    Lican Kang, Jerry Zhijian Yang, Cheng Yuan +1
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  2. Certified neural approximations for parabolic obstacle problems
    Davood Damircheli
    arXivPreprintarXiv licenceFull textAnalysis & PDEsNumerical analysis & scientific computingarXiv
  3. When does least-squares residual minimization solve a differential equation?
    Carlos Esteve-Yagüe, Richard Tsai, Stanley Osher
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Dynamic subscales and unconditional semi-discrete stability for non-residual VMS approximations of generalised Newtonian flows
    G. R. Barrenechea, E. Castillo, R. Codina +2
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Deep Stochastic Residual Methods for Fully Nonlinear Parabolic Equations
    Zhenhua Zhao, Jihao Long
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingOptimisation & controlarXiv
BibTeX
@misc{munozmatute2026stable,
  title = {{Stable time-stepping via residual minimization: finite-element and neural-network approximations for transient parabolic problems}},
  author = {Judit Muñoz-Matute and Sergio Rojas},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.27548},
  eprint = {2609.27548},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.27548},
}
RIS
TY  - UNPB
TI  - Stable time-stepping via residual minimization: finite-element and neural-network approximations for transient parabolic problems
AU  - Judit Muñoz-Matute
AU  - Sergio Rojas
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2609.27548
UR  - https://arxiv.org/abs/2609.27548
AB  - We propose a time-stepping minimum-residual (MinRes) framework for transient coercive variational problems, applicable to finite-element and neural-network trial approximations. For the Backward Euler scheme, we measure the residual at each time level in the dual norm induced by the steady test-space norm, scaled by the time step. This choice yields stability estimates controlling a discrete parabolic energy quantity, up to the time-discretization defect. We develop conforming and broken-test formulations and specialize the analysis to diffusion-advection-reaction problems. For finite-dimensional test spaces, we derive fully discrete reliability estimates by supplementing the computable discrete residual with a complementary contribution that accounts for residual components the test space does not resolve. We then extend the framework to neural-network trial classes and obtain computable residual decompositions for conforming and broken polynomial test spaces. Numerical experiments confirm the expected finite-element convergence rates, examine the effect of test-space refinement for a global space-time neural approximation, and demonstrate residual-driven spatial refinement for a transient problem with a moving localized feature.
ER  -