DocumentCode
2712623
Title
Families of orthonormalization algorithms
Author
Hasan, Mohammed A.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Minnesota Duluth, Duluth, MN, USA
fYear
2009
fDate
14-19 June 2009
Firstpage
1122
Lastpage
1127
Abstract
In the development of adaptive systems in control theory and signal processing, it frequently occurs that the problem of orthonormalization must be addressed. This paper explored the underlying mathematical framework of developing orthonormalization methods that are free of computing matrix square roots. These algorithms are easily modified so that minor and principal component analysis methods are developed. The proposed methods have several important features: 1) higher order convergence can be achieved by choosing a specific stepsize, 2) the methods can be used to compute square root of positive definite matrices.
Keywords
convergence; matrix algebra; principal component analysis; adaptive systems; computing matrix square roots; control theory; higher order convergence; orthonormalization algorithms; positive definite matrices; principal component analysis methods; signal processing; Adaptive control; Adaptive systems; Lyapunov method; Matrix decomposition; Neural networks; Optimization methods; Polynomials; Programmable control; Signal processing algorithms; Vectors; Gram-Schmidt process; Lyapunov stability; global convergence; global stability; orthonormalization; unconstrained optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 2009. IJCNN 2009. International Joint Conference on
Conference_Location
Atlanta, GA
ISSN
1098-7576
Print_ISBN
978-1-4244-3548-7
Electronic_ISBN
1098-7576
Type
conf
DOI
10.1109/IJCNN.2009.5178956
Filename
5178956
Link To Document