Structure-Preserving Methods for Computing Eigenpairs of Large Sparse Skew-Hamiltonian/Hamiltonian Pencils

Authors:
Volker Mehrmann;David Watkins
Affiliations:
-;-
Venue:
SIAM Journal on Scientific Computing
Year:
2000

Citing 0
Cited 9

Algorithm 854: Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II

ACM Transactions on Mathematical Software (TOMS)
A fast passivity test for descriptor systems via structure-preserving transformations of Skew-Hamiltonian/Hamiltonian matrix pencils

Proceedings of the 43rd annual Design Automation Conference
Symplectic Householder transformations for a QR-like decomposition, a geometric and algebraic approaches

Journal of Computational and Applied Mathematics
Fast passivity verification and enforcement via reciprocal systems for interconnects with large order macromodels

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Fast and reliable passivity assessment and enforcement with extended Hamiltonian pencil

Proceedings of the 2009 International Conference on Computer-Aided Design
Extended Hamiltonian pencil for passivity assessment and enforcement for S-parameter systems

Proceedings of the Conference on Design, Automation and Test in Europe
A novel framework for passive macro-modeling

Proceedings of the 48th Design Automation Conference
An overview on the eigenvalue computation for matrices

Neural, Parallel & Scientific Computations
Numerical studies on structure-preserving algorithms for surface acoustic wave simulations

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study large, sparse generalized eigenvalue problems for matrix pencils, where one of the matrices is Hamiltonian and the other is skew-Hamiltonian. Problems of this form arise in the numerical simulation of elastic deformation of anisotropic materials, in structural mechanics, and in the linear quadratic control problem for partial differential equations. We develop a structure-preserving skew-Hamiltonian, isotropic, implicitly restarted shift-and-invert Arnoldi algorithm (SHIRA). Several numerical examples demonstrate the superiority of SHIRA over a competing unstructured method.