Related papers: Complanart of polynomial equations
In this work we present a framework for studying the eigenvalues of a family of matrices with a particular displacement structure. The family admits a specific decomposition as the product of an upper and a lower triangular matrices having…
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…
We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
Solving polynomial eigenvalue problems with eigenvector nonlinearities (PEPv) is an interesting computational challenge, outside the reach of the well-developed methods for nonlinear eigenvalue problems. We present a natural generalization…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
We consider the singular vectors of any $m \times n$ submatrix of a rectangular $M \times N$ Gaussian matrix and study their asymptotic overlaps with those of the full matrix, in the macroscopic regime where $N \,/\, M\,$, $m \,/\, M$ as…
This paper considers an idempotent and symmetrical algebraic structure as well as some closely related concept. A special notion of determinant is introduced and a Cramer formula is derived for a class of limit systems derived from the…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
Covariant vectors, Lyapunov vectors, or Oseledets vectors are increasingly being used for a variety of model analyses in areas such as partial differential equations, nonautonomous differentiable dynamical systems, and random dynamical…
In this paper, we propose a new convex approach to stability analysis of nonlinear systems with polynomial vector fields. First, we consider an arbitrary convex polytope that contains the equilibrium in its interior. Then, we decompose the…
Poincar\'e gave a criterion which determines the shape of equilibrium for planar differential equations. In his statement, he excluded the case of repeated eigenvalues. In fact, in such a case, we can give a $C^1$ counter-example to his…
In this paper, we investigate several properties of the solution maps of variational inequalities with polynomial data. First, we prove some facts on the $R_0$-property, the local boundedness, and the upper semicontinuity of the solution…
There are two well known tasks, related to Newton polyhedra: to study invariants of singularities in terms of their Newton polyhedra, and to describe Newton polyhedra of resultants and discriminants. We introduce so called resultantal…
In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…
A fundamental problem in computational algebraic geometry is the computation of the resultant. A central question is when and how to compute it as the determinant of a matrix. whose elements are the coefficients of the input polynomials…
In this paper we introduce a class of polygonal complexes for which we can define a notion of sectional combinatorial curvature. These complexes can be viewed as generalizations of 2-dimensional Euclidean and hyperbolic buildings. We focus…
The Lyapunov exponents of a chaotic system quantify the exponential divergence of initially nearby trajectories. For Hamiltonian systems the exponents are related to the eigenvalues of a symplectic matrix. We make use of this fact to…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
This paper contains a re-evaluation of the spectral approach and factorizability for regular matrix polynomials. In addition, solvent theory is extended from the monic and comonic cases to the regular case. The classification of extended…