Related papers: A note on algorithmic approach to inverting multiv…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
We present an algorithm that transforms, if possible, a given ODE or PDE with radical function coefficients into one with rational coefficients by means of a rational change of variables. It also applies to systems of linear ODEs. It is…
We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given…
Given a convergent sequence of nodes we present a one-dimensional-holomorphic-function version of the Newton interpolation method of polynomials. It also generalises the Taylor and the Laurent formula. In other words, we present an…
An elegant description of the general form of order automorphisms of effect algebras has been known in the complex case. We present a much simpler proof based on the projective geometry which works also in the real case. As an application…
The inverse power method is a numerical algorithm to obtain the eigenvectors of a matrix. In this work, we develop an iteration algorithm, based on the inverse power method, to numerically solve the Schr\"odinger equation that couples an…
This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…
Spingarn's method of partial inverses has found many applications in nonlinear analysis and in optimization. We show that it can be employed to solve composite monotone inclusions in duality, thus opening a new range of applications for the…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
We introduce an orbifold induction procedure which provides a systematic construction of cyclic orbifolds, including their twisted sectors. The procedure gives counterparts in the orbifold theory of all the current-algebraic constructions…
This paper proposes and analyzes an a posteriori error estimator for the finite element multi-scale discretization approximation of the Steklov eigenvalue problem. Based on the a posteriori error estimates, an adaptive algorithm of shifted…
We evaluate binomial series with harmonic number coefficients, providing recursion relations, integral representations, and several examples. The results are of interest to analytic number theory, the analysis of algorithms, and…
Formal Laurent-Puiseux series are important in many branches of mathematics. This paper presents a {\it Mathematica} implementation of algorithms developed by the author for converting between certain classes of functions and their…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
A novel control design approach for general nonlinear systems is presented in this paper. The approach is based on the identification of a polynomial model of the system to control and on the on-line inversion of this model. An efficient…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
This paper deals with valuations of fields of formal meromorphic functions and their residue fields. We explicitly describe the residue fields of the monomial valuations. We also classify all the discrete rank one valuations of fields of…
We consider the functional inverse of the Gamma function in the complex plane, where it is multi-valued, and define a set of suitable branches by proposing a natural extension from the real case.