Linear and nonlinear system identification using separable least-squares (Q1306057): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SMI Toolbox / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification and rational \(L^ 2\) approximation: A gradient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fading memory and the problem of approximating nonlinear operators with Volterra series / rank
 
Normal rank
Property / cites work
 
Property / cites work: System identification using balanced parametrizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive algebra methods for the \(L_ 2\)-problem for stable linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlapping block-balanced canonical forms for various classes of linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overlapping Block-Balanced Canonical Forms and Parametrizations: The Stable SISO Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable projection method for solving separable nonlinear least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive control of Wiener type nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Separable Nonlinear Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covariance function tests used in system identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for \(L_ 2\) optimal model reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of the deterministic part of MIMO state space models given in innovations form from input-output data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace model identification Part 1. The output-error state-space model identification class of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace-based methods for the identification of linear time-invariant systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying MIMO Wiener systems using subspace model identification methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recusrsive prediction error identification using the nonlinear Wiener model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of recursive identification algorithms based on the nonlinear Wiener model / rank
 
Normal rank

Latest revision as of 08:20, 29 May 2024

scientific article
Language Label Description Also known as
English
Linear and nonlinear system identification using separable least-squares
scientific article

    Statements

    Linear and nonlinear system identification using separable least-squares (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2000
    0 references
    The idea of the separable least squares (SLS for short), introduced by \textit{G. H. Golub} and \textit{V. Pereyra} [SIAM J. Numer. Anal. 10, 413-432 (1973; Zbl 0258.65045)], is as follows. Suppose one has to determine the unknown vectors \(a\) and \(b\) that minimize the function \( J(a,b)=\|y-F(a)b\|\) where \(y\) is a known vector and \(F\) is a matrix function. Then, instead of minimizing \(J(a,b)\), minimize the functional: \( \widehat{J}(a)=\|y-F(a)F(a)^{\dagger }y\|\) (where \(()^{\dagger }\) denotes the pseudo-inverse) and then set \(b=F( \overline{a})^{\dagger }y\), where \(\overline{a}\) is the optimum value. The intuitive motivation stems obviously from the properties of the pseudo inverse. As recalled by the authors, the SLS method works for matrices with well behaved rank. But is there also any advantage (besides, obviously, the reduced number of parameters at the expense of a more complex function)? The authors prove that, if the error is negligible, then the method is better conditioned than the straight least squares method. The SLS technique is applicable for problems that can be parameterized separating the unknowns in two vectors \(a\) and \(b\) in such a way that the functional to be minimized has the form of \(J(a,b)\) above, provided the rank condition is satisfied and a good initial estimate is known (to achieve better conditioning). Under suitable conditions the authors work out parameterizations complying with these conditions for the identification of linear dynamic systems as well as for nonlinear dynamic systems of Wiener type. The latter consist of a series connection of a linear system and a static nonlinearity. They are known to provide good approximations for general classes of nonlinear systems. Numerical results are provided and two of the examples refer to industrial plants. Finally the authors give the reference for obtaining the software they used from the World Wide Web.
    0 references
    system identification
    0 references
    least squares
    0 references
    nonlinear system
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references