Related papers: On the application of Laguerre's method to the pol…

We first show the existence and nature of convergence to a limiting set of roots for polynomials in a three-term recurrence of the form $p_{n+1}(z) = Q_k(z)p_{n}(z)+ \gamma p_{n-1}(z)$ as $n$ $\rightarrow$ $\infty$, where the coefficient…

We present the first systematic work for deriving a posteriori error estimates for general non-polynomial basis functions in an interior penalty discontinuous Galerkin (DG) formulation for solving eigenvalue problems associated with second…

We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…

In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…

We study some aspects of the invariant pair problem for matrix polynomials, as introduced by Betcke and Kressner and by Beyn and Thuemmler. Invariant pairs extend the notion of eigenvalue-eigenvector pairs, providing a counterpart of…

In this paper, we propose a type of tensor-neural-network-based machine learning method to compute multi-eigenpairs of high dimensional eigenvalue problems without Monte-Carlo procedure. Solving multi-eigenvalues and their corresponding…

Using the theory of orthogonal polynomials, their associated recursion relations and differential formulas we develop a method for evaluating new integrals. The method is illustrated by obtaining a closed-form expression for the value of an…

We present a new eigenvalue method for solving a system of Laurent polynomial equations defining a zero-dimensional reduced subscheme of a toric compactification $X$ of $(\mathbb{C} \setminus \{0\})^n$. We homogenize the input equations to…

Consider the Laguerre polynomials and deform them by the introduction in the measure of an exponential singularity at zero. In [Chen Y., Its A., J. Approx. Theory 162 (2010), 270-297, arXiv:0808.3590] the authors proved that this…

In this paper, a novel multigrid method based on Newton iteration is proposed to solve nonlinear eigenvalue problems. Instead of handling the eigenvalue $\lambda$ and eigenfunction $u$ separately, we treat the eigenpair $(\lambda, u)$ as…

As showed in (Fiedler, 1990), any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be…

A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…

In latest years, several advancements have been made in symbolic-numerical eigenvalue techniques for solving polynomial systems. In this article, we add to this list. We design an algorithm which solves systems with isolated solutions…

The distribution function for the first eigenvalue spacing in the Laguerre unitary ensemble of finite size may be expressed in terms of a solution of the fifth Painleve transcendent. The generating function of a certain discontinuous linear…

The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue problem for a pencil of Hessenberg matrices. Two procedures are…

Trigonometric formulas for eigenvalues of $3 \times 3$ matrices that build on Cardano's and Vi\`ete's work on algebraic solutions of the cubic are numerically unstable for matrices with repeated eigenvalues. This work presents numerically…

We devise a simple but remarkably accurate iterative routine for calculating the roots of a polynomial of any degree. We demonstrate that our results have significant improvement in accuracy over those obtained by methods used in popular…

We describe two algorithms for the eigenvalue, eigenvector problem which, on input a Gaussian matrix with complex entries, finish with probability 1 and in average polynomial time.

We present the Matlab toolbox MacaulayLab, which implements numerical linear algebra algorithms for solving multivariate polynomial systems and rectangular multiparameter eigenvalue problems. Its structure and functionality are the result…

In this work we discuss the possibility to reduce the computational complexity of modal methods, i.e. methods based on eigenmodes expansion, from the third power to the second power of the number of eigenmodes. The proposed approach is…