‎‎In this paper, Solvability nonlinear Volterra integral equations with general vanishing delays is stated. So far sinc methods for approximating the solutions of Volterra integral equations have received considerable attention mainly due to their high accuracy. These approximations converge rapidly to the exact solutions as number sinc points increases. Here the numerical solution of nonlinear...

In a recent paper, the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, and even polynomial in the size of the input. In this paper, we prove that some other higher moments are also finite. In particular, we show that the variance is polynomial in the size of the input.

We prove that the question of whether a given linear partial differential or difference equation with polynomial coefficients has non-zero polynomial solutions is algorithmically undecidable. However, for equations with constant coefficients this question can be decided very easily since such an equation has a non-zero polynomial solution iff its constant term is zero. We give a simple combinat...

By introducing the generalized master function of order up to four together with corresponding weight function, we have obtained all quasi-exactly solvable second order differential equations. It is shown that these differntial equations have solutions of polynomial type with factorziation properties, that is polynomial solutions Pm(E) can be factorized in terms of polynomial Pn+1(E) for m ≥ n+...

In this paper a numerical method for solving second order fuzzy differential equations under generalized differentiability is proposed. This method is based on the interpolating a solution by piecewise polynomial of degree 4 in the range of solution. Moreover we investigate the existence, uniqueness and convergence of approximate solutions. Finally the accuracy of piecewise approximate method b...

POLYNOMIAL systems of equations frequently arise in solid modelling, robotics, computer vision, chemistry, chemical engineering, and mechanical engineering. Locally convergent iterative methods such as quasi-Newton methods may diverge or fail to find all meaningful solutions of a polynomial system. This paper proposes a parallel homotopy algorithm for polynomial systems of equations that is gua...

Rank constraints on matrices emerge in many automatic control applications. In this short document we discuss how to rewrite the constraint into a polynomial equations of the elements in a the matrix. If addition semidefinite matrix constraints are included, the polynomial equations can be turned into an inequality. We also briefly discuss how to implement these polynomial constraints.

A Turaev–Viro invariant is a state sum, i.e., a polynomial that can be read off from a special spine or a triangulation of a compact 3-manifold. If the polynomial is evaluated at the solution of a certain system of polynomial equations (Biedenharn–Elliott equations) then the result is a homeomorphism invariant of the manifold (" numerical Turaev-Viro invariant "). The equation system defines an...