💡 Words with a Similar Meaning to "Jacobi eigenvalue algorithm"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| jacobi method | In numerical linear algebra, the (a.k.a. the Jacobi iteration method) an iterative algorithm for determining the solutions of a strictly diagonally dominant system of linear equations. |
| qr algorithm | In numerical linear algebra, the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. |
| power iteration | In mathematics, power iteration (also known as the power method) is an eigenvalue algorithm: given a diagonalizable matrix , the algorithm will produce a number , which is the greatest (in absolute value) eigenvalue of , and a nonzero vector , which is a corresponding eigenvector of , that is, . |
| eigendecomposition of a matrix | In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. |
| conjugate gradient method | In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is positive-semidefinite. |
| biconjugate gradient method | In mathematics, more specifically in numerical linear algebra, the biconjugate gradient method is an algorithm to solve systems of linear equations |
| inverse iteration | In numerical analysis, inverse iteration (also known as the inverse power method) is an iterative eigenvalue algorithm. |
| arnoldi iteration | In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of an iterative method. |
| quantum phase estimation algorithm | In quantum computing, the quantum phase estimation algorithm is a quantum algorithm to estimate the phase corresponding to an eigenvalue of a given unitary operator. |
| jacobian matrix and determinant | In vector calculus, the Jacobian matrix of a vector-valued function of several variables is the matrix of all its first-order partial derivatives. |
| tridiagonal matrix algorithm | In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm (named after Llewellyn Thomas), is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations. |
| orthogonal diagonalization | In linear algebra, an orthogonal diagonalization of a normal matrix (e.g. a symmetric matrix) is a diagonalization by means of an orthogonal change of coordinates. |
| euler methodnoun | (differential equations) A method for numerically approximating the solution to an ordinary differential equation with a given initial value. |
| numerical linear algebranoun | (computing) The study of numerical analysis algorithms to solve mathematical problems in the field of linear algebra. |
| clenshaw algorithm | In numerical analysis, the Clenshaw algorithm, also called Clenshaw summation, is a recursive method to evaluate a linear combination of Chebyshev polynomials. |
| rayleigh quotient iteration | an eigenvalue algorithm which extends the idea of the inverse iteration by using the Rayleigh quotient to obtain increasingly accurate eigenvalue estimates. |
| exact diagonalization | a numerical technique used in physics to determine the eigenstates and energy eigenvalues of a quantum Hamiltonian. |
| characteristic polynomialnoun | (linear algebra) The polynomial produced from a given square matrix by first subtracting the appropriate identity matrix multiplied by an indeterminant and then calculating the determinant. |
| cholesky decomposition | In linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced ) is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions, e.g., Monte Carlo simulations. |
| jacobi identitynoun | (mathematics) Given a binary operation × defined on a set S which also has additive operation + and additive identity 0, the property that a × (b×c) + b × (c×a) + c × (a×b) = 0 for all a, b, c in S. |
Translate “Jacobi eigenvalue algorithm” into Another Language
Pick a language — the word will be pre-filled in the translator.