2014
DOI: 10.1007/s11063-014-9360-y
|View full text |Cite
|
Sign up to set email alerts
|

Convergence Analysis of Möller Algorithm for Estimating Minor Component

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…When the DDT method is employed, the dynamic property of a weight vector can be obtained by projecting the weight vector onto all of the eigenvectors of the autocorrelation matrix and analyzing the changing laws of these projections. Compared with other methods, the DDT analysis method can retain the discrete nature and the dynamic properties of the algorithm [18] and thus has been favored by many investigators and extensively applied in many PCA or MCA algorithms [18]- [20]. Compared with PCA or MCA algorithms, the structure of dualpurpose algorithms is more complicated, and the difficulty in analysis increases correspondingly.…”
Section: Introductionmentioning
confidence: 99%
“…When the DDT method is employed, the dynamic property of a weight vector can be obtained by projecting the weight vector onto all of the eigenvectors of the autocorrelation matrix and analyzing the changing laws of these projections. Compared with other methods, the DDT analysis method can retain the discrete nature and the dynamic properties of the algorithm [18] and thus has been favored by many investigators and extensively applied in many PCA or MCA algorithms [18]- [20]. Compared with PCA or MCA algorithms, the structure of dualpurpose algorithms is more complicated, and the difficulty in analysis increases correspondingly.…”
Section: Introductionmentioning
confidence: 99%