Related papers: On Computing the Kronecker Structure of Polynomial…
Loewner matrix pencils play a central role in the system realization theory of Mayo and Antoulas, an important development in data-driven modeling. The eigenvalues of these pencils reveal system poles. How robust are the poles recovered via…
Our purpose is to give new proofs of several known results about perturbations of matrix pencils. Andrzej Pokrzywa (1986) described the closure of orbit of a Kronecker canonical pencil $A-\lambda B$ in terms of inequalities with pencil…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
This article gives a precise description of the Fatou sets and Julia sets of matrix-valued polynomials in $\mathcal{M}(2,\mathbb{C})$ in terms of the corresponding polynomials in $\mathbb{C}$. Further, we construct Green functions and…
We study complex one-dimensional parameter slices in a three-parameter family of rational maps with two free critical points, obtained by imposing the existence of periodic orbits with prescribed multipliers. Using explicit…
In this work, by using Pauli matrices, we introduce four families of polynomials indexed over the positive integers. These polynomials have rational or imaginary rational coefficients. It turns out that two of these families are closely…
The aim of this work is to describe the equivalence relations in $\Q/\Z$ that arise as the rational lamination of polynomials with all cycles repelling. We also describe where in parameter space one can find a polynomial with all cycles…
Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…
Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
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…
We present a new package Theta.jl for computing with the Riemann theta function. It is implemented in Julia and offers accurate numerical evaluation of theta functions with characteristics and their derivatives of arbitrary order. Our…
We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…
We give examples of infinitely renormalizable quadratic polynomials $F_c: z\maps to z^2+c$ with stationary combinatorics whose Julia sets have Hausdorff dimension arbitrar y close to 1. The combinatorics of the renormalization involved is…
Let $f$ be a rational map with degree $d\geq 2$ whose Julia set is connected but not equal to the whole Riemann sphere. It is proved that there exists a rational map $g$ such that $g$ contains a buried Julia component on which the dynamics…
We present an algorithm for a rigorous computation of lower bounds on the Hausdorff dimensions of Julia sets for a wide class of holomorphic maps. We apply this algorithm to obtain lower bounds on the Hausdorff dimension of the Julia sets…
We analyze different approaches to differential-algebraic equations with attention to the implemented rank conditions of various matrix functions. These conditions are apparently very different and certain rank drops in some matrix…
We study the functional equation $A\circ X=X\circ B$, where $A,$ $B$, and $X$ are polynomials over $\mathbb C$. Using previous results of the author about polynomials sharing preimages of compact sets, we show that for given $B$ its…