Related papers: A note on interpolation series in the complex doma…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
We extend Newton and Lagrange interpolation to arbitrary dimensions. The core contribution that enables this is a generalized notion of non-tensorial unisolvent nodes, i.e., nodes on which the multivariate polynomial interpolant of a…
Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…
We define the toric Newton spectrum of a polynomial and we give some applications in singularity theory, combinatorics and mirror symmetry.
We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.
In this paper we study the Newton's method for finding a singularity of a differentiable vector field defined on a Riemannian manifold. Under the assumption of invertibility of covariant derivative of the vector field at its singularity, we…
It was recently shown that the theory of linear stochastic systems can be viewed as a particular case of the theory of linear systems on a certain commutative ring of power series in a countable number of variables. In the present work we…
Based on a generalized Newton's identity, we construct a family of symmetric functions which deform the modular Hall-Littlewood functions. We also give a determinant formula for the Macdonald functions.
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
Thom polynomials provide universal formulas for the fundamental class of singularity loci in terms of characteristic classes. Ohmoto extended this notion to SSM-Thom polynomials, which refine this description by capturing the richer…
We prove a generalization of the polarization identity of linear algebra expressing the inner product of a complex inner product space in terms of the norm, where the field of scalars is extended to an associative algebra equipped with an…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. We extend its application to the case of formal power series over a field of arbitrary characteristic and illustrate the proposed approach…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
In this paper, we introduce the so-called elliptic Askey-Wilson polynomials which are homogeneous polynomials in two special theta functions. With regard to the significance of polynomials of such kind, we establish some general elliptic…
We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…
We study some series expansions for the Lambert $W$ function. We show that known asymptotic series converge in both real and complex domains. We establish the precise domains of convergence and other properties of the series, including…
Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…
We present a modification of Newton's method to restore quadratic convergence for isolated singular solutions of polynomial systems. Our method is symbolic-numeric: we produce a new polynomial system which has the original multiple solution…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…