Topic

# Linearization

About: Linearization is a research topic. Over the lifetime, 20520 publications have been published within this topic receiving 383929 citations.

##### Papers published on a yearly basis

##### Papers

More filters

••

08 Nov 2004TL;DR: The motivation, development, use, and implications of the UT are reviewed, which show it to be more accurate, easier to implement, and uses the same order of calculations as linearization.

Abstract: The extended Kalman filter (EKF) is probably the most widely used estimation algorithm for nonlinear systems. However, more than 35 years of experience in the estimation community has shown that is difficult to implement, difficult to tune, and only reliable for systems that are almost linear on the time scale of the updates. Many of these difficulties arise from its use of linearization. To overcome this limitation, the unscented transformation (UT) was developed as a method to propagate mean and covariance information through nonlinear transformations. It is more accurate, easier to implement, and uses the same order of calculations as linearization. This paper reviews the motivation, development, use, and implications of the UT.

6,098 citations

•

12 May 1974

TL;DR: In this article, the structure theory of linear operators on finite-dimensional vector spaces has been studied and a self-contained treatment of that subject is given, along with a discussion of the relations between dynamical systems and certain fields outside pure mathematics.

Abstract: This book is about dynamical aspects of ordinary differential equations and the relations between dynamical systems and certain fields outside pure mathematics. A prominent role is played by the structure theory of linear operators on finite-dimensional vector spaces; the authors have included a self-contained treatment of that subject.

2,891 citations

••

TL;DR: In this paper, a variational iteration method for non-linear problems is proposed, where the problems are initially approximated with possible unknowns and a correction functional is constructed by a general Lagrange multiplier, which can be identified optimally via the variational theory.

Abstract: In this paper, a new kind of analytical technique for a non-linear problem called the variational iteration method is described and used to give approximate solutions for some well-known non-linear problems. In this method, the problems are initially approximated with possible unknowns. Then a correction functional is constructed by a general Lagrange multiplier, which can be identified optimally via the variational theory. Being different from the other non-linear analytical methods, such as perturbation methods, this method does not depend on small parameters, such that it can find wide application in non-linear problems without linearization or small perturbations. Comparison with Adomian’s decomposition method reveals that the approximate solutions obtained by the proposed method converge to its exact solution faster than those of Adomian’s method.

2,371 citations

•

01 Jan 1991TL;DR: In this paper, the Third Edition of the Third edition of Linear Systems: Local Theory and Nonlinear Systems: Global Theory (LTLT) is presented, along with an extended version of the second edition.

Abstract: Series Preface * Preface to the Third Edition * 1 Linear Systems * 2 Nonlinear Systems: Local Theory * 3 Nonlinear Systems: Global Theory * 4 Nonlinear Systems: Bifurcation Theory * References * Index

1,977 citations

••

TL;DR: This paper describes a linear matrix inequality (LMI)-based algorithm for the static and reduced-order output-feedback synthesis problems of nth-order linear time-invariant (LTI) systems with n/sub u/ and n/ sub y/) independent inputs (respectively, outputs).

Abstract: This paper describes a linear matrix inequality (LMI)-based algorithm for the static and reduced-order output-feedback synthesis problems of nth-order linear time-invariant (LTI) systems with n/sub u/ (respectively, n/sub y/) independent inputs (respectively, outputs). The algorithm is based on a "cone complementarity" formulation of the problem and is guaranteed to produce a stabilizing controller of order m/spl les/n-max(n/sub u/,n/sub y/), matching a generic stabilizability result of Davison and Chatterjee (1971). Extensive numerical experiments indicate that the algorithm finds a controller with order less than or equal to that predicted by Kimura's generic stabilizability result (m/spl les/n-n/sub u/-n/sub y/+1). A similar algorithm can be applied to a variety of control problems, including robust control synthesis.

1,933 citations