Related papers: Computing the Fr\'echet Derivative of the Polar De…
The Adomian decomposition method is a semi-analytical method for solving ordinary and partial nonlinear differential equations. The aim of this paper is to apply Adomian decomposition method to obtain approximate solutions of nonlinear…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…
A recently developed numerical method for the calculation of derivatives of functions of general complex matrices, which can also be combined with implicit matrix function approximations such as Krylov-Ritz type algorithms, is presented. An…
This paper considers the factorization of elliptic symbols which can be represented by matrix-valued functions. Our starting point is a \textit{Fundamental Factorization Theorem}, due to Budjanu and Gohberg. We critically examine the work…
We establish some partial fraction identities for rational functions whose denominators are implicit products of the cyclotomic polynomials. To achieve this, we first develop a general algebraic approach for partial fraction decomposition…
In this paper we used the finite Fourier transformation to obtain the polar decomposition of the q-deformed boson algebra with $q$ a root of unity.
We derive a CUR matrix factorization based on the Discrete Empirical Interpolation Method (DEIM). For a given matrix $A$, such a factorization provides a low rank approximate decomposition of the form $A \approx C U R$, where $C$ and $R$…
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a…
We analyze the Fr\'echet derivative $F$, that maps a perturbation in conductivity to the linearized change in boundary measurements governed by the conductivity equation. The domain is taken to be the unit ball $B \subset \mathbb{R}^d$ with…
We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…
The decomposition in partial fractions of the quotient of Pochhammer symbols improves considerably a method, suggested in a precedent paper, which allows one to obtain the $\varepsilon$-expansion of functions of the hypergeometric class.…
The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…
In this article we prove the existence of the polar decomposition for densely defined closed right linear operators in quaternionic Hilbert spaces: If $T$ is a densely defined closed right linear operator in a quaternionic Hilbert space…
Let $q=2^f$, and let $G=\mathrm{SO}_8^+(q)$ and $U$ be a Sylow $2$-subgroup of $G$. We first describe the fusion of the conjugacy classes of $U$ in $G$. We then use this information to prove the unitriangularity of the $\ell$-decomposition…
The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…
In this work, we consider a rational approximation of the exponential function to design an algorithm for computing matrix exponential in the Hermitian case. Using partial fraction decomposition, we obtain a parallelizable method, where the…
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
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 =…
The simple product formulae for derivatives of scalar functions raised to different powers are generalized for functions which take values in the set of symmetric positive definite matrices. These formulae are fundamental in derivation of…