Presentation	2000/12/11 A study on a fast LRLS algorithm Satoru MITSUISHI, Eisuke HORITA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	In recent years, an LRLS algorithm which is highly accurate and stable in a more noisy environment than in LS one has been proposed. However, the computational complexity in the LRLS algorithm is on the order of n^3. In this report, a fast LRLS algorithm whose computational complexity is on the order of n^2 is considered. The fast LRLS algorithm consists of a method for the rank-one modification of the symmetric eigenproblem and an algorithm which updates an eigenvector on the order of n.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	adaptive signal processing / LRLS algorithm / eigenvalue decomposition / fast multipole method
Paper #	DSP2000-139
Date of Issue

Conference Information
Committee	DSP
Conference Date	2000/12/11(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Digital Signal Processing (DSP)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	A study on a fast LRLS algorithm
Sub Title (in English)
Keyword(1)	adaptive signal processing
Keyword(2)	LRLS algorithm
Keyword(3)	eigenvalue decomposition
Keyword(4)	fast multipole method
1st Author's Name	Satoru MITSUISHI
1st Author's Affiliation	Faculty of Engineering, Kanazawa University()
2nd Author's Name	Eisuke HORITA
2nd Author's Affiliation	Faculty of Engineering, Kanazawa University
Date	2000/12/11
Paper #	DSP2000-139
Volume (vol)	vol.100
Number (no)	515
Page	pp.pp.-
#Pages	8
Date of Issue