scholarly journals Structured eigenvalue condition numbers and linearizations for matrix polynomials

2011 ◽  
Vol 435 (9) ◽  
pp. 2193-2221 ◽  
Author(s):  
Bibhas Adhikari ◽  
Rafikul Alam ◽  
Daniel Kressner
2019 ◽  
Vol 564 ◽  
pp. 170-200 ◽  
Author(s):  
Luis Miguel Anguas ◽  
María Isabel Bueno ◽  
Froilán M. Dopico

2006 ◽  
Vol 28 (4) ◽  
pp. 1052-1068 ◽  
Author(s):  
Michael Karow ◽  
Daniel Kressner ◽  
Françoise Tisseur

2017 ◽  
Vol 50 (10) ◽  
pp. 105204 ◽  
Author(s):  
Serban Belinschi ◽  
Maciej A Nowak ◽  
Roland Speicher ◽  
Wojciech Tarnowski

Author(s):  
Yan V. Fyodorov ◽  
Wojciech Tarnowski

Abstract We study the distribution of the eigenvalue condition numbers $$\kappa _i=\sqrt{ ({\mathbf{l}}_i^* {\mathbf{l}}_i)({\mathbf{r}}_i^* {\mathbf{r}}_i)}$$ κ i = ( l i ∗ l i ) ( r i ∗ r i ) associated with real eigenvalues $$\lambda _i$$ λ i of partially asymmetric $$N\times N$$ N × N random matrices from the real Elliptic Gaussian ensemble. The large values of $$\kappa _i$$ κ i signal the non-orthogonality of the (bi-orthogonal) set of left $${\mathbf{l}}_i$$ l i and right $${\mathbf{r}}_i$$ r i eigenvectors and enhanced sensitivity of the associated eigenvalues against perturbations of the matrix entries. We derive the general finite N expression for the joint density function (JDF) $${{\mathcal {P}}}_N(z,t)$$ P N ( z , t ) of $$t=\kappa _i^2-1$$ t = κ i 2 - 1 and $$\lambda _i$$ λ i taking value z, and investigate its several scaling regimes in the limit $$N\rightarrow \infty $$ N → ∞ . When the degree of asymmetry is fixed as $$N\rightarrow \infty $$ N → ∞ , the number of real eigenvalues is $$\mathcal {O}(\sqrt{N})$$ O ( N ) , and in the bulk of the real spectrum $$t_i=\mathcal {O}(N)$$ t i = O ( N ) , while on approaching the spectral edges the non-orthogonality is weaker: $$t_i=\mathcal {O}(\sqrt{N})$$ t i = O ( N ) . In both cases the corresponding JDFs, after appropriate rescaling, coincide with those found in the earlier studied case of fully asymmetric (Ginibre) matrices. A different regime of weak asymmetry arises when a finite fraction of N eigenvalues remain real as $$N\rightarrow \infty $$ N → ∞ . In such a regime eigenvectors are weakly non-orthogonal, $$t=\mathcal {O}(1)$$ t = O ( 1 ) , and we derive the associated JDF, finding that the characteristic tail $${{\mathcal {P}}}(z,t)\sim t^{-2}$$ P ( z , t ) ∼ t - 2 survives for arbitrary weak asymmetry. As such, it is the most robust feature of the condition number density for real eigenvalues of asymmetric matrices.


CALCOLO ◽  
2016 ◽  
Vol 54 (1) ◽  
pp. 319-365 ◽  
Author(s):  
Fernando De Terán ◽  
Froilán M. Dopico ◽  
Javier Pérez

2020 ◽  
Vol 20 (6) ◽  
pp. 1439-1473
Author(s):  
Martin Lotz ◽  
Vanni Noferini

AbstractWe propose a new approach to the theory of conditioning for numerical analysis problems for which both classical and stochastic perturbation theories fail to predict the observed accuracy of computed solutions. To motivate our ideas, we present examples of problems that are discontinuous at a given input and even have infinite stochastic condition number, but where the solution is still computed to machine precision without relying on structured algorithms. Stimulated by the failure of classical and stochastic perturbation theory in capturing such phenomena, we define and analyse a weak worst-case and a weak stochastic condition number. This new theory is a more powerful predictor of the accuracy of computations than existing tools, especially when the worst-case and the expected sensitivity of a problem to perturbations of the input is not finite. We apply our analysis to the computation of simple eigenvalues of matrix polynomials, including the more difficult case of singular matrix polynomials. In addition, we show how the weak condition numbers can be estimated in practice.


Sign in / Sign up

Export Citation Format

Share Document