Shulin Wu

Dr. Shulin Wu


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 June 2019 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
MGMartin J. Gander
Martin J. Gander
SWShulin Wu
Shulin Wu

6 April 2022 in Advances in Computational Mathematics
Verified
Journal Article
Closed access
PDF file
JLJun Liu
Jun Liu
XWXiang-Sheng Wang
Xiang-Sheng Wang
SWShulin Wu
Shulin Wu
TZTao Zhou
Tao Zhou

28 March 2017 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
SWShulin Wu
Shulin Wu
MAMohammad Al-Khaleel
Mohammad Al-Khaleel
The longitudinal waveform relaxation (WR) proposed by Gander and Ruehli converges faster than the classical WR method. For the former, a free parameter α is contained, which has a significant effect on the convergence rate. The optimization of this parameter is thus an important issue in practice. Here, we apply this new WR method to the fractional-order RC circuits, and optimize such a parameter at the continuous and discrete levels (this gives two parameters α opt c and α opt d ). We consider three simple but widely used convolution quadrature for discretization, based on the implicit-Euler method, the two-step backward difference formula, and the trapezoidal rule, and we derive the parameter α opt d for each quadrature. Interestingly, it is found that for the former two quadratures, the optimized parameter α opt d results in a much better convergence rate than α opt c , while for the quadrature based on the trapezoidal rule, α opt d and α opt c result in the same convergence rate.

1 July 2025 in Acta Numerica
Verified
Journal Article
Open access
PDF file
MGMartin J. Gander
Martin J. Gander
SWShulin Wu
Shulin Wu
TZTao Zhou
Tao Zhou
Time parallelization, also known as PinT (parallel-in-time), is a new research direction for the development of algorithms used for solving very large-scale evolution problems on highly parallel computing architectures. Despite the fact that interesting theoretical work on PinT appeared as early as 1964, it was not until 2004, when processor clock speeds reached their physical limit, that research in PinT took off. A distinctive characteristic of parallelization in time is that information flow only goes forward in time, meaning that time evolution processes seem necessarily to be sequential. Nevertheless, many algorithms have been developed for PinT computations over the past two decades, and they are often grouped into four basic classes according to how the techniques work and are used: shooting-type methods; waveform relaxation methods based on domain decomposition; multigrid methods in space–time; and direct time parallel methods. However, over the past few years, it has been recognized that highly successful PinT algorithms for parabolic problems struggle when applied to hyperbolic problems. We will therefore focus on this important aspect, first by providing a summary of the fundamental differences between parabolic and hyperbolic problems for time parallelization. We then group PinT algorithms into two basic groups. The first group contains four effective PinT techniques for hyperbolic problems: Schwarz waveform relaxation (SWR) with its relation to tent pitching; parallel integral deferred correction; ParaExp; and ParaDiag. While the methods in the first group also work well for parabolic problems, we then present PinT methods specifically designed for parabolic problems in the second group: Parareal; the parallel full approximation scheme in space–time (PFASST); multigrid reduction in time (MGRiT); and space–time multigrid (STMG). We complement our analysis with numerical illustrations using four time-dependent PDEs: the heat equation; the advection–diffusion equation; Burgers’ equation; and the second-order wave equation.

13 July 2024 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
CLCongcong Li
Congcong Li
XLXuelei Lin
Xuelei Lin
SHSean Hon
Sean Hon
SWShulin Wu
Shulin Wu

29 June 2024 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
XLXue-Lei Lin
Xue-Lei Lin
SWShulin Wu
Shulin Wu