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

Full description

Saved in:
Bibliographic Details
Published in:Electronics letters Vol. 40; no. 9; p. 1
Main Authors: Zakharov, Y V, Tozer, T C
Format: Journal Article
Language:English
Published: Stevenage John Wiley & Sons, Inc 29.04.2004
Subjects:
Algorithms
Convergence
Descent
Division
Least squares method
Mathematical analysis
Multiplication
Real time
ISSN:0013-5194, 1350-911X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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