Block Full Rank Linearizations of Rational Matrices

11/02/2020
by   Froilán M. Dopico, et al.
0

Block full rank pencils introduced in [Dopico et al., Local linearizations of rational matrices with application to rational approximations of nonlinear eigenvalue problems, Linear Algebra Appl., 2020] allow us to obtain local information about zeros that are not poles of rational matrices. In this paper we extend the structure of those block full rank pencils to construct linearizations of rational matrices that allow us to recover locally not only information about zeros but also about poles, whenever certain minimality conditions are satisfied. In addition, the notion of degree of a rational matrix will be used to determine the grade of the new block full rank linearizations as linearizations at infinity. This new family of linearizations is important as it generalizes and includes the structures appearing in most of the linearizations for rational matrices constructed in the literature. In particular, this theory will be applied to study the structure and the properties of the linearizations in [P. Lietaert et al., Automatic rational approximation and linearization of nonlinear eigenvalue problems, submitted].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2019

Local Linearizations of Rational Matrices with Application to Rational Approximations of Nonlinear Eigenvalue Problems

This paper presents a definition for local linearizations of rational ma...
research
03/05/2020

Linearizations of rational matrices from general representations

We construct a new family of linearizations of rational matrices R(λ) wr...
research
03/18/2023

Computing a compact local Smith McMillan form

We define a compact local Smith-McMillan form of a rational matrix R(λ) ...
research
08/28/2017

Recent implementations, applications, and extensions of the Locally Optimal Block Preconditioned Conjugate Gradient method (LOBPCG)

Since introduction [A. Knyazev, Toward the optimal preconditioned eigens...
research
09/12/2023

Measure preservation and integrals for Lotka–Volterra T-systems and their Kahan discretisation

We show that any Lotka–Volterra T-system associated with an n-vertex tre...
research
03/12/2021

An efficient, memory-saving approach for the Loewner framework

The Loewner framework is one of the most successful data-driven model or...
research
01/19/2023

An effcient block rational Krylov solver for Sylvester equations with adaptive pole selection

We present an algorithm for the solution of Sylvester equations with rig...

Please sign up or login with your details

Forgot password? Click here to reset