Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems

DOI10.1016/S0024-3795(00)00093-8zbMath0983.65050WikidataQ127360662 ScholiaQ127360662MaRDI QIDQ5946175

Heike Fassbender, Niloufer Mackey, D. Steven Mackey

Publication date: 3 April 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsconvergenceeigenvalueseigenvectorsHamiltonian matricesJacobi methodskew-symmetric matrices

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (9)

A fast structure-preserving method for computing the singular value decomposition of quaternion matrices ⋮ An elementary, first principles approach to the indefinite spin groups ⋮ Real structure-preserving algorithms of Householder based transformations for quaternion matrices ⋮ A new real structure-preserving quaternion QR algorithm ⋮ The minimal polynomial of some matrices via quaternions ⋮ Quaternion involutions and anti-involutions ⋮ A sort-Jacobi algorithm for semisimple Lie algebras ⋮ Basic classes of matrices with respect to quaternionic indefinite inner product spaces ⋮ On accurate error estimates for the quaternion least squares and weighted least squares problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Schur decomposition for Hamiltonian matrices
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• Solution of the large matrix equations which occur in response theory
• The weak and strong stability of algorithms in numerical linear algebra
• An analysis of the HR algorithm for computing the eigenvalues of a matrix
• Notes on geometry
• The autonomous linear quadratic control problem. Theory and numerical solution
• Hamiltonian square roots of skew-Hamiltonian matrices
• A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
• A new method for computing the stable invariant subspace of a real Hamiltonian matrix
• Canonical forms for Hamiltonian and symplectic matrices and pencils
• The eigenvalue problem for Hermitian matrices with time reversal symmetry
• New Jacobi-sets for parallel computations
• An eigenvalue algorithm for skew-symmetric matrices
• Stetige Lösungen linearer Gleichungssysteme
• Stability of Structured Hamiltonian Eigensolvers
• Jacobi’s Method for Skew-Symmetric Matrices
• On the parallelizability of the spheres
• A Procedure for the Diagonalization of Normal Matrices
• NON-PARALLELIZABILITY OF THE n-SPHERE FOR n > 7
• A Jacobi-Like Method for the Automatic Computation of Eigenvalues and Eigenvectors of an Arbitrary Matrix
• A Hamiltonian-Jacobi algorithm
• A Jacobi-Like Algorithm for Computing the Schur Decomposition of a Nonhermitian Matrix
• A Hamiltonian $QR$ Algorithm
• On One-Sided Jacobi Methods for Parallel Computation
• On Parallel Jacobi Orderings
• A Schur method for solving algebraic Riccati equations
• A Chart of Numerical Methods for Structured Eigenvalue Problems
• A one-sided transformation method for the singular value decomposition and algebraic eigenproblem
• Structured Backward Error and Condition of Generalized Eigenvalue Problems
• A Jacobi-like method for solving algebraic Riccati equations on parallel computers
• Hamilton and Jacobi Meet Again: Quaternions and the Eigenvalue Problem
• On the Convergence of the Jacobi Method for Arbitrary Orderings
• On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
• Vector fields on spheres

This page was built for publication: Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems