SearcharxivSearch

arXiv subjects

Shenghe Huang

Publications and source records attributed to Shenghe Huang.

2 recordsLinked to original sources

An Efficient Laguerre Minimum Action Method for Computing Quasi-Potentials

Minimum action methods provide a powerful framework for analyzing rare transitions in small-noise-driven dynamical systems, but their practical performance is often limited by time truncation and parameter sensitivity in infinite-horizon problems. In this paper, we develop an efficient Laguerre spectral minimum action method (LMAM) for computing quasi-potentials associated with fixed points of dynamical systems. Based on the large deviation framework, the method computes minimum action paths by formulating the problem on a semi-infinite time interval and discretize the temporal direction using Laguerre functions. An appropriate time rescaling strategy is proposed to enhance accuracy and convergence of the Laguerre spectral approximation. To efficiently handle nonlinear terms, we employ an improved procedure for evaluating Laguerre--Gauss--Radau quadrature, which enables stable and accurate double-precision computations with a large number of Laguerre modes. Precise numerical analysis for the linear problem and a local result for the nonlinear case are developed. Numerical experiments including both ordinary and partial differential equations (Allen-Cahn and Navier-Stokes) are presented to illustrate the accuracy and efficiency of the proposed method.

math.NA

Improved Laguerre Spectral Methods with Less Round-off Errors and Better Stability

Laguerre polynomials are orthogonal polynomials defined on positive half line with respect to weight $e^{-x}$. They have wide applications in scientific and engineering computations. However, the exponential growth of Laguerre polynomials of high degree makes it hard to apply them to complicated systems that need to use large numbers of Laguerre bases. In this paper, we introduce modified three-term recurrence formula to reduce the round-off error and to avoid overflow and underflow issues in generating generalized Laguerre polynomials and Laguerre functions. We apply the improved Laguerre methods to solve an elliptic equation defined on the half line. More than one thousand Laguerre bases are used in this application and meanwhile accuracy close to machine precision is achieved. The optimal scaling factor of Laguerre methods are studied and found to be independent of number of quadrature points in two cases that Laguerre methods have better convergence speeds than mapped Jacobi methods.

math.NA