Related papers: Solving Equations Using Khovanskii Bases
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
In this note we present an algorithm to generate new Schr\" odinger type equations explicitly solvable in terms of orthogonal polynomials or associated special functions.
We study the existence of Khovanskii-finite valuations for rational curves of arithmetic genus two. We provide a semi-explicit description of the locus of degree $n+2$ rational curves in $\mathbb{P}^n$ of arithmetic genus two that admit a…
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…
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…
In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a companion matrix we design a fast and computationally simple…
An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when…
In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…
In this paper we develop a new method which is a generalization of the Obreshkoff -Ehrlich method for the cases of algebraic, trigonometric and exponential polynomials. This method has a cubic rate of convergence. It is efficient from the…
Grothendieck polynomials are important objects in the study of the $K$-theory of flag varieties. Their many remarkable properties have been studied in the context of algebraic geometry and tableaux combinatorics. We explore a new tool,…
In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the $n\times n$ matrix polynomial of arbitrary degree $k$. Given a set of $m$ eigenpairs ($1 \leqslant m \leqslant kn$), this problem…
We encode the binomials belonging to the toric ideal $I_A$ associated with an integral $d \times n$ matrix $A$ using a short sum of rational functions as introduced by Barvinok \cite{bar,newbar}. Under the assumption that $d,n$ are fixed,…
The eigenvalue problem plays a central role in linear algebra and its applications in control and optimization methods. In particular, many matrix decompositions rely upon computation of eigenvalue-eigenvector pairs, such as diagonal or…
A classification theorem for linear differential equations in two variables (one real and one Grassmann) having polynomial solutions(the generalized Bochner problem) is given. The main result is based on the consideration of the eigenvalue…
This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…
In many applications, the information about the number of eigenvalues inside a given region is required. In this paper, we propose a contour-integral based method for this purpose. The new method is motivated by two findings. There exist…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
The parabolic Kazhdan-Lusztig polynomials for Grassmannians can be computed by counting Dyck partitions. We "lift" this combinatorial formula to the corresponding category of singular Soergel bimodules to obtain bases of the Hom spaces…
Let $X$ be an analytic space of pure dimension. We introduce a formalism to generate intrinsic weighted Koppelman formulas on $X$ that provide solutions to the $\dbar$-equation. We obtain new existence results for the $\dbar$-equation, as…