Approximate GCD and its application to ill-conditioned algebraic equations
ISCM '90 Proceedings of the International Symposium on Computation mathematics
Approximate polynomial decomposition
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Structured Pseudospectra for Polynomial Eigenvalue Problems, with Applications
SIAM Journal on Matrix Analysis and Applications
Structured Perturbations Part I: Normwise Distances
SIAM Journal on Matrix Analysis and Applications
Algorithm 835: MultRoot---a Matlab package for computing polynomial roots and multiplicities
ACM Transactions on Mathematical Software (TOMS)
The solution of s exp(s) = a is not always the lambert w function of a
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Automatica (Journal of IFAC)
New algorithms for matrices, polynomials and matrix polynomials
New algorithms for matrices, polynomials and matrix polynomials
Stability and Stabilization of Time-Delay Systems (Advances in Design & Control) (Advances in Design and Control)
Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics)
Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics)
Pseudospectra for exponential polynomial matrices
Proceedings of the 2009 conference on Symbolic numeric computation
A method for finding zeros of polynomial equations using a contour integral based eigensolver
Proceedings of the 2009 conference on Symbolic numeric computation
Automatica (Journal of IFAC)
Numerical stability of barycentric Hermite root-finding
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
| Hi-index | 5.23 |
This paper extends a result of Graillat, which was based on Rump's Theorem, to show that pseudospectra of matrix polynomials expressed in other bases, and also some nonlinear matrix functions, are unaffected by drawing the matrix coefficients from certain structured families. We show by example that this behaviour is not universal. This result is of interest because computation of structured pseudospectra is much more expensive in general than computation of unstructured pseudospectra, and in the cases covered by Rump's Theorem there is no point going to the extra effort. The paper also contains some examples that may be of interest to the community, including an analytical solution of a nested exponential equation that shows why exponential polynomial decomposition algorithms may be of interest.