Jacobi eigenvalue algorithm
Jacobi eigenvalue algorithm is an iterative method for computing eigenvalues and eigenvectors of a real symmetric matrix.
All 4 facts, and where they come from
Facts
4 facts · 0 confirmed by two sources · 0 cited · 4 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2541090790
- Described as
- iterative method for computing eigenvalues and eigenvectors of a real symmetric matrix
- What it is
- eigenvalue algorithm; iterative method for solving system of linear equations; mathematical concept
- Named after
- Carl Gustav Jacob Jacobi
- Wikipedias with a page
- 10
Wikidata item Q1677726 (wikidata.org/wiki/Q1677726), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1386002940
In numerical linear algebra, the Jacobi eigenvalue algorithm is an iterative method for the calculation of the eigenvalues and eigenvectors of a real symmetric matrix (a process known as diagonalization). It is named after Carl Gustav Jacob Jacobi, who first proposed the method in 1846, but it only became widely used in the 1950s with the advent of computers.
This algorithm is inherently a dense matrix algorithm: it draws little or no advantage from being applied to a sparse matrix, and it will destroy sparseness by creating fill-in. Similarly, it will not preserve structures such as being banded of the matrix on which it operates.
From the Wikipedia article “Jacobi eigenvalue algorithm” (en.wikipedia.org/wiki/Jacobi_eigenvalue_algorithm), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
