Existence of stationary points for pseudo-linear regression identification algorithms

نویسندگان

  • Phillip A. Regalia
  • Mamadou Mboup
  • Mehdi Ashari
چکیده

The authors prove existence of a stable transfer function satisfying the nonlinear equations characterizing an asymptotic stationary point, in undermodeled cases, for a class of pseudo-linear regression algorithms, including Landau’s algorithm, the Feintuch algorithm, and (S)HARF. The proof applies to all degrees of undermodeling and assumes only that the input power spectral density function is bounded and nonzero for all frequencies and that the compensation filter is strictly minimum phase. Some connections to previous stability analyses for reduced-order identification in this algorithm class are brought out.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kinetic modeling of methylene blue adsorption onto acid-activated spent tea: A comparison between linear and non-linear regression analysis

The kinetic study of methylene blue (MB) adsorption using acid-activated spent tea (AAST) as an adsorbent from aqueous solution with the aim of comparing linear and non-linear regression analysis methods was performed at varying initial MB concentrations (10-100 mg/l). Hence, spent tea leaves, which were activated using concentrated sulfuric acid, were prepared. The physicochemical characterist...

متن کامل

Accuracy improvement of Best Scanline Search Algorithms for Object to Image Transformation of Linear Pushbroom Imagery

Unlike the frame type images, back-projection of ground points onto the 2D image space is not a straightforward process for the linear pushbroom imagery. In this type of images, best scanline search problem complicates image processing using Collinearity equation from computational point of view in order to achieve reliable exterior orientation parameters. In recent years, new best scanline sea...

متن کامل

Diagonal arguments and fixed points

‎A universal schema for diagonalization was popularized by N.S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fi...

متن کامل

On the Existence of Stationary Points for the Steiglitz–McBride Algorithm

Most convergence results for adaptive identification algorithms have been developed in sufficient order settings, involving an unknown system with known degree. Reduced-order settings, in which the degree of the unknown system is underestimated, are more common, but more difficult to analyze. Deducing stationary points in these cases typically involves solving nonlinear equations, hence the spa...

متن کامل

Algorithms for Linear Programming with Linear Complementarity Constraints

Linear programming with linear complementarity constraints (LPLCC) is an area of active research in Optimization, due to its many applications, algorithms, and theoretical existence results. In this paper, a number of formulations for important nonconvex optimization problems are first reviewed. The most relevant algorithms for computing a complementary feasible solution, a stationary point, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 1999