Application of a line implicit method to fully coupled system of equations for turbulent flow problems

For unstructured finite volume methods, we present a line implicit Runge–Kutta method applied as smoother in an agglomerated multigrid algorithm to significantly improve the reliability and convergence rate to approximate steady-state solutions of the Reynolds-averaged Navier–Stokes equations. To describe turbulence, we consider a one-equation Spalart–Allmaras turbulence model. The line implicit Runge–Kutta method extends a basic explicit Runge–Kutta method by a preconditioner given by an approximate derivative of the residual function. The approximate derivative is only constructed along predetermined lines which resolve anisotropies in the given grid. Therefore, the method is a canonical generalisation of point implicit methods. Numerical examples demonstrate the improvements of the line implicit Runge–Kutta when compared with explicit Runge–Kutta methods accelerated with local time stepping.     

WENO schemes applied to the quasi-relativistic Vlasov–Maxwell model for laser–plasma interaction

In this paper we focus on WENO-based methods for the simulation of the 1D Quasi-Relativistic Vlasov–Maxwell (QRVM) model used to describe how a laser wave interacts with and heats a plasma by penetrating into it. We propose several non-oscillatory methods based on either Runge–Kutta (explicit) or Time-Splitting (implicit) time discretizations. We then show preliminary numerical experiments.     

On Nash approximation of complex analytic sets in Runge domains

We prove that every complex analytic set X in a Runge domain Ω   can be approximated by Nash sets on any relatively compact subdomain _Ω0${\Omega }_0$ of Ω. Moreover, for every Nash subset Y of Ω   with Y⊂X$Y\subset X$, the approximating sets can be chosen so that they contain Y∩_Ω0$Y\cap {\Omega }_0$. As a consequence, we derive a necessary and sufficient condition for a complex analytic set X to admit a Nash approximation which coincides with X along its arbitrary given subset.     

Stability analysis and classification of Runge–Kutta methods for index 1 stochastic differential-algebraic equations with scalar noise

The problem of solving stochastic differential-algebraic equations (SDAEs) of index 1 with a scalar driving Wiener process is considered. Recently, the authors have proposed a class of stiffly accurate stochastic Runge–Kutta (SRK) methods that do not involve any pseudo-inverses or projectors for the numerical solution of the problem. Based on this class of approximation methods, classifications for the coefficients of stiffly accurate SRK methods attaining strong order 0.5 as well as strong order 1.0 are calculated. Further, the mean-square stability of the considered class of SRK methods is analyzed. As the main result, families of A-stable efficient order 0.5 and 1.0 stiffly accurate SRK methods with a minimal number of stages for SDEs as well as for SDAEs are presented.     

Stationary Probability Distribution of Colored-noise Saturation Model for a Single-mode Dye Laser

It is applied the interpolation procedure to calculate the stationary probability distribution of colored-gain-noise model of a single-mode dye laser which operates above threshold with correlation time τ covering a very wide rang. By use of Stochastic Runge-Kutta Algorithm, it also has carried out numerical simulations of the steady-state properties. Comparing the results of the interpolation procedure and the unified colored-noise approximation with simulation results, the agreement between the results of the interpolation procedure and simulation results is much better than that of the unified colored-noise approximation when correlation time τ covers range from moderate to large.     

High‐order finite difference schemes for numerical solutions of the generalized Burgers–Huxley equation

In this article, up to tenth‐order finite difference schemes are proposed to solve the generalized Burgers–Huxley equation. The schemes based on high‐order differences are presented using Taylor series expansion. To establish the numerical solutions of the corresponding equation, the high‐order schemes in space and a fourth‐order Runge‐Kutta scheme in time have been combined. Numerical experiments have been conducted to demonstrate the high‐order accuracy of the current algorithms with relatively minimal computational effort. The results showed that use of the present approaches in the simulation is very applicable for the solution of the generalized Burgers–Huxley equation. The current results are also seen to be more accurate than some results given in the literature. The proposed algorithms are seen to be very good alternatives to existing approaches for such physical applications. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1313‐1326, 2011     

New fifth‐order two‐derivative Runge‐Kutta methods with constant and frequency‐dependent coefficients

Two‐derivative Runge‐Kutta methods are Runge‐Kutta methods for problems of the form y′ = f(y) that include the second derivative y′′ = g(y) = f ′(y)f(y) and were developed in the work of Chan and Tsai. In this work, we consider explicit methods and construct a family of fifth‐order methods with three stages of the general case that use several evaluations of f and g per step. For problems with oscillatory solution and in the case that a good estimate of the dominant frequency is known, methods with frequency‐dependent coefficients are used; there are several procedures for constructing such methods. We give the general framework for the construction of methods with variable coefficients following the approach of Simos. We modify the above family to derive methods with frequency‐dependent coefficients following this approach as well as the approach given by Vanden Berghe. We provide numerical results to demonstrate the efficiency of the new methods using three test problems.     

GRIN光学中光线追迹的一种新方法

由哈密顿光学中的拉格朗日方程推出光线方程，用Runge—Kutta方法求解光线方程，给出光线追迹的新方法。     

Rational approximation and universality for a quasilinear parabolic equation

Approximation theorems, analogous to results known for linear elliptic equations, are obtained for solutions of the heat equation. Via the Cole-Hopf transformation, this gives rise to approximation theorems for one of the simplest examples of a nonlinear partial differential equation, Burgers’ equation.     

Runge–Kutta Methods for Systems of Differential Equation with Piecewise Continuous Arguments: Convergence and Stability

This work deals with the convergence and stability of Runge–Kutta methods for systems of differential equation with piecewise continuous arguments x^′(t) = Px(t)+Qx([t+1∕2]) under two cases for coe?cient matrix. First, when P and Q are complex matrices, the su?cient condition under which the analytic solution is asymptotically stable is given. It is proven that the Runge–Kutta methods are convergent with order p. Moreover, the su?cient condition under which the analytical stability region is contained in the numerical stability region is obtained. Second, when P and Q are commutable Hermitian matrices, using the theory of characteristic, the necessary and su?cient conditions under which the analytic solution and the numerical solution are asymptotically stable are presented, respectively. Furthermore, whether the Runge–Kutta methods preserve the stability of analytic solution are investigated by the theory of Padé approximation and order star. To demonstrate the theoretical results, some numerical experiments are adopted.