Related papers: Computing the Characteristic Polynomial of Generic…
Toeplitz matrices arise naturally in harmonic analysis, operator theory, and numerical analysis. In this note we investigate Toeplitz matrices whose coefficients depend on the matrix size through a scaled kernel $a_k=f(k/n)$. We show that…
Can one recover a matrix efficiently from only matrix-vector products? If so, how many are needed? This paper describes algorithms to recover matrices with known structures, such as tridiagonal, Toeplitz, Toeplitz-like, and hierarchical…
We investigate the large $N$ behavior of the smallest eigenvalue, $\lambda_{N}$, of an $\left(N+1\right)\times \left(N+1\right)$ Hankel (or moments) matrix $\mathcal{H}_{N}$, generated by the weight…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Block Toeplitz matrices, using only matrix-vector products, and with a complexity of…
In this paper, we investigate properties of a symmetric Toeplitz matrix and a Hankel matrix by studying the components of its graph. To this end, we introduce the notion of ``weighted Toeplitz graph" and ``weighted Hankel graph", which are…
We study the integer minimization of a quasiconvex polynomial with quasiconvex polynomial constraints. We propose a new algorithm that is an improvement upon the best known algorithm due to Heinz (Journal of Complexity, 2005). This…
An improved characteristic set algorithm for solving Boolean polynomial systems is proposed. This algorithm is based on the idea of converting all the polynomials into monic ones by zero decomposition, and using additions to obtain…
We study a sequence of polynomials orthogonal with respect to a one parameter family of weights $$ w(x):=w(x,t)=\rex^{-t/x}\:x^{\al}(1-x)^{\bt},\quad t\geq 0, $$ defined for $x\in[0,1].$ If $t=0,$ this reduces to a shifted Jacobi weight.…
The computation of the exponential of a tridiagonal matrix and its applications have always been of interest. One application considered here is when the method of lines is used to solve the heat equation, where the equation is transformed…
Every homogeneous Riemannian C_0-space (N,g) is associated with its minimal polynomial. To provide explicit examples, we compute the minimal polynomials for generalized Heisenberg groups equipped with their canonical left-invariant metrics.
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
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)…
We investigate the simplest class of hyperdeterminants defined by Cayley in the case of Hankel hypermatrices (tensors of the form $A_{i_1i_2... i_k}=f(i_1+i_2+...+i_k)$). It is found that many classical properties of Hankel determinants can…
The joint moments of the derivatives of the characteristic polynomial of a random unitary matrix, and also a variant of the characteristic polynomial that is real on the unit circle, in the large matrix size limit, have been studied…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
We review the Preparata-Sarwate algorithm, a simple $O(n^{3.5})$ method for computing the characteristic polynomial, determinant and adjugate of an $n \times n$ matrix using only ring operations together with exact divisions by small…
Inversion of Toeplitz matrices with singular symbol. Minimal eigenvalues. Three results are stated in this paper. The first one is devoted to the study of the orthogonal polynomial with respect of the weight $\varphi_{\alpha} (\theta)=\vert…
We consider the relation of the multi-component 2D Toda hierarchy with matrix orthogonal and biorthogonal polynomials. The multi-graded Hankel reduction of this hierarchy is considered and the corresponding generalized matrix orthogonal…