EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Rational methods for abstract linear initial boundary value problems without order reduction

Carlos Arranz-Simón, Begoña Cano, César Palencia

Numerical Algorithms · 26.06.2026

DOI: 10.1007/s11075-026-02409-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Algorithms, online erschienen am 26.06.2026. Verfasst von Carlos Arranz-Simón und 2 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Universidad de Valladolid.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Given an $$\varvec{A}$$ A -stable rational approximation to $$\varvec{e}^{\varvec{z}}$$ e z of order $$\varvec{p}$$ p , numerical procedures are suggested to time integrate abstract, well-posed IBVPs, with time-dependent source term $$\varvec{f}$$ f and boundary value $$\varvec{g}$$ g . These procedures exhibit the optimal order $$\varvec{p}$$ p and can be implemented by using just one single evaluation of $$\varvec{f}$$ f and $$\varvec{g}$$ g per step, i.e., no evaluations of the derivatives of data are needed, and are of practical use at least for $$\varvec{p \le 6}$$ p ≤ 6 . The full discretization is also studied and the theoretical results are corroborated by numerical experiments.

Förderung

  • Universidad de Valladolid

Zitieren

APA

Arranz-Simón, C., Cano, B., & Palencia, C. (2026). Rational methods for abstract linear initial boundary value problems without order reduction. Numerical Algorithms. https://doi.org/10.1007/s11075-026-02409-5

Vancouver

Arranz-Simón C, Cano B, Palencia C. Rational methods for abstract linear initial boundary value problems without order reduction. Numerical Algorithms. 2026. doi:10.1007/s11075-026-02409-5

BibTeX
@article{ArranzSimn2026,
  author = {Arranz-Simón, Carlos and Cano, Begoña and Palencia, César},
  title = {Rational methods for abstract linear initial boundary value problems without order reduction},
  journal = {Numerical Algorithms},
  year = {2026},
  doi = {10.1007/s11075-026-02409-5}
}
Kostenlos starten →