Qiu Lin
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
Qiu Lin has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Jien Ma
Zhejiang University
2 shared publications - Ruisheng Qi
School of Mathematics and Statistics Northeastern University at Qinhuangdao Qinhuangdao China
2 shared publications - Bowen Xu
College of Biomedical Engineering and Instrument Science, Zhejiang University, Hangzhou, China
1 shared publication - Chao Luo
Zhejiang University,Department of Electrical Engineering,Hangzhou,China
1 shared publication Fang YouTong
Zhejiang University,Hangzhou,China
1 shared publicationGuo YuanLin
Zhejiang University,Hangzhou,China
1 shared publication
Latest Publications
- Open Access
Approximation Properties of a New (p,q)-Post-Widder Operator
We introduce a new -Post-Widder operator along with its modified form which preserves the test functions . This paper aims to investigate the approximation properties of the -Post-Widder operator while preserving . We estimate the convergence rate of the operators with the help of a continuity module and discuss their asymptotic behavior in terms of the weighted modulus of continuity. Also, our numerical results show that the new operator preserving provides the best approximation. In addition, we establish quantitative estimates of the difference between the two kinds of -Post-Widder operators. Finally, using numerical examples and graphs, we illustrate that, for particular cases, our results provide improved convergence estimates.Open AccessApproximation Properties of a New (p,q)-Post-Widder Operator
We introduce a new -Post-Widder operator along with its modified form which preserves the test functions . This paper aims to investigate the approximation properties of the -Post-Widder operator while preserving . We estimate the convergence rate of the operators with the help of a continuity module and discuss their asymptotic behavior in terms of the weighted modulus of continuity. Also, our numerical results show that the new operator preserving provides the best approximation. In addition, we establish quantitative estimates of the difference between the two kinds of -Post-Widder operators. Finally, using numerical examples and graphs, we illustrate that, for particular cases, our results provide improved convergence estimates. - Open Access
- 1 January 2024
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2024 (1)
Approximation by q‐Post‐Widder Operators Based on a New Parameter
The purpose of this paper is to introduce q‐Post–Widder operators based on a new parameter and study their approximation properties. The moments and central moments are investigated. And some local approximation properties of these operators by means of modulus of continuity and Peetre’s K‐functional are presented. Furthermore, the rate of convergence for these operators is obtained. Weighted approximation and the quantitative q‐Voronovskaja type theorem are discussed. Finally, numerical illustrative examples have been given to show the convergence of these newly defined operators.
- 1 January 2024
- Published by Wiley in Abstract and Applied Analysis
- Vol. 2024 (1)
Open AccessApproximation by q‐Post‐Widder Operators Based on a New Parameter
The purpose of this paper is to introduce q‐Post–Widder operators based on a new parameter and study their approximation properties. The moments and central moments are investigated. And some local approximation properties of these operators by means of modulus of continuity and Peetre’s K‐functional are presented. Furthermore, the rate of convergence for these operators is obtained. Weighted approximation and the quantitative q‐Voronovskaja type theorem are discussed. Finally, numerical illustrative examples have been given to show the convergence of these newly defined operators.
- Open Access
- 28 December 2023
- Published by MDPI AG in Mathematics
- Vol. 12 (1) , 112
Optimal Weak Order and Approximation of the Invariant Measure with a Fully-Discrete Euler Scheme for Semilinear Stochastic Parabolic Equations with Additive Noise
In this paper, we consider the ergodic semilinear stochastic partial differential equation driven by additive noise and the long-time behavior of its full discretization realized by a spectral Galerkin method in spatial direction and an Euler scheme in the temporal direction, which admits a unique invariant probability measure. Under the condition that the nonlinearity is once differentiable, the optimal convergence orders of the numerical invariant measures are obtained based on the time-independent weak error, but not relying on the associated Kolmogorov equation. More precisely, the obtained convergence orders are in space and in time, where from the assumption is used to characterize the spatial correlation of the noise process. Finally, numerical examples confirm the theoretical findings.- 28 December 2023
- Published by MDPI AG in Mathematics
- Vol. 12 (1) , 112
Open AccessOptimal Weak Order and Approximation of the Invariant Measure with a Fully-Discrete Euler Scheme for Semilinear Stochastic Parabolic Equations with Additive Noise
In this paper, we consider the ergodic semilinear stochastic partial differential equation driven by additive noise and the long-time behavior of its full discretization realized by a spectral Galerkin method in spatial direction and an Euler scheme in the temporal direction, which admits a unique invariant probability measure. Under the condition that the nonlinearity is once differentiable, the optimal convergence orders of the numerical invariant measures are obtained based on the time-independent weak error, but not relying on the associated Kolmogorov equation. More precisely, the obtained convergence orders are in space and in time, where from the assumption is used to characterize the spatial correlation of the noise process. Finally, numerical examples confirm the theoretical findings. - 28 July 2023
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 40 (1)
Strong convergence for an explicit fully‐discrete finite element approximation of the Cahn‐Hillard‐Cook equation with additive noise
In this paper, we consider an explicit fully‐discrete approximation of the Cahn–Hilliard–Cook (CHC) equation with additive noise, performed by a standard finite element method in space and a kind of nonlinearity‐tamed Euler scheme in time. The main result in this paper establishes strong convergence rates of the proposed scheme. The key ingredient in the proof of our main result is to employ uniform moment bounds for the numerical approximations. To the best of our knowledge, the main contribution of this work is the first result in the literature which establishes strong convergence for an explicit fully‐discrete finite element approximation of the CHC equation. Finally, numerical results are finally reported to confirm the previous theoretical findings.
- 28 July 2023
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 40 (1)
Strong convergence for an explicit fully‐discrete finite element approximation of the Cahn‐Hillard‐Cook equation with additive noise
In this paper, we consider an explicit fully‐discrete approximation of the Cahn–Hilliard–Cook (CHC) equation with additive noise, performed by a standard finite element method in space and a kind of nonlinearity‐tamed Euler scheme in time. The main result in this paper establishes strong convergence rates of the proposed scheme. The key ingredient in the proof of our main result is to employ uniform moment bounds for the numerical approximations. To the best of our knowledge, the main contribution of this work is the first result in the literature which establishes strong convergence for an explicit fully‐discrete finite element approximation of the CHC equation. Finally, numerical results are finally reported to confirm the previous theoretical findings.
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Study on the Effect of Composite Sleeve on Rotor Loss of High-Speed PM BLDC
High-speed permanent magnet brushless dc (PM BLDC) motors rotor is typically protected with a nonmagnetic retaining sleeve. In this paper, a composite sleeve structure with an inner layer of titanium alloy and an outer layer of carbon fiber is designed. It is mechanically robust and present low eddy current loss with the new sleeve. In addition, eddy current loss and torque might be significant in the rotor of a PM BLDC motor and are comparatively analyzed by modifying the thickness of both materials of the new sleeve. After that, to address the problem of increased eddy current losses in PM due to the new sleeve, a composite sleeve with copper shielding is investigated. For the composite sleeve with a copper shield, the effects of the copper shield’s positions and thickness on the rotor losses are studied. Finally, the range of preferred composite sleeve structures is summarized.
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Study on the Effect of Composite Sleeve on Rotor Loss of High-Speed PM BLDC
High-speed permanent magnet brushless dc (PM BLDC) motors rotor is typically protected with a nonmagnetic retaining sleeve. In this paper, a composite sleeve structure with an inner layer of titanium alloy and an outer layer of carbon fiber is designed. It is mechanically robust and present low eddy current loss with the new sleeve. In addition, eddy current loss and torque might be significant in the rotor of a PM BLDC motor and are comparatively analyzed by modifying the thickness of both materials of the new sleeve. After that, to address the problem of increased eddy current losses in PM due to the new sleeve, a composite sleeve with copper shielding is investigated. For the composite sleeve with a copper shield, the effects of the copper shield’s positions and thickness on the rotor losses are studied. Finally, the range of preferred composite sleeve structures is summarized.
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 325, 1-5
Multi-objective optimization of high-speed train running speed trajectory based on particle swarm and NSGA-II fusion algorithm
In this paper, the optimization method of single-segment velocity trajectory of high-speed train is studied. The optimization process is divided into two stages. Firstly, the energy consumption and travel time are used as the optimization criteria; then the section is divided into several subsections according to different speed constraints, and the optimal speed trajectory search strategy under different track characteristics is proposed. Secondly, talking the speed sequence corresponding to the transition point of the train running state in different sub-intervals as the decision variable, the model in this paper adopts a hybrid algorithm based on multi-objective particle swarm combined with NSGA-II (Non-dominated Sorting Genetic Algorithm-II) in order to obtain the Pareto frontier of the train velocity trajectory with the same satisfaction for all targets.
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 325, 1-5
Multi-objective optimization of high-speed train running speed trajectory based on particle swarm and NSGA-II fusion algorithm
In this paper, the optimization method of single-segment velocity trajectory of high-speed train is studied. The optimization process is divided into two stages. Firstly, the energy consumption and travel time are used as the optimization criteria; then the section is divided into several subsections according to different speed constraints, and the optimal speed trajectory search strategy under different track characteristics is proposed. Secondly, talking the speed sequence corresponding to the transition point of the train running state in different sub-intervals as the decision variable, the model in this paper adopts a hybrid algorithm based on multi-objective particle swarm combined with NSGA-II (Non-dominated Sorting Genetic Algorithm-II) in order to obtain the Pareto frontier of the train velocity trajectory with the same satisfaction for all targets.