English
Related papers

Related papers: Linearizations of Quadratic Two-parameter Matrix P…

200 papers

Given a quadratic two-parameter matrix polynomial Q, we develop a systematic approach to generating a vector space of linear two-parameter matrix polynomials. We identify a set of linearizations of Q that lie in the vector space. Finally,…

Numerical Analysis · Mathematics 2012-01-09 Bibhas Adhikari

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…

Numerical Analysis · Mathematics 2016-07-06 Leonardo Robol , Raf Vandebril , Paul Van Dooren

We show how to construct linearizations of matrix polynomials $z\mathbf{a}(z)\mathbf{d}_0 + \mathbf{c}_0$, $\mathbf{a}(z)\mathbf{b}(z)$, $\mathbf{a}(z) + \mathbf{b}(z)$ (when $\mathrm{deg}\left(\mathbf{b}(z)\right) <…

Numerical Analysis · Mathematics 2018-05-30 Eunice Y. S. Chan , Robert M. Corless , Laureano Gonzalez-Vega , J. Rafael Sendra , Juana Sendra

Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…

Rings and Algebras · Mathematics 2017-03-03 Heike Faßbender , Philip Saltenberger

The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…

Combinatorics · Mathematics 2022-11-23 Eimear Byrne , Michela Ceria , Sorina Ionica , Relinde Jurrius

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…

Dynamical Systems · Mathematics 2018-05-16 Magnus Aspenberg , Pascale Roesch

There are many specific results, spread over the literature, regarding the dualisation of quadrics in projective spaces and quadratic forms on vector spaces. In the present work we aim at generalising and unifying some of these. We start…

Algebraic Geometry · Mathematics 2025-07-01 Hans Havlicek

In a previous paper, we have given an algebraic model to the set of intervals. Here, we apply this model in a linear frame. We define a notion of diagonalization of square matrices whose coefficients are intervals. But in this case, with…

Numerical Analysis · Mathematics 2010-06-29 Nicolas Goze

Consider a multivariable state space system and associated transfer function G({\lambda}). The aim of this paper is to define and analyze two vector spaces of matrix pencils associated with the matrix G({\lambda}) and show that almost all…

Optimization and Control · Mathematics 2024-05-28 Avisek Bist , Namita Behera

The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…

Numerical Analysis · Mathematics 2014-08-26 Federico Poloni

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

Functional Analysis · Mathematics 2023-03-01 Sriram Balasubramanian , Neha Hotwani , Scott McCullough

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Commutative Algebra · Mathematics 2012-10-09 Joost Berson

We revisit the landmark paper [D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann, SIAM J. Matrix Anal. Appl., 28 (2006), pp.~971--1004] and, by viewing matrices as coefficients for bivariate polynomials, we provide concise proofs for key…

Numerical Analysis · Mathematics 2016-10-07 Yuji Nakatsukasa , Vanni Noferini , Alex Townsend

This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…

Numerical Analysis · Mathematics 2022-11-07 Rima Khouja , Bernard Mourrain , Jean-Claude Yakoubsohn

Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…

High Energy Physics - Theory · Physics 2011-03-07 A. A. Andrianov , M. V. Ioffe , Tsu Zhun-Pin

A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Diego Ruano

A number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory results for linearizations need to be related back to matrix polynomials. In this paper we…

Numerical Analysis · Mathematics 2020-08-06 Andrii Dmytryshyn

Matrix (or operator) recovery from linear measurements is a well-studied problem. However, there are situations where only bilinear or quadratic measurements are available. A bilinear or quadratic problem can easily be transformed into a…

Signal Processing · Electrical Eng. & Systems 2020-02-14 Michalina Pacholska , Karen Adam , Adam Scholefield , Martin Vetterli

The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…

Classical Analysis and ODEs · Mathematics 2014-04-16 Charles F. Dunkl

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
‹ Prev 1 2 3 10 Next ›