Related papers: Generalized companion matrix for approximate GCD
We show that with any finite partially ordered set one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is…
We propose a numerical linear algebra based method to find the multiplication operators of the quotient ring $\mathbb{C}[x]/I$ associated to a zero-dimensional ideal $I$ generated by $n$ $\mathbb{C}$-polynomials in $n$ variables. We assume…
In this paper we study the generalized Clifford algebra defined by Pappacena of a monic (with respect to the first variable) homogeneous polynomial $\Phi(Z,X_1,\dots,X_n)=Z^d-\sum_{k=1}^d f_k(X_1,\dots,X_n) Z^{d-k}$ of degree $d$ in $n+1$…
The main result of the present theoretical paper is an original decomposition formula for the proximal operator of the sum of two proper, lower semicontinuous and convex functions $f$ and $g$. For this purpose, we introduce a new operator,…
We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…
In recent years, there has been a breakthrough in lattice calculations of $x$-dependent partonic distributions. This encompasses also distributions describing the 3D structure of the nucleon, such as generalized parton distributions (GPDs).…
We consider the numerical solution of the continuous algebraic Riccati equation $A^*X+XA-XFX+G=0$, with $F=F^*, G=G^*$ of low rank and $A$ large and sparse. We develop an algorithm for the low rank approximation of $X$ by means of an…
We present a Bayesian scheme for the approximate diagonalisation of several square matrices which are not necessarily symmetric. A Gibbs sampler is derived to simulate samples of the common eigenvectors and the eigenvalues for these…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.
This article characterizes the rank-one factorization of auto-correlation matrix polynomials. We establish a sufficient and necessary uniqueness condition for uniqueness of the factorization based on the greatest common divisor (GCD) of…
In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…
In recent years, substantial progress has been made on Graph Convolutional Networks (GCNs). However, the computing of GCN usually requires a large memory space for keeping the entire graph. In consequence, GCN is not flexible enough,…
For a locally compact group $G$, let $A^n(G)$ denote the multidimensional Fourier algebra given by $ \otimes_{n}^{eh} A(G).$ This work explores the approximation identity and operator amenability of the algebra $A^n(G)$. Further, we study…
Hedges' unbiased estimator g* has been broadly used in statistics. We propose a sequence of polynomials to better approximate the multiplicative correction factor of g* by incorporating analytic estimations to the ratio of gamma functions.
Generalized parton distributions at large $x$ are studied in perturbative QCD approach. As $x\to 1$ and at finite $t$, there is no $t$ dependence for the GPDs which means that the active quark is at the center of the transverse space. We…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…
$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…
We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…