Related papers: A developed new algorithm for evaluating Adomian p…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

A reduced-order model algorithm, called ALP, is proposed to solve nonlinear evolution partial differential equations. It is based on approximations of generalized Lax pairs. Contrary to other reduced-order methods, like Proper Orthogonal…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…

We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…

In this work, we apply Adomian decomposition method for solving nonlinear derivative-dependent doubly singular boundary value problems: $(py')'= qf(x,y,y')$. This method is based on the modification of ADM and new two-fold integral…

We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…

The Adomian decomposition method is a semi-analytical method for solving ordinary and partial nonlinear differential equations. The aim of this paper is to apply Adomian decomposition method to obtain approximate solutions of nonlinear…

In this paper we consider the problem of minimizing composite objective functions consisting of a convex differentiable loss function plus a non-smooth regularization term, such as $L_1$ norm or nuclear norm, under R\'enyi differential…

We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…

We propose a new polynomial-time algorithm for linear programming. We further extend the ideas used in this new linear programming algorithm for nonlinear programming problems. The new algorithm is based on the idea of treating the…

We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP…

Approximate message passing (AMP) is a family of iterative algorithms that generalize matrix power iteration. AMP algorithms are known to optimally solve many average-case optimization problems. In this paper, we show that a large class of…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

This write-up contains some minor results and notes related to our work [HQ15] (some of them already known in the literature). In particular, it shows the following: - We show that a graph with polynomial expansion have sublinear…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

The Adomian Decomposition Method (ADM) is a very effective approach for solving broad classes of nonlinear partial and ordinary differential equations, with important applications in different fields of applied mathematics, engineering,…