Related papers: Comparative Analysis of Polynomials with Their Com…
Exceptionally elegant formulae exist for the fractional Laplacian operator applied to weighted classical orthogonal polynomials. We utilize these results to construct a solver, based on frame properties, for equations involving the…
In this work, we propose a new way to (non-interactively, verifiably) demonstrate quantum advantage by solving the average-case $\mathsf{NP}$ search problem of finding a solution to a system of (underdetermined) constant degree multivariate…
Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial…
While approaches to model the progression of fracture have received significant attention, methods to find the solution to the associated nonlinear equations have not. In general, nonlinear solution methods and optimization methods have a…
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…
We provide a fast and simple method to solve fractional variational problems with dependence on Hadamard fractional derivatives. Using a relation between the Hadamard fractional operator and a sum involving integer-order derivatives, we…
The numerical solution of differential equations can be formulated as an inference problem to which formal statistical approaches can be applied. However, nonlinear partial differential equations (PDEs) pose substantial challenges from an…
In this paper, a non-polynomial spectral Petrov-Galerkin method and associated collocation method for substantial fractional differential equations (FDEs) are proposed, analyzed, and tested. We extend a class of generalized Laguerre…
We examine several of the normal-form multivariate polynomial rootfinding methods of Telen, Mourrain, and Van Barel and some variants of those methods. We analyze the performance of these variants in terms of their asymptotic temporal…
Fractional statistical moments are utilized for various tasks of uncertainty quantification, including the estimation of probability distributions. However, an estimation of fractional statistical moments of costly mathematical models by…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…
We present a novel solution method for It\^o stochastic differential equations (SDEs). We subdivide the time interval into sub-intervals, then we use the quadratic polynomials for the approximation between two successive intervals. The main…
We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of C. Bender and E. Ben-Naim. We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…
In the paper, using Nevanlinna's value distribution theory of meromorphic functions in $\mathbb{C}^m$, we study for the existence of entire solutions $f$ in $\mathbb{C}^m$ of the following algebraic partial differential equation…
We introduce a general notion of fractional (noninteger) derivative for functions defined on arbitrary time scales. The basic tools for the time-scale fractional calculus (fractional differentiation and fractional integration) are then…
Algorithms and underlying mathematics are presented for numerical computation with periodic functions via approximations to machine precision by trigonometric polynomials, including the solution of linear and nonlinear periodic ordinary…
We consider a system of differential equations and obtain its solutions with exponential asymptotics and analyticity with respect to the spectral parameter. Solutions of such type have importance in studying spectral properties of…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…