Related papers: Numerical algorithm and complexity analysis for di…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
The two-scale computational homogenization method is proposed for modelling of locally periodic fluid-saturated media subjected a to large deformation induced by quasistatic loading. The periodic heterogeneities are relevant to the…
Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…
A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…
By a high-order numerical homogenization method, a heterogeneous multiscale scheme was developed in Jin & Li (2022) for evolving differential equations containing two time scales. In this paper, we further explore the technique to propose…
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
In this article, we explore the effectiveness of two polynomial methods in solving non-linear time and space fractional partial differential equations. We first outline the general methodology and then apply it to five distinct experiments.…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
The main goal of this paper is to study the discretization problem for the hyperbolic cross trigonometric polynomials. This important problem turns out to be very difficult. In this paper we begin a systematic study of this problem and…
In this note, the first-order Dickson polynomials are introduced through a particular case of the expression of the trace of the $n^{th}$ power of a matrix in terms of powers of the trace and determinant of the matrix itself. The technique…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
In this paper we consider a numerical homogenization technique for curl-curl-problems that is based on the framework of the Localized Orthogonal Decomposition and which was proposed in [D. Gallistl, P. Henning, B. Verf\"urth. SIAM J. Numer.…
Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…
In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…
In this work, we study a system of coupled Cahn-Hilliard equations describing the phase separation of a copolymer and a homopolymer blend. The numerical methods we propose are based on suitable combinations of existing schemes for the…
In this paper we show how to compute algorithmically the full set of algebraically independent constraints for singular mechanical and field-theoretical models with polynomial Lagrangians. If a model under consideration is not singular as a…
By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…