We present structure-preserving numerical methods for the eigenvalue problem of complex palindromic pencils. Such problems arise in control theory, as well as from palindromic linearizations of higher degree palindromic matrix polynomials. A key ingredient of these methods is the development of an appropriate condensed form --- the anti-triangular Schur form. Ill-conditioned problems with eigenvalues near the unit circle, in particular near $\pm 1$, are discussed. We show how a combination of unstructured methods followed by a structured refinement can be used to solve such problems accurately
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
Abstract. We present structure-preserving numerical methods for the eigenvalue problem of complex pa...
[[abstract]]We investigate the perturbation of the palindromic eigenvalue problem for the matrix qua...
Abstract. Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue pr...
Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue problems are...
We describe a software package for computing the numerical solution of palindromic and even eigenval...
AbstractThe standard way to solve polynomial eigenvalue problems P(λ)x=0 is to convert the matrix po...
AbstractThis work is concerned with eigenvalue problems for structured matrix polynomials, including...
We give several different formulations for the discrete-time linear-quadratic control problem in ter...
Key words: eigenvalue problem, matrix polynomials, palindromic Abstract. A rational eigenvalue probl...
The standard way to solve polynomial eigenvalue problems P (λ)x = 0 is to convert the matrix polynom...
An algorithm based on the Ehrlich-Aberth root-finding method is presented for the computation of the...
The standard way to solve polynomial eigenvalue problems $P(\la)x=0$ is to convert the matrix polyno...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
Abstract. We present structure-preserving numerical methods for the eigenvalue problem of complex pa...
[[abstract]]We investigate the perturbation of the palindromic eigenvalue problem for the matrix qua...
Abstract. Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue pr...
Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue problems are...
We describe a software package for computing the numerical solution of palindromic and even eigenval...
AbstractThe standard way to solve polynomial eigenvalue problems P(λ)x=0 is to convert the matrix po...
AbstractThis work is concerned with eigenvalue problems for structured matrix polynomials, including...
We give several different formulations for the discrete-time linear-quadratic control problem in ter...
Key words: eigenvalue problem, matrix polynomials, palindromic Abstract. A rational eigenvalue probl...
The standard way to solve polynomial eigenvalue problems P (λ)x = 0 is to convert the matrix polynom...
An algorithm based on the Ehrlich-Aberth root-finding method is presented for the computation of the...
The standard way to solve polynomial eigenvalue problems $P(\la)x=0$ is to convert the matrix polyno...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...
We investigate the perturbation of the palindromic eigenvalue problem for the matrix quadratic $P(\l...