Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree

Tsung Ming Huang, Wen Wei Lin*, Wei Shuo Su

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we propose a palindromic quadratization approach, transforming a palindromic matrix polynomial of even degree to a palindromic quadratic pencil. Based on the (S + S-1)-transform and Patel's algorithm, the structure-preserving algorithm can then be applied to solve the corresponding palindromic quadratic eigenvalue problem. Numerical experiments show that the relative residuals for eigenpairs of palindromic polynomial eigenvalue problems computed by palindromic quadratized eigenvalue problems are better than those via palindromic linearized eigenvalue problems or polyeig in MATLAB.

Original languageEnglish
Pages (from-to)713-735
Number of pages23
JournalNumerische Mathematik
Volume118
Issue number4
DOIs
Publication statusPublished - 2011 Aug

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Palindromic quadratization and structure-preserving algorithm for palindromic matrix polynomials of even degree'. Together they form a unique fingerprint.

Cite this