Related papers: On Computing the Kronecker Structure of Polynomial…
TopologicalNumbers.jl is an open-source Julia package designed to calculate topological invariants, mathematical quantities that characterize the properties of materials in condensed matter physics. These invariants, such as the Chern…
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…
We present Groebner.jl, a Julia package for computing Groebner bases with the F4 algorithm. Groebner.jl is an efficient, portable, and open-source software. Groebner.jl works over integers modulo a prime and over the rationals, supports…
For a probability measure with compact and non-polar support in the complex plane we relate dynamical properties of the associated sequence of orthogonal polynomials $\{P_n\}$ to properties of the support. More precisely we relate the Julia…
Our aim in this paper is two-fold: First, for computing zeros of a linear time-invariant (LTI) system $\Sigma$ in {\em state-space form}, we introduce a "trimmed structured linearization", which we refer to as {\em Rosenbrock…
We analyze when an arbitrary matrix pencil is equivalent to a dissipative Hamiltonian pencil and show that this heavily restricts the spectral properties. In order to relax the spectral properties, we introduce matrix pencils with…
Matrix pencils, or pairs of matrices, are used in a variety of applications. By the Kronecker decomposition Theorem, they admit a normal form. This normal form consists of four parts, one part based on the Jordan canonical form, one part…
Paul Van Dooren [Linear Algebra Appl. 27 (1979) 103-140] constructed an algorithm for the computation of all irregular summands in Kronecker's canonical form of a matrix pencil. The algorithm is numerically stable since it uses only unitary…
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…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
We characterize the existence of a polynomial (rational) matrix when its eigenstructure (complete structural data) and some of its rows are prescribed. For polynomial matrices, this problem was solved in a previous work when the polynomial…
The work is devoted to investigation of the canonical structure of regular, in domain of definition ${\cal U}\subseteq {\mathbb R}^{m}$, the pencil of matrix-functions $A(x)+\lambda B(x)$. It is supposed that $\det A(x)\equiv 0$ and $\det…
The set of mxn singular matrix pencils with normal rank at most r is an algebraic set with r+1 irreducible components. These components are the closure of the orbits (under strict equivalence) of r+1 matrix pencils which are in Kronecker…
This will is an expository description of quadratic rational maps. Sections 2 through 6 are concerned with the geometry and topology of such maps. Sections 7--10 survey of some topics from the dynamics of quadratic rational maps. There are…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
The Fatou-Julia theory for rational functions has been extended both to transcendental meromorphic functions and more recently to several different types of quasiregular mappings in higher dimensions. We extend the iterative theory to…
Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
In this paper, we discuss tensegrity from the perspective of nonlinear algebra in a manner accessible to undergraduates. We compute explicit examples and include the SAGE and Julia code so that readers can continue their own experiments and…
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…