Variations on Methods of Lorentz-Lorentz For Dimensions Two and Three

This dissertation addresses the problem of polynomial interpolation: finding a polynomial P(x), which goes through points pi with multiplicity mi at each point. Although polynomials are the building block for many numerical methods, such as finite elements and splines, and theorems about approximation of functions or numerical schemes almost always reduce to local interpolation by polynomials, the theory is underdeveloped. The general problem of computing the dimension of a space of polynomials satisfying certain multiplicity conditions at a set of general points can be formulated in any dimension. This problem, in its most general form, is still unsolved. The only statement known in higher dimension involves the multiplicity two case, which was solved in 1988 by J. Alexander and A. Hirschowitz. In this dissertation I discuss this problem and present an alternate approach to the theorem, which I believe to be much more accessible than that given by Alexander and Hirschowitz. Throughout the paper I use a slight variation of the methods developed by R.A. Lorentz and G.G. Lorentz, with which they have shown the dimension two case.

Autorentext

Born in Bucharest, Romania, Dr. Dent graduated Colorado State University with her Ph.D. in Algebraic Geometry. She was later commissioned as a Radiation Specialist officer in the U.S. Navy. Anamaria taught mathematics at Metro State College of Denver as a Visiting Professor and is currently working as a Systems Engineer for Davidson Tech.