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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronics letters Ročník 40; číslo 9; s. 1
Hlavní autoři: Zakharov, Y V, Tozer, T C
Médium: Journal Article
Jazyk:angličtina
Vydáno: Stevenage John Wiley & Sons, Inc 29.04.2004
Témata:
Algorithms
Convergence
Descent
Division
Least squares method
Mathematical analysis
Multiplication
Real time
ISSN:0013-5194, 1350-911X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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