Abstract
Identification algorithms based on the well-known linear least squares methods of<br/>gaussian elimination, Cholesky decomposition, classical Gram-Schmidt, modified<br/>Gram-Schmidt, Householder transformation, Givens method, and singular value<br/>decomposition are reviewed. The classical Gram-Schmidt, modified Gram-Schmidt,<br/>and Householder transformation algorithms are then extended to combine<br/>structure determination, or which terms to include in the model, and parameter<br/>estimation in a very simple and efficient manner for a class of multivariable<br/>discrete-time non-linear stochastic systems which are linear in the parameters.
Keywords
Affiliated Institutions
Related Publications
The Theory of Matrices
Volume 2: XI. Complex symmetric, skew-symmetric, and orthogonal matrices: 1. Some formulas for complex orthogonal and unitary matrices 2. Polar decomposition of a complex matrix...
A fast non-negativity-constrained least squares algorithm
In this paper a modification of the standard algorithm for non-negativity-constrained linear least squares regression is proposed. The algorithm is specifically designed for use...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 50
- Issue
- 5
- Pages
- 1873-1896
- Citations
- 1530
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1080/00207178908953472