\(\mathcal{L}_{\infty}\)-norm computation for large-scale descriptor systems using structured iterative eigensolvers
From MaRDI portal
Publication:1713212
DOI10.3934/naco.2018007zbMath1405.93028OpenAlexW2789849740MaRDI QIDQ1713212
Matthias Voigt, Peter Benner, Ryan Lowe
Publication date: 24 January 2019
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2018007
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Approximation of stability radii for large-scale dissipative Hamiltonian systems ⋮ \(H_{\infty}\) observer-based control for large-scale systems with sparse observer communication network
Uses Software
Cites Work
- An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems
- A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- A rational SHIRA method for the Hamiltonian eigenvalue problem
- A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
- An implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problem
- A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
- Fast Approximation of the $H_\infty$ Norm via Optimization over Spectral Value Sets
- Calculating the $H_{\infty}$-norm Using the Implicit Determinant Method
- Convergence of the Dominant Pole Algorithm and Rayleigh Quotient Iteration
- The Modified Optimal $\mathcal{H}_\infty$ Control Problem for Descriptor Systems
- Large-Scale Computation of $\mathcal{L}_\infty$-Norms by a Greedy Subspace Method
- Hybrid expansion–contraction: a robust scaleable method for approximating theH∞norm
- Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils
- <formula formulatype="inline"><tex Notation="TeX">${\cal L}_{\infty}$</tex></formula>-Norm Computation for Continuous-Time Descriptor Systems Using Structured Matrix Pencils
- Arnoldi and Jacobi-Davidson methods for generalized eigenvalue problems $Ax=\lambda Bx$ with singular $B$
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(\mathcal{L}_{\infty}\)-norm computation for large-scale descriptor systems using structured iterative eigensolvers
