The conference will focus on rational approximation theory in the broadest sense, including all computational aspects and applications. Contributions are welcomed on the subjects of Pade Approximation, Continued Fractions, Orthogonal Polynomials and Rational Approximation in general. More than in the past attention will be paid to the development of reliable algorithms and the use of symbolic techniques. Participants are invited to present a 25-minute research talk. To this end, please submit a title and a short abstract of at most 1 page not later than April 1, 1999.
Registration forms are due at the same date.
Numerical Algorithms, Reliable Computing and Acta Applicandae Mathematicae.