SPECTRAL AND PSEUDOSPECTRAL APPROXIMATIONS IN TIME FOR PARABOLIC EQUATIONS

In this paper, spectral and pseudospectral methods are applied to both time and space variables for parabolic equations. Spectral and pseudospectral schemes are given, and error estimates are obtained for approximate solutions.

SPECTRAL METHOD IN TIME FOR KdV EQUATIONS

This paper presents a fully spectral discretization method for solving KdV equations with periodic boundary conditions.Chebyshev pseudospectral approximation in the time direction and Fourier Galerkin approximation in the spatial direction.The expansion coefficients are determined by minimizing an object funictional.Rapid convergence of the method is proved.

Identification of Continuous-Time Hammerstein System with Nuclear Norm Convex Relaxation

The nuclear norm convex relaxation method is proposed to force the rank constraint in the identification of the continuous-time( CT) Hammerstein system. The CT Hammerstein system is composed of a linear time invariant( LTI) system and a static nonlinear function( the linear part is followed by the nonlinear part). The nonlinear function is approximated by the pseudospectral basis functions, which have a better performance than Hinge functions and Radial Basis functions. After the approximation on the nonlinear function, the CT Hammerstein system has been transformed into a multiple-input single-output( MISO) linear model system with the differential pre-filters. However, the coefficients of static nonlinearity and the numerators of the linear transfer function are coupled together to challenge the parameters identification of the Hammerstein system. This problem is solved by replacing the one-rank constraint of the regularization optimization with the nuclear norm convex relaxation. Finally, a numerical example is given to verify the accuracy and the efficiency of the method.

Direct trajectory optimization based on a mapped Chebyshev pseudospectral method

In view of generating optimal trajectories of Bolza problems, standard Chebyshev pseudospectral （PS） method makes the points＇ accumulation near the extremities and rarefaction of nodes close to the center of interval, which causes an ill-condition of differentiation matrix and an oscillation of the optimal solution. For improvement upon the difficulties, a mapped Chebyshev pseudospectral method is proposed. A conformal map is applied to Chebyshev points to move the points closer to equidistant nodes. Condition number and spectral radius of differentiation matrices from both methods are presented to show the improvement. Furthermore, the modification keeps the Chebyshev pseudospectral method＇s advantage, the spectral convergence rate. Based on three numerical examples, a comparison of the execution time, convergence and accuracy is presented among the standard Chebyshev pseudospectral method, other collocation methods and the proposed one. In one example, the error of results from mapped Chebyshev pseudospectral method is reduced to 5% of that from standard Chebyshev pseudospectral method.

CONVERGENCE OF SPECTRAL METHOD IN TIME FOR BURGERS' EQUATION

For solving Burgers' equation with periodic boundary conditions, this paper preseats a fully spectral discretisation method: Fourier Galerkin approximation in the spatial direction and Chebyshev pseudospectral approximation in the time direction. The expansion coefficients are determined by means of minimizing an object functional, and rapid convergence of the method is proved.