scispace - formally typeset
Open AccessJournal ArticleDOI

Orthogonal least squares methods and their application to non-linear system identification

Sheng Chen, +2 more
- 01 Nov 1989 - 
- Vol. 50, Iss: 5, pp 1873-1896
TLDR
Identification algorithms based on the well-known linear least squares methods of gaussian elimination, Cholesky decomposition, classical Gram-Schmidt, modified Gram- Schmidt, Householder transformation, Givens method, and singular value decomposition are reviewed.
Abstract
Identification algorithms based on the well-known linear least squares methods of gaussian elimination, Cholesky decomposition, classical Gram-Schmidt, modified Gram-Schmidt, Householder transformation, Givens method, and singular value decomposition are reviewed. The classical Gram-Schmidt, modified Gram-Schmidt, and Householder transformation algorithms are then extended to combine structure determination, or which terms to include in the model, and parameter estimation in a very simple and efficient manner for a class of multivariate discrete-time non-linear stochastic systems which are linear in the parameters.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

An improved differential evolution trained neural network scheme for nonlinear system identification

TL;DR: The identification results obtained through a series of simulation studies of these methods demonstrate that the proposed DE and LM trained NN approach to nonlinear system identification can yield better identification results in terms of time of convergence and less identification error.
Journal ArticleDOI

Offset-free multistep nonlinear model predictive control under plant-model mismatch

TL;DR: In this article, a multistep nonlinear model predictive control MPC framework is developed to achieve steady-state offset-free control in the presence of plant-model mismatch, where the output feedback error is expressed as the difference between the measured process output and the predicted model output at the previous sampling instance, in the multi-step model recursive prediction.
Journal ArticleDOI

Significant vector learning to construct sparse kernel regression models

TL;DR: The proposed regularized SV algorithm finds the significant vectors in a successive greedy process in which, compared to the classical OLS algorithm, the orthogonalization has been removed from the algorithm.
Proceedings ArticleDOI

Fractal video coding by matching pursuit

TL;DR: A rate-distortion optimized orthogonal matching pursuit algorithm is used to seamlessly combine motion compensation and fractal techniques into an efficient video coding algorithm.
Journal ArticleDOI

Sparse model identification using orthogonal forward regression with basis pursuit and D-optimality

TL;DR: In this paper, an efficient model identification algorithm for a large class of linear-in-the-parameters models is introduced that simultaneously optimises the model approximation ability, sparsity and robustness.
References
More filters
Book

Applied Regression Analysis

TL;DR: In this article, the Straight Line Case is used to fit a straight line by least squares, and the Durbin-Watson Test is used for checking the straight line fit.
Journal ArticleDOI

Singular value decomposition and least squares solutions

TL;DR: The decomposition of A is called the singular value decomposition (SVD) and the diagonal elements of ∑ are the non-negative square roots of the eigenvalues of A T A; they are called singular values.
Book

Linear regression analysis

TL;DR: In this paper, the authors take into serious consideration the further development of regression computer programs that are efficient, accurate, and considered an important part of statistical research, and provide up-to-date accounts of computational methods and algorithms currently in use without getting entrenched in minor computing details.
Journal ArticleDOI

Input-output parametric models for non-linear systems Part II: stochastic non-linear systems

TL;DR: Recursive input-output models for non-linear multivariate discrete-time systems are derived, and sufficient conditions for their existence are defined.