Matrix polynomial eigenproblems arise in many application areas, both directly and as
approximations for more general nonlinear eigenproblems. One of the most common …

Background: The medicinal use of products made by bees is called apitherapy. Apitherapy
has become popular as an alternative treatment in recent years. Pharmaceutical properties …

The numerical solution of singular eigenvalue problems is complicated by the fact that small
perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy …

We 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 …

Novel memory‐efficient Arnoldi algorithms for solving matrix polynomial eigenvalue
problems are presented. More specifically, we consider the case of matrix polynomials …

Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the
context of linear eigenvalue problems, leading to conceptually elegant and numerically …

The standard way of solving numerically a polynomial eigenvalue problem (PEP) is to use a
linearization and solve the corresponding generalized eigenvalue problem (GEP). In …

We derive explicit computable expressions of structured backward errors of approximate
eigenelements of structured matrix polynomials including symmetric, skew-symmetric …

Double eigenvalues are not generic for matrices without any particular structure. A matrix
depending linearly on a scalar parameter, A+ μ B, will, however, generically have double …

Necessary and sufficient conditions are obtained for simple eigenvalues of complex matrix
polynomials with ⋆-even/odd and ⋆-palindromic/antipalindromic structures to have the …