Related papers: A developed new algorithm for evaluating Adomian p…
We consider the number of linear extensions of an N-free order P. We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
The purpose of this paper is to present a new class of operators known as polynomially hypo-EP operators, extending the notation of hypo-EP, $n$-hypo-EP, and polynomially EP. The paper explores numerous properties and characterizations of…
A growing number of problems in computational mathematics can be reduced to the solution of many linear systems that are related, often depending smoothly or slowly on a parameter $p$, that is, $A(p)x(p)=b(p)$. We introduce an efficient…
We give a new algorithmic method of detection of atypical values for 2-variables real polynomial functions with emphasis on the effectivity.
This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality…
Iverson's APL and its descendants (such as J, K and FISh) are examples of the family of "rank-polymorphic" programming languages. The principal control mechanism of such languages is the general lifting of functions that operate on arrays…
The paper describes a new algorithm of construction of the nonlinear arithmetic triangle on the basis of numerical simulation and the binary system. It demonstrates that the numbers that fill the nonlinear arithmetic triangle may be…
Pseudo-differential operator equations with parameter are studied. Uniform separability properties and resolvent estimates are obtained in terms of fractional derivatives. Moreover, maximal regularity properties of the pseudo-differential…
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…
In this paper, an original reduction algorithm for solving simultaneous multivariate polynomial equations is presented. The algorithm is exponential in complexity, but the well-known algorithms, such as the extended Euclidean algorithm and…
We consider new polynomially solvable cases of the well-known Quadratic Assignment Problem involving coefficient matrices with a special diagonal structure. By combining the new special cases with polynomially solvable special cases known…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…
We present a flexible data-driven method for dynamical system analysis that does not require explicit model discovery. The method is rooted in well-established techniques for approximating the Koopman operator from data and is implemented…
We show that for every homogeneous polynomial of degree $d$, if it has determinantal complexity at most $s$, then it can be computed by a homogeneous algebraic branching program (ABP) of size at most $O(d^5s)$. Moreover, we show that for…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…
We consider the problem of existence of polynomials with small norm. This range of problems has been extensively studied by many authors in the case of the unit circle (or a compact Abelian group), i.e. when the characters are bounded. In…