DeepAI AI Chat
Log In Sign Up

A rational Even-IRA algorithm for the solution of T-even polynomial eigenvalue problems

09/03/2020
by   Peter Benner, et al.
0

In this work we present a rational Krylov subspace method for solving real large-scale polynomial eigenvalue problems with T-even (that is, symmetric/skew-symmetric) structure. Our method is based on the Even-IRA algorithm. To preserve the structure, a sparse T-even linearization from the class of block minimal bases pencils is applied. Due to this linearization, the Krylov basis vectors can be computed in a cheap way. A rational decomposition is derived so that our method explicitly allows for changes of the shift during the iteration. This leads to a method that is able to compute parts of the spectrum of a T-even matrix polynomial in a fast and reliable way.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/15/2020

On Relaxed Filtered Krylov Subspace Method for Non-Symmetric Eigenvalue Problems

In this paper, by introducing a class of relaxed filtered Krylov subspac...
03/06/2021

The Short-term Rational Lanczos Method and Applications

Rational Krylov subspaces have become a reference tool in dimension redu...
05/25/2021

Backward Error of Matrix Rational Function

We consider a minimal realization of a rational matrix functions. We per...
01/13/2022

The Padé matrix pencil method with spurious pole information assimilation

We present a novel method for calculating Padé approximants that is capa...
11/12/2021

GCGE: A Package for Solving Large Scale Eigenvalue Problems by Parallel Block Damping Inverse Power Method

We propose an eigensolver and the corresponding package, GCGE, for solvi...
09/15/2019

Efficient Rational Creative Telescoping

We present a new algorithm to compute minimal telescopers for rational f...