相关论文: Strong linearizations of rational matrices with po…
We construct a new family of linearizations of rational matrices $R(\lambda)$ written in the general form $R(\lambda)= D(\lambda)+C(\lambda)A(\lambda)^{-1}B(\lambda)$, where $D(\lambda)$, $C(\lambda)$, $B(\lambda)$ and $A(\lambda)$ are…
We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
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…
Structured rational matrices such as symmetric, skew-symmetric, Hamiltonian, skew-Hamiltonian, Hermitian, and para-Hermitian rational matrices arise in many applications. Linearizations of rational matrices have been introduced recently for…
Numerical computations involving rational matrices often benefit from preserving underlying matrix structures such as symmetry, Hermitian properties, or sparsity that reflect physical, geometric, or algebraic characteristics of the system.…
The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…
A complete theory of the relationship between the minimal bases and indices of rational matrices and those of their strong linearizations is presented. Such theory is based on establishing first the relationships between the minimal bases…
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…
Linearization is a widely used method for solving polynomial eigenvalue problems (PEPs) and rational eigenvalue problem (REPs) in which the PEP/REP is transformed to a generalized eigenproblem and then solve this generalized eigenproblem…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
The standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil, known as a strong linearization. This process transforms the…
Many applications give rise to structured matrix polynomials. The problem of constructing structure-preserving strong linearizations of structured matrix polynomials is revisited in this work and in the forthcoming ones…
The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…
This paper presents a definition for local linearizations of rational matrices and studies their properties. This definition allows us to introduce matrix pencils associated to a rational matrix that preserve its structure of zeros and…
In the framework of Polynomial Eigenvalue Problems, most of the matrix polynomials arising in applications are structured polynomials (namely (skew-)symmetric, (skew-)Hermitian, (anti-)palindromic, or alternating). The standard way to solve…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…
In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…