A sort-Jacobi algorithm for semisimple Lie algebras
DOI10.1016/j.laa.2008.07.004zbMath1177.65056OpenAlexW1985432759WikidataQ115344881 ScholiaQ115344881MaRDI QIDQ958008
Publication date: 2 December 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2008.07.004
convergence accelerationCartan decompositionlocal quadratic convergencetrace functionexceptional Lie algebraoff-normrestricted-root spacesort-Jacobi algorithmstructured eigenvalue decompositionstructured singular value decomposition
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Simple, semisimple, reductive (super)algebras (17B20)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a class of Jacobi-like procedures for diagonalising arbitrary real matrices
- On sharp quadratic convergence bounds for the serial Jacobi methods
- Manifolds, tensor analysis, and applications.
- A Jacobi eigenreduction algorithm for definite matrix pairs
- Computation of signature symmetric balanced realizations
- Gradient flows and double bracket equations.
- A Jacobi-like algorithm for computing the generalized Schur form of a regular pencil
- An eigenvalue algorithm for skew-symmetric matrices
- On the quadratic convergence of the special cyclic Jacobi method
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- The extensibility of local Lie groups of transformations and groups on surfaces
- Jacobi’s Method for Skew-Symmetric Matrices
- Diagonalization in Compact Lie Algebras and a New Proof of a Theorem of Kostant
- Solution of linear equations by diagonalization of coefficients matrix
- A Procedure for the Diagonalization of Normal Matrices
- The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
- On the Speed of Convergence of Cyclic and Quasicyclic Jacobi Methods for Computing Eigenvalues of Hermitian Matrices
- A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
- The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints
- A Hamiltonian-Jacobi algorithm
- A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
- A Chart of Numerical Methods for Structured Eigenvalue Problems
- Jacobi's Algorithm on Compact Lie Algebras
- Structure preserving algorithms for perplectic eigenproblems
- On the Convergence of the Jacobi Method for Arbitrary Orderings
- On the Diagonalization of Complex Symmetric Matrices
- Introduction to Lie Algebras and Representation Theory
- Lie groups beyond an introduction
- Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems
- A Jacobi-type method for computing balanced realizations
This page was built for publication: A sort-Jacobi algorithm for semisimple Lie algebras