Perturbation Theory for Hamiltonian Matrices and the Distance to Bounded-Realness
From MaRDI portal
Publication:3094398
DOI10.1137/10079464XzbMath1227.93081MaRDI QIDQ3094398
Shreemayee Bora, Michael Karow, Volker Mehrmann, Julio Moro, Rafikul Alam
Publication date: 25 October 2011
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
perturbation theoryHamiltonian matrixsign characteristicHamiltonian eigenvalue problempassive systempurely imaginary eigenvaluesstructured mapping problembounded-realnessdistance to bounded-realnessHamiltonian pseudospectra
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (28)
Finite-Dimensional Indefinite Inner Product Spaces and Applications in Numerical Analysis ⋮ Locating eigenvalues of quadratic matrix polynomials ⋮ On the sign characteristics of Hermitian matrix polynomials ⋮ Necessary and sufficient conditions for solvability of the Riccati inequalities in the general case ⋮ Stability of invariant subspaces of quaternion matrices ⋮ On computing the distance to stability for matrices using linear dissipative Hamiltonian systems ⋮ Linearizations of Hermitian Matrix Polynomials Preserving the Sign Characteristic ⋮ On the Kahan-Parlett-Jiang theorem -- a globally optimal backward perturbation error for two-sided invariant subspaces ⋮ On the pseudo-spectra and the related properties of infinite-dimensional Hamiltonian operators ⋮ Structured Procrustes problem ⋮ Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization. ⋮ On backward errors of structured polynomial eigenproblems solved by structure preserving linearizations ⋮ Lipschitz properties of structure preserving matrix perturbations ⋮ Structured mapping problems for linearly structured matrices ⋮ Finding the Nearest Positive-Real System ⋮ Preserving spectral properties of structured matrices under structured perturbations ⋮ A note on approximating the nearest stable discrete-time descriptor systems with fixed rank ⋮ Palindromic linearizations of palindromic matrix polynomials of odd degree obtained from Fiedler-like pencils ⋮ Eigenvalue perturbation theory of structured real matrices and their sign characteristics under generic structured rank-one perturbations ⋮ Distance Problems for Hermitian Matrix Pencils with Eigenvalues of Definite Type ⋮ Numerical Linear Algebra Methods for Linear Differential-Algebraic Equations ⋮ Low rank differential equations for Hamiltonian matrix nearness problems ⋮ Optimal Robustness of Port-Hamiltonian Systems ⋮ Structured eigenvalue/eigenvector backward errors of matrix pencils arising in optimal control ⋮ 5 Post-processing methods for passivity enforcement ⋮ Structured Backward Errors for Eigenvalues of Linear Port-Hamiltonian Descriptor Systems ⋮ Structured Eigenvalue Backward Errors of Matrix Pencils and Polynomials with Palindromic Structures ⋮ Finding the Nearest Passive or Nonpassive System via Hamiltonian Eigenvalue Optimization
Uses Software
This page was built for publication: Perturbation Theory for Hamiltonian Matrices and the Distance to Bounded-Realness
