Jian Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jian Chen has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Sirui Cheng
Department of Applied Mechanics and Engineering; Sun Yat-Sen University; Guangzhou 510275 People's Republic of China
2 shared publications- Zhongying Chen
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
2 shared publications - Chunwan Lv
School of Mathematics and Big Data, Foshan University, Foshan, People's Republic of China
1 shared publication - Fei Ma
Xinhu Futures Co. Ltd., 36F, InterContinental Bussiness Center, No.100 Yutong Rd, Shanghai 200070, PR China
1 shared publication - Fuxing Zhang
HNAC Technology Co., Ltd., No. 609 Lusong Road, Changsha 410205, China
1 shared publication Guoshun Huang
School of Mathematics and Big Data
1 shared publication
Latest Publications
- Open Access
- 2 March 2021
- Published by Wiley in Journal of Function Spaces
- Vol. 2021, 1-11
L 1 -Multiscale Galerkin’s Scheme with Multilevel Augmentation Algorithm for Solving Time Fractional Burgers’ Equation
In this paper, we consider the initial boundary value problem of the time fractional Burgers equation. A fully discrete scheme is proposed for the time fractional nonlinear Burgers equation with time discretized by -type formula and space discretized by the multiscale Galerkin method. The optimal convergence orders reach in the norm and in the norm, respectively, in which is the time step size, is the space step size, and is the order of piecewise polynomial space. Then, a fast multilevel augmentation method (MAM) is developed for solving the nonlinear algebraic equations resulting from the fully discrete scheme at each time step. We show that the MAM preserves the optimal convergence orders, and the computational cost is greatly reduced. Numerical experiments are presented to verify the theoretical analysis, and comparisons between MAM and Newton’s method show the efficiency of our algorithm.
- 2 March 2021
- Published by Wiley in Journal of Function Spaces
- Vol. 2021, 1-11
Open AccessL 1 -Multiscale Galerkin’s Scheme with Multilevel Augmentation Algorithm for Solving Time Fractional Burgers’ Equation
In this paper, we consider the initial boundary value problem of the time fractional Burgers equation. A fully discrete scheme is proposed for the time fractional nonlinear Burgers equation with time discretized by -type formula and space discretized by the multiscale Galerkin method. The optimal convergence orders reach in the norm and in the norm, respectively, in which is the time step size, is the space step size, and is the order of piecewise polynomial space. Then, a fast multilevel augmentation method (MAM) is developed for solving the nonlinear algebraic equations resulting from the fully discrete scheme at each time step. We show that the MAM preserves the optimal convergence orders, and the computational cost is greatly reduced. Numerical experiments are presented to verify the theoretical analysis, and comparisons between MAM and Newton’s method show the efficiency of our algorithm.
- Open Access
- 12 May 2020
- Published by Springer Nature in Boundary Value Problems
- Vol. 2020 (1) , 1-13
A fast multiscale Galerkin algorithm for solving boundary value problem of the fractional Bagley–Torvik equation
In this paper, a fast multiscale Galerkin algorithm is developed for solving the boundary value problem of the fractional Bagley–Torvik equation. For this purpose, we employ multiscale orthogonal functions having vanishing moments as the basis of the trial space, and we propose a truncation strategy for the coefficient matrix of the corresponding discrete system which leads to a fast algorithm. We show the algorithm has nearly linear computational complexity (up to a logarithmic factor). Numerical experiments are presented to illustrate the efficiency, accuracy and convergence of the proposed algorithm. Also, comparisons with some other existing methods are made to confirm the reliability of the algorithm
- 12 May 2020
- Published by Springer Nature in Boundary Value Problems
- Vol. 2020 (1) , 1-13
Open AccessA fast multiscale Galerkin algorithm for solving boundary value problem of the fractional Bagley–Torvik equation
In this paper, a fast multiscale Galerkin algorithm is developed for solving the boundary value problem of the fractional Bagley–Torvik equation. For this purpose, we employ multiscale orthogonal functions having vanishing moments as the basis of the trial space, and we propose a truncation strategy for the coefficient matrix of the corresponding discrete system which leads to a fast algorithm. We show the algorithm has nearly linear computational complexity (up to a logarithmic factor). Numerical experiments are presented to illustrate the efficiency, accuracy and convergence of the proposed algorithm. Also, comparisons with some other existing methods are made to confirm the reliability of the algorithm
- Open Access
A Distributed Demand Side Energy Management Algorithm for Smart Grid
This paper proposes a model predictive control (MPC) framework-based distributed demand side energy management method (denoted as DMPC) for users and utilities in a smart grid. The users are equipped with renewable energy resources (RESs), energy storage system (ESSs) and different types of smart loads. With the proposed method, each user finds an optimal operation routine in response to the varying electricity prices according to his/her own preference individually, for example, the power reduction of flexible loads, the start time of shift-able loads, the operation power of schedulable loads, and the charge/discharge routine of the ESSs. Moreover, in the method a penalty term is used to avoid large fluctuation of the user’s operation routines in two consecutive iteration steps. In addition, unlike traditional energy management methods which neglect the forecast errors, the proposed DMPC method can adapt the operation routine to newly updated data. The DMPC is compared with a frequently used method, namely, a day-ahead programming-based method (denoted as DDA). Simulation results demonstrate the efficiency and flexibility of the DMPC over the DDA method.
Open AccessA Distributed Demand Side Energy Management Algorithm for Smart Grid
This paper proposes a model predictive control (MPC) framework-based distributed demand side energy management method (denoted as DMPC) for users and utilities in a smart grid. The users are equipped with renewable energy resources (RESs), energy storage system (ESSs) and different types of smart loads. With the proposed method, each user finds an optimal operation routine in response to the varying electricity prices according to his/her own preference individually, for example, the power reduction of flexible loads, the start time of shift-able loads, the operation power of schedulable loads, and the charge/discharge routine of the ESSs. Moreover, in the method a penalty term is used to avoid large fluctuation of the user’s operation routines in two consecutive iteration steps. In addition, unlike traditional energy management methods which neglect the forecast errors, the proposed DMPC method can adapt the operation routine to newly updated data. The DMPC is compared with a frequently used method, namely, a day-ahead programming-based method (denoted as DDA). Simulation results demonstrate the efficiency and flexibility of the DMPC over the DDA method.
- Open Access
- 22 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
Output Regulation for a Class of MIMO Uncertain Stochastic Nonlinear Systems by Active Disturbance Rejection Control Approach
In this paper, the active disturbance rejection control (ADRC) approach is applied to a class of multi‐input multioutput (MIMO) uncertain stochastic nonlinear systems. An extended state observer (ESO) is first designed for estimation of both unmeasured states and stochastic total disturbance of each subsystem which represents the total effects of internal unmodeled stochastic dynamics and external stochastic disturbance with unknown statistical property. The ADRC controller based on the states of ESO is further designed to achieve the closed‐loop system’s output regulation performance including practical mean square reference signals tracking, disturbance attenuation, and practical mean square stability when the reference signals are zero avoiding solving any partial differential equations in the conventional output regulation theory. Some numerical simulations are presented to demonstrate the effectiveness of the proposed ADRC approach.
- 22 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
Open AccessOutput Regulation for a Class of MIMO Uncertain Stochastic Nonlinear Systems by Active Disturbance Rejection Control Approach
In this paper, the active disturbance rejection control (ADRC) approach is applied to a class of multi‐input multioutput (MIMO) uncertain stochastic nonlinear systems. An extended state observer (ESO) is first designed for estimation of both unmeasured states and stochastic total disturbance of each subsystem which represents the total effects of internal unmodeled stochastic dynamics and external stochastic disturbance with unknown statistical property. The ADRC controller based on the states of ESO is further designed to achieve the closed‐loop system’s output regulation performance including practical mean square reference signals tracking, disturbance attenuation, and practical mean square stability when the reference signals are zero avoiding solving any partial differential equations in the conventional output regulation theory. Some numerical simulations are presented to demonstrate the effectiveness of the proposed ADRC approach.
- Open Access
- 20 March 2016
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2016, 1-16
Optimal 25-Point Finite-Difference Subgridding Techniques for the 2D Helmholtz Equation
We present an optimal 25-point finite-difference subgridding scheme for solving the 2D Helmholtz equation with perfectly matched layer (PML). This scheme is second order in accuracy and pointwise consistent with the equation. Subgrids are used to discretize the computational domain, including the interior domain and the PML. For the transitional node in the interior domain, the finite difference equation is formulated with ghost nodes, and its weight parameters are chosen by a refined choice strategy based on minimizing the numerical dispersion. Numerical experiments are given to illustrate that the newly proposed schemes can produce highly accurate seismic modeling results with enhanced efficiency.
- 20 March 2016
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2016, 1-16
Open AccessOptimal 25-Point Finite-Difference Subgridding Techniques for the 2D Helmholtz Equation
We present an optimal 25-point finite-difference subgridding scheme for solving the 2D Helmholtz equation with perfectly matched layer (PML). This scheme is second order in accuracy and pointwise consistent with the equation. Subgrids are used to discretize the computational domain, including the interior domain and the PML. For the transitional node in the interior domain, the finite difference equation is formulated with ghost nodes, and its weight parameters are chosen by a refined choice strategy based on minimizing the numerical dispersion. Numerical experiments are given to illustrate that the newly proposed schemes can produce highly accurate seismic modeling results with enhanced efficiency.
- 16 February 2015
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 31 (5) , 1665-1691
Multilevel augmentation methods for solving the Burgers' equation
- 16 February 2015
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 31 (5) , 1665-1691
Multilevel augmentation methods for solving the Burgers' equation
- 1 January 2012
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 89 (1) , 80-89
Fast multilevel augmentation method for nonlinear integral equations
In this study, we extend the multilevel augmentation method for Hammerstein equations established in Chen et al. [Fast multilevel augmentation methods for solving Hammerstein equations, SIAM J. Numer. Anal. 47 (2009), pp. 2321–2346] to solve nonlinear Urysohn integral equations. Under certain differentiability assumptions on the kernel function, we show that the method enjoys the optimal convergence order and linear computational complexity. Finally, numerical experiments are presented to confirm the theoretical results and illustrate the efficiency of the method.
- 1 January 2012
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 89 (1) , 80-89
Fast multilevel augmentation method for nonlinear integral equations
In this study, we extend the multilevel augmentation method for Hammerstein equations established in Chen et al. [Fast multilevel augmentation methods for solving Hammerstein equations, SIAM J. Numer. Anal. 47 (2009), pp. 2321–2346] to solve nonlinear Urysohn integral equations. Under certain differentiability assumptions on the kernel function, we show that the method enjoys the optimal convergence order and linear computational complexity. Finally, numerical experiments are presented to confirm the theoretical results and illustrate the efficiency of the method.
- 30 June 2011
- Published by Elsevier in Neurocomputing
- Vol. 74 (12-13) , 2222-2227
A new scheme to learn a kernel in regularization networks
- 30 June 2011
- Published by Elsevier in Neurocomputing
- Vol. 74 (12-13) , 2222-2227
A new scheme to learn a kernel in regularization networks
- 8 October 2010
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 375 (2) , 706-724
Multilevel augmentation methods for solving the sine-Gordon equation
- 8 October 2010
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 375 (2) , 706-724
Multilevel augmentation methods for solving the sine-Gordon equation