Multiplication-free iterative algorithm for LS problem

Many iterative techniques are available to solve normal equations appearing in the linear least-squares problem. However, because of multiplications and divisions, they cannot be effectively implemented in real time. A novel multiplication-free and division-free iterative technique, the dichotomous...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics letters Jg. 40; H. 9; S. 1
Hauptverfasser: Zakharov, Y V, Tozer, T C
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Stevenage John Wiley & Sons, Inc 29.04.2004
Schlagworte:
Algorithms
Convergence
Descent
Division
Least squares method
Mathematical analysis
Multiplication
Real time
ISSN:0013-5194, 1350-911X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Many iterative techniques are available to solve normal equations appearing in the linear least-squares problem. However, because of multiplications and divisions, they cannot be effectively implemented in real time. A novel multiplication-free and division-free iterative technique, the dichotomous co-ordinate descent algorithm, which guarantees convergence to the true solution under realistic assumptions, is proposed.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0013-5194
1350-911X