Differential Equations for Algebraic Functions

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential equation of minimal order has coefficients whose degree is cubic in the degree of the function. We also show that there exists a linear differential equation of order linear in the degree whose coefficients are only of quadratic degree. Furthermore, we prove the existence of recurrences of order and degree close to optimal. We study the complexity of computing these differential equations and recurrences. We deduce a fast algorithm for the expansion of algebraic series

Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems

We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algebraic sets. Aside from describing these results, we discuss briefly the background as well as the importance of these problems, and also describe the main tools from algorithmic semi-algebraic geometry, as well as algebraic topology, which make these advances possible. We end with a list of open problems.Comment: Survey article, 74 pages, 15 figures. Final revision. This version will appear in the AMS Contemporary Math. Series: Proceedings of the Summer Research Conference on Discrete and Computational Geometry, Snowbird, Utah (June, 2006). J.E. Goodman, J. Pach, R. Pollack Ed

Understanding the Kalman Filter: an Object Oriented Programming Perspective.

The basic ideals underlying the Kalman filter are outlined in this paper without direct recourse to the complex formulae normally associated with this method. The novel feature of the paper is its reliance on a new algebraic system based on the first two moments of the multivariate normal distribution. The resulting framework lends itself to an object-oriented implementation on computing machines and so many of the ideas are presented in these terms. The paper provides yet another perspective of Kalman filtering, one that many should find relatively easy to understand.Time series analysis, forecasting, Kalman filter, dynamic linear statistical models, object oriented programming.

The computation of flow past an oblique wing using the thin-layer Navier-Stokes equations

Essential aspects are presented for computing flow past an oblique wing with the thin-layer Navier-Stokes equations. A new method is developed for generating a grid system around a realistic wing. This method utilizes a series of conformal transformations. The thin-shear-layer approximation and an algebraic eddy-viscosity turbulence model are used to simplify the Reynolds-averaged Navier-Stokes equations. An implicit, factored numerical scheme and the concept of pencil data structure are utilized. For the first time, some flow fields caused by the oblique wing in a supersonic free stream are discussed, emphasizing the separated vortex flows associated with such a wing

On the computation of the term w21z2zˉw_{21}z^2\bar{z} of the series defining the center manifold for a scalar delay differential equation

In computing the third order terms of the series of powers of the center manifold at an equilibrium point of a scalar delay differential equation, with a single constant delay $r>0,$ some problems occur at the term $w_{21}z^2\bar{z}.$ More precisely, in order to determine the values at 0, respectively $-r$ of the function $w_{21}(\,.\,),$ an algebraic system of equations must be solved. We show that the two equations are dependent, hence the system has an infinity of solutions. Then we show how we can overcome this lack of uniqueness and provide a formula for $w_{21}(0).$Comment: Presented at the Conference on Applied and Industrial Mathematics- CAIM 2011, Iasi, Romania, 22-25 September, 2011. Preprin

Using cylindrical algebraic decomposition and local Fourier analysis to study numerical methods: two examples

Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a Fourier series and to use this representation to study certain properties of the particular numerical method, like the convergence rate or an error estimate. In the process of applying a local Fourier analysis, it is typically necessary to determine the supremum of a more or less complicated term with respect to all frequencies and, potentially, other variables. The problem of computing such a supremum can be rewritten as a quantifier elimination problem, which can be solved with cylindrical algebraic decomposition, a well-known tool from symbolic computation. The combination of local Fourier analysis and cylindrical algebraic decomposition is a machinery that can be applied to a wide class of problems. In the present paper, we will discuss two examples. The first example is to compute the convergence rate of a multigrid method. As second example we will see that the machinery can also be used to do something rather different: We will compare approximation error estimates for different kinds of discretizations.Comment: The research was funded by the Austrian Science Fund (FWF): J3362-N2

Fast algorithm for border bases of Artinian Gorenstein algebras

Given a multi-index sequence $$\sigma$$, we present a new efficient algorithm to compute generators of the linear recurrence relations between the terms of $$\sigma$$. We transform this problem into an algebraic one, by identifying multi-index sequences, multivariate formal power series and linear functionals on the ring of multivariate polynomials. In this setting, the recurrence relations are the elements of the kerne l$I$\sigma of the Hankel operator $H$\sigma associated to $$\sigma$$. We describe the correspondence between multi-index sequences with a Hankel operator of finite rank and Artinian Gorenstein Algebras. We show how the algebraic structure of the Artinian Gorenstein algebra $A$\sigma$$associated to the sequence$$\sigma yields the structure of the terms $\sigma\alpha$for all$$\alpha$ $\in$ N n$. This structure is explicitly given by a border basis of$A$\sigma$$, which is presented as a quotient of the polynomial ring$K[x 1 ,. .. , xn$] by the kernel$I$\sigma$$of the Hankel operator$H$\sigma$$. The algorithm provides generators of$I$\sigma$$constituting a border basis, pairwise orthogonal bases of$A$\sigma$$ and the tables of multiplication by the variables in these bases. It is an extension of Berlekamp-Massey-Sakata (BMS) algorithm, with improved complexity bounds. We present applications of the method to different problems such as the decomposition of functions into weighted sums of exponential functions, sparse interpolation, fast decoding of algebraic codes, computing the vanishing ideal of points, and tensor decomposition. Some benchmarks illustrate the practical behavior of the algorithm