Related papers: The Pad\'e iterations for the matrix sign function…
We construct fast, structure-preserving iterations for computing the sign decomposition of a unitary matrix $A$ with no eigenvalues equal to $\pm i$. This decomposition factorizes $A$ as the product of an involutory matrix $S =…
We construct a family of iterations for computing the principal square root of a square matrix $A$ using Zolotarev's rational minimax approximants of the square root function. We show that these rational functions obey a recursion, allowing…
Let $K$ be an algebraically closed field that is complete with respect to a non-Archimedean absolute value, and let $\varphi\in K(z)$ have degree $d\geq 2$. We characterize maps for which the minimal resultant of an iterate $\varphi^n$ is…
We study the Poincar\'e series of the mixed and pure trace rings of generic matrices. These series are known to be rational functions. We obtain an explicit formula in lowest terms in the case of $2\times2$ matrices; a denominator, which we…
In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…
The iteration of rational maps is well-understood in dimension 1 but less so in higher dimensions. We study some maps on spaces of matrices which present a weak complexity with respect to the ring structure. First we give some properties of…
In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational…
A {\it sign pattern matrix} is a matrix whose entries are from the set $\{+,-, 0\}$. The minimum rank of a sign pattern matrix $A$ is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries…
General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques,…
The main purpose of this paper is to give a solution to a conjecture concerning a Pad\'{e} family of iterations for the matrix sector function that was recently raised by B. Laszkiewicz et al in [A Pad\'{e} family of iterations for the…
We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…
We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…
In our previous work we studied minimal fractional decompositions of a rational matrix pseudodifferential operator: H=A/B, where A and B are matrix differential operators, and B is non-degenerate of minimal possible degree deg(B). In the…
We give a complete characterization of degree two rational maps with potential good reduction over local fields. We show this happens exactly when the map corresponds to an integral point in the moduli space. We detail an algorithm by which…
We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…
A landmark result from rational approximation theory states that $x^{1/p}$ on $[0,1]$ can be approximated by a type-$(n,n)$ rational function with root-exponential accuracy. Motivated by the recursive optimality property of Zolotarev…
Let $A$ be a real matrix. The term rank of $A$ is the smallest number $t$ of lines (that is, rows or columns) needed to cover all the nonzero entries of $A$. We prove a conjecture of Li et al. stating that, if the rank of $A$ exceeds $t-3$,…
We show, that the Complex Step approximation to the Fr\'echet derivative of real matrix functions is applicable to the matrix sign, square root and polar mapping using iterative schemes. While this property was already discovered for the…
We consider the proximal-gradient method for minimizing an objective function that is the sum of a smooth function and a non-smooth convex function. A feature that distinguishes our work from most in the literature is that we assume that…
In this paper, we investigate the trade-off between convergence rate and computational cost when minimizing a composite functional with proximal-gradient methods, which are popular optimisation tools in machine learning. We consider the…