Exhaustive Search and Power-Based Gradient Descent Algorithms for Time-Delayed FIR Models

Complexity 2022:1-10 (2022)
  Copy   BIBTEX

Abstract

In this study, two modified gradient descent algorithms are proposed for time-delayed models. To estimate the parameters and time-delay simultaneously, a redundant rule method is introduced, which turns the time-delayed model into an augmented model. Then, two GD algorithms can be used to identify the time-delayed model. Compared with the traditional GD algorithms, these two modified GD algorithms have the following advantages: avoid a high-order matrix eigenvalue calculation, thus, are more efficient for large-scale systems; have faster convergence rates, therefore, are more practical in engineering practices. The convergence properties and simulation examples are presented to illustrate the efficiency of the two algorithms.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On logic of complex algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.

Analytics

Added to PP
2022-09-09

Downloads
9 (#1,187,161)

6 months
7 (#350,235)

Historical graph of downloads
How can I increase my downloads?