Related papers: La Budde's Method for Computing Characteristic Pol…
Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…
Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…
Broyden's method is a general method commonly used for nonlinear systems of equations, when very little information is available about the problem. We develop an approach based on Broyden's method for nonlinear eigenvalue problems. Our…
In this paper, we present a new method via the transfer matrix approach to obtain asymptotic formulae of orthogonal polynomials with asymptotically identical coefficients of bounded variation. We make use of the hyperbolicity of the…
We study the characteristic polynomial $p_{n}(x)=\prod_{j=1}^{n}(|z_{j}|-x)$ where the $z_{j}$ are drawn from the Mittag-Leffler ensemble, i.e. a two-dimensional determinantal point process which generalizes the Ginibre point process. We…
A hyperbolic polynomial (HP) is a real univariate polynomial with all roots real. By Descartes' rule of signs a HP with all coefficients nonvanishing has exactly $c$ positive and exactly $p$ negative roots counted with multiplicity, where…
We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…
A new method of algebraic nature is proposed for the study of the asymptotic properties of special polynomials. The technique we foresee is based on the use of umbral operators, allowing a unified treatment of a large body of polynomial…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
For a second-order linear differential equation with two irregular singular points of rank three, multiple Laplace-type contour integral solutions are considered. An explicit formula in terms of the Stokes multipliers is derived for the…
In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.
The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…
We characterize the relationship between the singular values of a complex Hermitian (resp., real symmetric, complex symmetric) matrix and the singular values of its off-diagonal block. We also characterize the eigenvalues of an Hermitian…
We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
We consider the problem of tracking one solution path defined by a polynomial homotopy on a parallel shared memory computer. Our robust path tracker applies Newton's method on power series to locate the closest singular parameter value. On…
An efficient algorithm for computing eigenvectors of a matrix of integers by exact computation is proposed. The components of calculated eigenvectors are expressed as polynomials in the eigenvalue to which the eigenvector is associated, as…
The main difficulty in solving the Helmholtz equation within polygons is due to non-analytic vertices. By using a method nearly identical to that used by Fox, Henrici, and Moler in their 1967 paper; it is demonstrated that such eigenvalue…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…