نتایج جستجو برای: paired quasi linearization method pqlm

تعداد نتایج: 1742367  

2016
Sayyed Noorani

Underactuated biped robots control is one of the interesting topics in robotics. The main difficulties are its highly nonlinear dynamics, open-loop instability, and discrete event at the end of the gait. One of the methods to control underactuated systems is the partial feedback linearization, but it is not robust against uncertainties and disturbances that restrict its performance to control b...

The transient flow analyzing by the frequency domain method (FDM) is computationally much faster than the method of characteristic (MOC) in the time domain. FDM needs no discretization in time and space, but requires the linearization of governing equations and boundary conditions. Hence, the FDM is only valid for small perturbations in which the system’s hydraulics is almost linear. In this st...

Journal: :نظریه تقریب و کاربرد های آن 0
h. rouhparvar department of mathematics, college of technical and engineering, saveh branch, islamic azad university, saveh, iran

in this paper, the reduced di erential transform method is investigated fora nonlinear partial di erential equation modeling nematic liquid crystals, itis called the hunter-saxton equation. the main advantage of this methodis that it can be applied directly to nonlinear di erential equations withoutrequiring linearization, discretization, or perturbation. it is a semi analytical-numerical metho...

Journal: :journal of mathematical modeling 2013
mohammad reza yaghouti ali zabihi

in this paper, we apply the laplace decomposition method to obtain a series solutions of the burgers-huxley and burgers-fisher equations. the technique is based on the application of laplace transform to nonlinear partial differential equations. the method does not need linearization, weak nonlinearity assumptions or perturbation theory and the nonlinear terms can be easily handled by using the...

2017
Germán Andrés Delbianco Ilya Sergey Aleksandar Nanevski Anindya Banerjee

Arguments about correctness of a concurrent data structure are typically carried out by using the notion of linearizability and specifying the linearization points of the data structure’s procedures. Such arguments are often cumbersome as the linearization points’ position in time can be dynamic (depend on the interference, run-time values and events from the past, or even future), non-local (a...

Journal: :Modeling, Identification and Control: A Norwegian Research Bulletin 1998

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C 1994

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید