A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
From MaRDI portal
Publication:1377019
DOI10.1007/s002110050315zbMath0889.65036OpenAlexW2002780597MaRDI QIDQ1377019
Volker Mehrmann, Peter Benner, Hong-guo Xu
Publication date: 1 February 1998
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199800915
numerical exampleeigenvaluesHamiltonian matricessymplectic matricesCayley transformationsymplectic pencilsperiodic Schur decompositionHamiltonian pencilssymplectic URV decomposition
Related Items (37)
Balancing sparse Hamiltonian eigenproblems ⋮ Some remarks on the complex \(J\)-symmetric eigenproblem ⋮ A new real structure-preserving quaternion QR algorithm ⋮ Hamiltonian partial mixed finite element-state space symplectic semi-analytical approach for the piezoelectric smart composites and FGM analysis ⋮ A numerical method for computing the Hamiltonian Schur form ⋮ An invariant subspace method for large-scale algebraic Riccati equation ⋮ Skew-symmetric matrix polynomials and their Smith forms ⋮ Fast iterative solution of the Bethe-Salpeter eigenvalue problem using low-rank and QTT tensor approximation ⋮ Perturbation theory of structured matrix pencils with no spillover ⋮ An SVD-like matrix decomposition and its applications ⋮ An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix ⋮ An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems ⋮ Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction ⋮ Computing the density of states for optical spectra of molecules by low-rank and QTT tensor approximation ⋮ First order structured perturbation theory for multiple zero eigenvalues of skew-adjoint matrices ⋮ A bisection method for measuring the distance of a quadratic matrix polynomial to the quadratic matrix polynomials that are singular on the unit circle ⋮ Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems ⋮ On structured componentwise condition numbers for Hamiltonian eigenvalue problems ⋮ Perturbation analysis of the stochastic algebraic Riccati equation ⋮ Structured maximal perturbations for Hamiltonian eigenvalue problems ⋮ A stabilization algorithm of the Navier–Stokes equations based on algebraic Bernoulli equation ⋮ Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems ⋮ On a class of generalized eigenvalue problems and equivalent eigenvalue problems that arise in systems and control theory ⋮ A structure-preserving method for positive realness problem in control ⋮ Error analysis of symplectic Lanczos method for Hamiltonian eigenvalue problem ⋮ Structured Eigenvalue Problems ⋮ Numerical Linear Algebra Methods for Linear Differential-Algebraic Equations ⋮ A robust numerical method for the \(\gamma\)-iteration in \(H_{\infty}\) control ⋮ Conditioning and backward errors of eigenvalues of homogeneous matrix polynomials under Möbius transformations ⋮ A new block method for computing the Hamiltonian Schur form ⋮ Krylov projection methods for linear Hamiltonian systems ⋮ A Core-Chasing Symplectic QR Algorithm ⋮ On the computation of the optimal \(\mathbf H_\infty\) norms for two feedback control problems ⋮ Computing the Kreiss Constant of a Matrix ⋮ Numerical methods in control ⋮ On the structure of the solutions to the matrix equation \(G^\ast JG = J\) ⋮ The properties of a kind of random symplectic matrices
Uses Software
This page was built for publication: A numerically stable, structure preserving method for computing the eigenvalues of real Hamiltonian or symplectic pencils
