## Abstract

One strategy to solve a nonlinear eigenvalue problem T (λ)x = 0 is to solve a polynomial eigenvalue problem (PEP) P (λ)x = 0 that approximates the original problem through interpolation. Then, this PEP is usually solved by lineari-zation. Because of the polynomial approximation techniques, in this context, P (λ) is expressed in a non-monomial basis. The bases used with most frequency are the Chebyshev basis, the Newton basis and the Lagrange basis. Although, there exist already a number of linearizations available in the literature for matrix polynomials expressed in these bases, new families of linearizations are introduced because they present the following advantages: 1) they are easy to construct from the matrix coefficients of P (λ) when this polynomial is expressed in any of those three bases; 2) their block-structure is given explicitly; 3) it is possible to provide equivalent formulations for all three bases which allows a natural framework for comparison. Also, recovery formulas of eigenvectors (when P (λ) is regular) and recovery formulas of minimal bases and minimal indices (when P (λ) is singular) are provided. The ultimate goal is to use these families to compare the numerical behavior of the linearizations associated to the same basis (to select the best one) and with the linearizations associated to the other two bases, to provide recommendations on what basis to use in each context. This comparison will appear in a subsequent paper.

Original language | English |
---|---|

Pages (from-to) | 799-833 |

Number of pages | 35 |

Journal | Electronic Journal of Linear Algebra |

Volume | 36 |

Issue number | 1 |

DOIs | |

State | Published - Dec 2020 |

## Keywords

- Chebyshev basis
- Eigenvalue
- Eigenvector
- Interpolation
- Lagrange basis
- Linearization
- Minimal basis
- Minimal indices
- Newton basis
- Nonlinear eigenvalue problem
- Polynomial eigenvalue problem