2021
DOI: 10.3390/math9243250
|View full text |Cite
|
Sign up to set email alerts
|

Symmetrical Augmented System of Equations for the Parameter Identification of Discrete Fractional Systems by Generalized Total Least Squares

Abstract: This paper is devoted to the identification of the parameters of discrete fractional systems with errors in variables. Estimates of the parameters of such systems can be obtained using generalized total least squares (GTLS). A GTLS problem can be reduced to a total least squares (TLS) problem. A total least squares problem is often ill-conditioned. To solve a TLS problem, a classical algorithm based on finding the right singular vector or an algorithm based on an augmented system of equations with complex coef… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 42 publications
0
2
0
Order By: Relevance
“…Using feasible models for the optimization starting points reduce the possibility of local minima. The nonlinear least squares method has been chosen due to its proven performance in data fitting operations [58]. Optimization constraints are imposed for the fractional orders to belong to the (0, 2) interval.…”
Section: B Identificationmentioning
confidence: 99%
“…Using feasible models for the optimization starting points reduce the possibility of local minima. The nonlinear least squares method has been chosen due to its proven performance in data fitting operations [58]. Optimization constraints are imposed for the fractional orders to belong to the (0, 2) interval.…”
Section: B Identificationmentioning
confidence: 99%
“…The classical algorithm for solving the total least squares problem based on SVD (singular value decomposition) [12]. The solution of the total least squares problem based on augmented systems is considered in [13,14]. To solve large-scale linear systems of equations or linear systems of equations with a sparse matrix, iterative algorithms for total least squares are used: the Newton method [15,16], Rayleigh iterations [17], Lanchotz iterations [18].…”
mentioning
confidence: 99%