nonlinear ode
Recently Published Documents


TOTAL DOCUMENTS

73
(FIVE YEARS 17)

H-INDEX

10
(FIVE YEARS 1)

2022 ◽  
Vol 13 (1) ◽  
pp. 149-168
Author(s):  
Haruki Tadano ◽  
Yoshihiko Susuki ◽  
Atsushi Ishigame

Author(s):  
C. Tayeh ◽  
G. Girault ◽  
Y. Guevel ◽  
J. M. Cadou
Keyword(s):  

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Abdallah Benabdallah ◽  
Mohsen Dlala

<p style='text-indent:20px;'>In this paper, we solve the problem of rapid exponential stabilization for coupled nonlinear ordinary differential equation (ODE) and <inline-formula><tex-math id="M2">\begin{document}$ 1-d $\end{document}</tex-math></inline-formula> unstable linear heat diffusion. The control acts at a boundary of the heat domain and the heat equation enters in the ODE by Dirichlet connection. We show that the infinite dimensional backstepping transformation introduced recently for stabilization of coupled linear ODE-PDE can deal with a nonlinear ODE and obtain a global stabilization result. Our result is innovative and no similar result can be found in the literature as it combines the three following factors, i) nonlinear term in the ODE subsystem, ii) unstable PDE subsystem and iii) mixed boundary condition. Not only this, the techniques used in this work can provide answers to fundamental questions, such as the stabilization of coupled systems where both subsystems may contain nonlinear terms.</p>


2020 ◽  
Vol 28 (4) ◽  
Author(s):  
Ee Soong Low ◽  
Pauline Ong

The problems that arise in multitudinous fields often involve solving complex nonlinear ordinary differential equations (ODE), and it remains challenging since the actual solutions to these problems are hard to obtain. In this regard, the solution strategy with the formulation of Fourier series expansion, calculus of variation and metaheuristic algorithm, was introduced to determine the approximate solution of the nonlinear ODE. The nonlinear ODE was formulated as an optimization problem, specifically, the moth-flame optimization (MFO) algorithm and flower pollination algorithm (FPA) were utilized to find the coefficients of the Fourier series. This paper aimed to determine the feasibility of the proposed method to solve the ODEs with different characteristics and compare the obtained results with other optimization algorithms. Moreover, the suitable number of terms (NT) of Fourier series were determined for different test problems for MFO and FPA. The quantitative analysis in terms of the generational distance (GD) metric demonstrated that the approximate solutions were reasonably accurate, with the low GD within the range of 1E-03 to 1E-05 for all test problems. The comparative analysis showed that the approximate performances of MFO and FPA were superior to or comparable with the genetic algorithm, particle swarm optimization and water cycle algorithm.


Sign in / Sign up

Export Citation Format

Share Document