Related papers: Hilbert quasi-polynomial for order domains and app…
Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…
Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.
We provide a complete solution to the problem of extending arbitrary semistar operations of an integral domain $D$ to semistar operations of the polynomial ring $D[X]$. As an application, we show that one can reobtain the main results of…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
We propose two efficient numerical approaches for solving variable-order fractional optimal control-affine problems. The variable-order fractional derivative is considered in the Caputo sense, which together with the Riemann-Liouville…
Dual Bernstein polynomials of one or two variables have proved to be very useful in obtaining B\'{e}zier form of the $L^2$-solution of the problem of best polynomial approximation of B\'{e}zier curve or surface. In this connection, the…
We extend the existing theory of approximation orders provided by shift-invariant subspaces of $L_2$ to the setting of Sobolev spaces, provide treatment of $L_2$ cases that have not been covered before, and apply our results to determine…
The main contribution of our paper is to give a partial classification of the quasi-exactly solvable Lie algebras of first order differential operators in three variables, and to show how this can be applied to the construction of new…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
This article offers a study of the Calder\'on type inverse problem of determining up to second order coefficients of the higher order elliptic operator. Here we show that it is possible to determine an anisotropic second order perturbation…
Much real-world data come with explicitly defined domain orders; e.g., lexicographic order for strings, numeric for integers, and chronological for time. Our goal is to discover implicit domain orders that we do not already know; for…
We give an adequate denotational semantics for languages with recursive higher-order types, continuous probability distributions, and soft constraints. These are expressive languages for building Bayesian models of the kinds used in…
This paper presents a new approach for solving the close evaluation problem in three dimensions, commonly encountered while solving linear elliptic partial differential equations via potential theory. The goal is to evaluate layer…
We give a Riemann-Hilbert approach to the theory of matrix orthogonal polynomials. We will focus on the algebraic aspects of the problem, obtaining difference and differential relations satisfied by the corresponding orthogonal polynomials.…
We formulate a well-posedness and approximation theory for a class of generalised saddle point problems. In this way we develop an approach to a class of fourth order elliptic partial differential equations using the idea of splitting into…
A coherent state representation of the expectation value of an arbitrary (but still polynomial) normal ordered quantum operator is discussed. This serves as a basis for developing a fast and easy-to-handle algorithm, based on series of…
In this paper, we provide a polynomial characterization of linear complementary pairs of quasi-cyclic and quasi-twisted codes of index 2. We also give several examples of linear complementary pairs of quasi-cyclic and quasi-twisted codes…
This is the second in a series of two papers presenting a solution to Hilbert's 12th problem for real quadratic function fields in positive characteristic, in the sense of proving an analog of the Theorem of Weber-Fueter. We also offer a…
In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional…
We present integral representations of solutions to division problems involving matrices of polynomials in several complex variables. We also find estimates of the polynomial degree of the solutions by means of careful degree estimates of…