What is the right citation for the power iteration method to find eigenvalues, if I want to cite the method in a paper? I've seen some Google PageRank references in this context. But Brin and Page didn't invent the power iteration method, did they?
$\begingroup$
$\endgroup$
5
-
1$\begingroup$ Nobody expects you to be a historian. If the provenance isn't clear, why not just cite who you think is responsible, and include citations from other papers who mention the topic? Nobody is going to accuse you of not being thorough. $\endgroup$– Eric TresslerCommented Sep 11, 2010 at 16:33
-
12$\begingroup$ You could also just cite a well-known text book in the area that explains the method. I'm sure the power method is explained in many numerical linear algebra books, like Golub and Van Loan, for example. $\endgroup$– Robin KothariCommented Sep 11, 2010 at 16:44
-
2$\begingroup$ I've heard someone refer to it as Jacobi's method, so it may be very old. $\endgroup$– Felipe VolochCommented Sep 11, 2010 at 18:09
-
4$\begingroup$ It is probably more useful to your readers if you cite it in a standard textbook or two, rather than the original paper of Jacobi (or whatever). $\endgroup$– Gerald EdgarCommented Sep 12, 2010 at 1:45
-
2$\begingroup$ I had to cite it in a paper recently (well, orthogonal iteration in fact), and I went for Golub-Van Loan, too. If I were a reader that does not know the power method, I'd rather see a reference to a standard textbook than to a 1910 paper in German. $\endgroup$– Federico PoloniCommented Nov 5, 2010 at 8:38
Add a comment
|
3 Answers
$\begingroup$
$\endgroup$
Several researchers indicate that the power iteration method dates back to Herman Müntz. According to the survey aricle "Eigenvalue computation in the 20th century" by Golub and van der Vorst,
Householder called this Simple Iteration, and attributed the first treatment of it to Müntz (1913). Bodewig attributes the power method to von Mises, and acknowledges Müntz for computing approximate eigenvalues from quotients of minors of the explicitly computed matrix $A^k$ , for increasing values of $k$.
Ortiz and Pinkus also mention in "Herman Müntz: A Mathematician’s Odyssey" that
In 1913 he published two notes in Comptes Rendus in connection with the use of iterative techniques for the solutions of algebraic equations. It is very possible that Müntz was the first to develop an iterative procedure for the determination of the smallest eigenvalue of a positive definite matrix. It certainly predates the more generally quoted result of R. von Mises of 1929.
Müntz's real innovation in the first one of his 1913 papers is the method of simultaneous or orthogonal iteration: "Qu'on parte des n directions consecutives ...; en orthogonalisant et en normant, d'apres les notations connues de M. Schmidt, les determinants, on obtiendra convergence ... vers les axes principaux, en general toutes les n."
The relevant papers by Müntz:
- Solution directe de l’équation séculaire et de quelques problèmes analogues transcendants, C. R. Acad. Sci. Paris, 156 (1913), 43-46.
http://gallica.bnf.fr/ark:/12148/bpt6k3109m/f43.image.langFR
- Sur la solution des équations séculaires et des équations intégrales, C. R. Acad. Sci. Paris, 156 (1913), 860-862.
http://gallica.bnf.fr/ark:/12148/bpt6k3109m/f860.image.langFR
answered Nov 5, 2010 at 2:19
$\begingroup$
$\endgroup$
In his Ph.D. thesis Erhard Schmidt proved the existence of an eigenfunction of a symmetric integral operator by using iterated kernels, the equivalent of matrix powers in a function space. In order to avoid convergence problems in the case of eigenvalues of equal modulus, he did not apply the integral operator directly to a function.
https://gdz.sub.uni-goettingen.de/id/PPN235181684_0063?tify=%7B%22pages%22:[479]%7D
In his 1909 textbook "Determinantentheorie" Gerhard Kowalewski, a distant relative of Kovalevskaya's husband, gave a finite-dimensional version of Schmidt's existence proof for a symmetric matrix T, and then proposed "a simple infinite process to get to an invariant of T", the power method.
answered Aug 5, 2016 at 12:41
$\begingroup$
$\endgroup$
I vaguely remember, that this is due to Hotelling (1933). I don't have the monography of S. Mulaik "The foundations of factor analysis" (1972) at hand, but google-books let's you have a peek for "Hotelling". At page 114/115 this is discussed and Mulaik writes: "However, in 1933 Hotelling published a paper in the Journal of Educational Psychology which described a method of finding the characteristic equation directly (...)" Page 115: "(...) permitting us thereby to pick from among the eigenvectors the one associated with the largest eigenvalue. As a matter of fact, both kinds of methods are available. The first, which converges to the eigenvector associated with the largest eigenvalue, is due to Hotelling.(...)"
The method named after Jacobi to find the eigenvalues/eigenvectors is the special case of rotating the columns of a matrix to approximate a certain maximization criterion iteratively. This can be done if a symmetric matrix was decomposed for instance in its two triangular cholesky-factors, and the lower triangular factor is ("Jacobi"-) rotated to "principal components position". Here all pairs of columns are rotated to maximize some criterion and this is repeated until some convergence criterion is satisfied (I can provide that criterion if needed because I've implemented it in a software).
The book of S. Mulaik is a bit aged and of the year 1972, and although there is a lot of modern development in factor-analysis I rate it as still the best monography/standard textbook for the basic understanding of factor analysis and related basic methods of linear algebra (as well for the history...)
answered Nov 4, 2010 at 23:12