A Greedy Subspace Method for Computing the ℒ∞‐Norm
暂无分享,去创建一个
[1] M. Overton,et al. FAST APPROXIMATION OF THE H∞ NORM VIA OPTIMIZATION OVER SPECTRAL VALUE SETS∗ , 2012 .
[2] Serkan Gugercin,et al. Interpolatory projection methods for structure-preserving model reduction , 2009, Syst. Control. Lett..
[3] B. M. Fulk. MATH , 1992 .
[4] Peter Benner,et al. LARGE-SCALE COMPUTATION OF L ∞ -NORMS BY A GREEDY SUBSPACE METHOD , 2017 .
[5] Michael L. Overton,et al. Hybrid expansion–contraction: a robust scaleable method for approximating the H∞ norm , 2016 .
[6] S. Boyd,et al. A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L ∞ -norm , 1990 .
[7] Vasile Sima,et al. ${\cal L}_{\infty}$-Norm Computation for Continuous-Time Descriptor Systems Using Structured Matrix Pencils , 2012, IEEE Transactions on Automatic Control.
[8] Ryan Lowe,et al. L ∞ -NORM COMPUTATION FOR LARGE-SCALE DESCRIPTOR SYSTEMS USING STRUCTURED ITERATIVE EIGENSOLVERS , 2013 .
[9] Andrew G. Glen,et al. APPL , 2001 .
[10] Emre Mengi,et al. Numerical Optimization of Eigenvalues of Hermitian Matrix Functions , 2011, SIAM J. Matrix Anal. Appl..