Related papers: Generalized companion matrix for approximate GCD
Let $F$ be a field of prime characteristic $p$ containing $F_{p^n}$ as a subfield. We refer to $q(X)=X^{p^n}-X-a\in F[X]$ as a generalized Artin-Schreier polynomial. Suppose that $q(X)$ is irreducible and let $C_{q(X)}$ be the companion…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
For an arbitrary quiver Q and dimension vector d we prove that the dimension of the space of cuspidal functions on the moduli stack of representations of Q of dimension d over a finite field F_q is given by a polynomial in q with rational…
We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…
We investigate the nucleon's chiral-odd generalized parton distribution functions (GPDs) in the large-$N_c$ limit of QCD. Extending previous work on the leading-order contribution in the $1/N_c$ expansion, we focus on the…
In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that…
We present a distributed asynchronous algorithm for approximating a single component of the solution to a system of linear equations $Ax = b$, where $A$ is a positive definite real matrix, and $b \in \mathbb{R}^n$. This is equivalent to…
The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…
In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…
In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the output. The polynomials are given via lists of their…
In this paper we develop an optimisation based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalised rational approximation. In the…
For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…
It is known that standard stochastic Galerkin methods face challenges when solving partial differential equations (PDEs) with random inputs. These challenges are typically attributed to the large number of required physical basis functions…
The problem of completing high-dimensional matrices from a limited set of observations arises in many big data applications, especially, recommender systems. Existing matrix completion models generally follow either a memory- or a…
Let $G$ be a reductive group over a local field $F$ of characteristic zero, Archimedean or not. Let $X$ be a $G$-space. In this paper we study the existence of generalized Whittaker quotients for the space of Schwartz functions on $X$,…
To a finite dimensional representation of a complex Lie group $G$, an associative algebra of adjoint covariant polynomial maps from the direct sum of $m$ copies of the Lie algebra $\mathfrak{g}$ of $G$ into an algebra of complex matrices is…