Metraipolis › archive › dc_69b7e8968067
Order elevation of directly self-starting sub-step implicit integrators for transient dynamics — arXiv:2609.10240
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10240
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:13:22.019Z
- SHA-256 of the archived text
969fb53516a5fbfaa09b68fdef93a907bc839b74050b664be718eed4b24865df- Stable URL of this page
https://metraipolis.com/documento/dc_69b7e8968067
How to cite
Order elevation of directly self-starting sub-step implicit integrators for transient dynamics — arXiv:2609.10240 — arXiv (en), https://arxiv.org/abs/2609.10240 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_69b7e8968067 (Metraipolis archive dc_69b7e8968067, sha256 969fb53516a5fbfaa09b68fdef93a907bc839b74050b664be718eed4b24865df)
BibTeX
@misc{dc69b7e8968067,
title = {Order elevation of directly self-starting sub-step implicit integrators for transient dynamics — arXiv:2609.10240},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10240},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_69b7e8968067; sha256 969fb53516a5fbfaa09b68fdef93a907bc839b74050b664be718eed4b24865df},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10240. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Directly self-starting implicit methods are attractive for transient analysis because they avoid auxiliary starting procedures while retaining the original first- or second-order governing equations. However, most existing formulations usually fix the last sub-step at the end of each time interval, which restricts the attainable order. This study develops a generalized $s$-sub-step implicit framework by releasing this constraint and treating all sub-step locations as design variables. The resulting methods admit a unified Runge--Kutta representation for both first- and second-order transient systems and preserve identical effective matrices over all sub-steps. Accuracy conditions are derived by simultaneously matching the numerical amplification factor and load operator, thereby accounting for both homogeneous and forced responses. For $s=1,~\cdots,~6$, two complementary families are obtained: $s$th-order members with user-controllable high-frequency numerical dissipation and adjustable sub-step locations, and $(s+1)$th-order members obtained by selecting the sub-step locations, with fixed dissipation. The latter reach up to seventh-order accuracy without increasing the number of sub-steps, although some high-order members are $A(\alpha)$-stable with stability angles extremely close to $90^\circ$. Analytical amplitude and phase errors further reveal parity-dependent superconvergence in undamped systems, and appropriate parameter selections can substantially increase either phase or amplitude accuracy beyond the formal order. Numerical benchmarks confirm the predicted convergence orders and the controllable suppression of spurious high-frequency responses. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.NA). Categorie arXiv: Numerical Analysis (math.NA) ; Computational Physics (physics.comp-ph). Pagina del lavoro: https://arxiv.org/abs/2609.10240 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T08:46:35.708Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).