Block Full Rank Linearizations of Rational Matrices

by   Froilán M. Dopico, et al.

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].



There are no comments yet.


page 1

page 2

page 3

page 4


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...

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

Since introduction [A. Knyazev, Toward the optimal preconditioned eigens...

Linearizations of rational matrices from general representations

We construct a new family of linearizations of rational matrices R(λ) wr...

An efficient, memory-saving approach for the Loewner framework

The Loewner framework is one of the most successful data-driven model or...

Algorithms for the rational approximation of matrix-valued functions

A selection of algorithms for the rational approximation of matrix-value...

A New Constrained Optimization Model for Solving the Nonsymmetric Stochastic Inverse Eigenvalue Problem

The stochastic inverse eigenvalue problem aims to reconstruct a stochast...

On Computing the Kronecker Structure of Polynomial and Rational Matrices using Julia

In this paper we discuss the mathematical background and the computation...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.