English
Related papers

Related papers: Perturbation of monic matrix polynomials

200 papers

A right quaternion matrix polynomial is an expression of the form $P(\lambda)= \displaystyle \sum_{i=0}^{m}A_i \lambda^i$, where $A_i$'s are $n \times n$ quaternion matrices with $A_m \neq 0$. The aim of this manuscript is to determine the…

Spectral Theory · Mathematics 2025-10-13 Pallavi Basavaraju , Shrinath Hadimani , Sachindranath Jayaraman

Given a diagonalizable matrix $A$, we study the stability of its invariant subspaces when its matrix of eigenvectors is ill-conditioned. Let $\mathcal{X}_1$ be some invariant subspace of $A$ and $X_1$ be the matrix storing the right…

Numerical Analysis · Mathematics 2022-03-02 He Lyu , Rongrong Wang

In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the…

Numerical Analysis · Mathematics 2017-04-06 Silvia Noschese , Lothar Reichel

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…

Numerical Analysis · Mathematics 2009-07-16 Bibhas Adhikari , Rafikul Alam

Given a family $\{ f_{\lambda} \}_{\lambda \in \Lambda}$ of polynomial maps of degree $d$ where $\Lambda$ is the set of parameters, a polynomial map $f_{\lambda_0}$ is called {\it $J$-stable in $\Lambda$} if there exists a neighborhood of…

Dynamical Systems · Mathematics 2014-07-10 Junghun Lee

Stability of soliton families in one-dimensional nonlinear Schroedinger equations with non-parity-time (PT)-symmetric complex potentials is investigated numerically. It is shown that these solitons can be linearly stable in a wide range of…

Pattern Formation and Solitons · Physics 2016-11-23 Jianke Yang , Sean Nixon

Let $(f_\lambda)_{\lambda\in \Lambda}$ be a holomorphic family of polynomial automorphisms of $\mathbb{C}^2$. Following previous work of Dujardin and Lyubich, we say that such a family is weakly stable if saddle periodic orbits do not…

Dynamical Systems · Mathematics 2014-09-17 Pierre Berger , Romain Dujardin

A method for evaluating matrix polynomials have recently been developed that require one fewer matrix product ($1M$) than the Paterson--Stockmeyer (PS) method. Since the computational cost for large-scale matrices is asymptotically…

Numerical Analysis · Mathematics 2026-03-25 J. M. Alonso , J. Sastre , J. Ibáñez , E. Defez

We study the dynamics of polynomial-like mappings in several variables. A special case of our results is the following theorem. Let f be a proper holomorphic map from an open set U onto a Stein manifold V, $U\subset\subset V$. Assume f is…

Dynamical Systems · Mathematics 2007-05-23 T. C. Dinh , N. Sibony

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon

In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…

Computer Science and Game Theory · Computer Science 2026-01-19 Naoyuki Kamiyama

We propose a new way of thinking about one parameter persistence. We believe topological persistence is fundamentally not about decomposition theorems but a central role is played by a choice of metrics. Choosing a pseudometric between…

Algebraic Topology · Mathematics 2020-02-07 Wojciech Chachólski , Henri Riihimäki

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

Rings and Algebras · Mathematics 2019-01-31 Jurij Volčič

This paper is devoted to the study of preservation of eigenvalues, Jordan structure and complementary invariant subspaces of structured matrices under structured perturbations. Perturbations and structure-preserving perturbations are…

Numerical Analysis · Mathematics 2020-06-18 Tinku Ganai , Bibhas Adhikari

This article investigates the stability of the ground state subspace of a canonical parent Hamiltonian of a Matrix product state against local perturbations. We prove that the spectral gap of such a Hamiltonian remains stable under weak…

Mathematical Physics · Physics 2015-02-19 Oleg Szehr , Michael M. Wolf

We study the stability of the mesoscopic fluctuations of certain orthogonal polynomial ensembles on the real line utilizing the recurrence relation of the associated orthogonal polynomials. We prove that under a sparse enough decaying…

Mathematical Physics · Physics 2024-10-11 Daniel Ofner

This paper studies generic and perturbation properties inside the linear space of $m\times (m+n)$ polynomial matrices whose rows have degrees bounded by a given list $d_1, \ldots, d_m$ of natural numbers, which in the particular case $d_1 =…

Numerical Analysis · Mathematics 2017-12-12 Froilán M. Dopico , Paul Van Dooren

Many problems in systems and control theory can be formulated in terms of robust D-stability analysis, which aims at verifying if all the eigenvalues of an uncertain matrix lie in a given region D of the complex plane. Robust D-stability…

Optimization and Control · Mathematics 2018-06-19 Dario Piga , Alessio Benavoli

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

Classical Analysis and ODEs · Mathematics 2023-10-30 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…

Data Structures and Algorithms · Computer Science 2016-11-15 Damian Straszak , Nisheeth K. Vishnoi