vix.ing · top · new · best · stats · spec

A direct PinT algorithm for higher-order nonlinear time-evolution equations

2025/07/08 by Zhong, Shun-Zhi, Zhao, Yong-Liang, Shu, Qian-Yu
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2507.05743

Abstract

Higher-order nonlinear time-evolution equations have widespread applications in science and engineering, such as in solid mechanics, materials science, and fluid mechanics. This paper mainly studies a direct time-parallel algorithm for solving time-dependent differential equations of orders 1 to 3. Different from the traditional time-stepping approach, we directly solve the all-at-once system from higher-order evolution equations by diagonalization the time discretization matrix B. Based on the connection between the characteristic equation and Chebyshev polynomials, we give explicit formulas for the eigenvector matrix V of B and its inverse V-1. We prove that Cond2( V ) =O ( n3 ), where n is the number of time steps. A direct parallel-in-time algorithm is designed by exploring the structure of the spectral decomposition of B. Numerical experiments are provided to show the significant computational speedup of the proposed algorithm.

Citations

Related