English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

An algorithm based on the Ehrlich-Aberth root-finding method is presented forthe computation of the eigenvalues of a T-palindromic matrix polynomial. Astructured linearization of the polynomial represented in the Dickson basis isintroduced in order to exploit the symmetry of the roots by halving the totalnumber of the required approximations. The rank structure properties of thelinearization allow the design of a fast and numerically robust implementationof the root-finding iteration. Numerical experiments that confirm theeffectiveness and the robustness of the approach are provided.

The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis