• Corpus ID: 236034158

Tropical Laurent series, their tropical roots, and localization results for the eigenvalues of nonlinear matrix functions

  title={Tropical Laurent series, their tropical roots, and localization results for the eigenvalues of nonlinear matrix functions},
  author={Gian Maria Negri Porzio and Vanni Noferini and Leonardo Robol},
Tropical roots of tropical polynomials have been previously studied and used to localize roots of classical polynomials and eigenvalues of matrix polynomials. We extend the theory of tropical roots from tropical polynomials to tropical Laurent series. Our proposed definition ensures that, as in the polynomial case, there is a bijection between tropical roots and slopes of the Newton polygon associated with the tropical Laurent series. We show that, unlike in the polynomial case, there may be… 

Figures from this paper


Tropical Scaling of Polynomial Matrices
The eigenvalues of a matrix polynomial can be determined classically by solving a generalized eigenproblem for a linearized matrix pencil, for instance by writing the matrix polynomial in companion
Scaling Algorithms and Tropical Methods in Numerical Matrix Analysis: Application to the Optimal Assignment Problem and to the Accurate Computation of Eigenvalues
This thesis proposes a new approach exploiting the connection between the optimal assignment problem and the entropy maximization problem, and develops an algorithm which computes the tropical eigenvalues in polynomial time.
Tropical Roots as Approximations to Eigenvalues of Matrix Polynomials
The results provide the basis for analyzing the effect of Gaubert and Sharify's tropical scalings for P(\lambda) on (a) the conditioning of linearizations of tropically scaled $P(\ Lambda)$ and (b) the backward stability of eigensolvers based on linearized versions of Tropically scaled P(\ lambda)$.
Locating the Eigenvalues of Matrix Polynomials
These extensions are applied to determine effective initial approximations for the numerical computation of the eigenvalues of matrix polynomials by means of simultaneous iterations, like the Ehrlich--Aberth method.
Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
  • T. Betcke
  • Mathematics, Computer Science
    SIAM J. Matrix Anal. Appl.
  • 2008
This paper investigates scaling for generalized and polynomial eigenvalue problems (PEPs) of arbitrary degree and introduces a generalization of the diagonal scaling by Lemonnier and Van Dooren to PEPs that is especially effective if some information about the magnitude of the wanted eigenvalues is available.
Numerical computation of polynomial zeros by means of Aberth's method
  • Dario Bini
  • Computer Science
    Numerical Algorithms
  • 2005
An algorithm for computing polynomial zeros, based on Aberth's method, which is robust against overflow and allows to deal with polynomials of any degree, not necessarily monic, whose zeros and coefficients are representable as floating point numbers is presented.
A numerical method for polynomial eigenvalue problems using contour integral
We propose a numerical method using contour integral to solve polynomial eigenvalue problems (PEPs). The method finds eigenvalues contained in a certain domain which is defined by a surrounding