Shackell, J.
(1995)
*Limits of Liouvillian functions.*
Journal of the London Mathematical Society-Second , 52
.
356 -374 .
ISSN 0024-6107 .
(The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication) |

## Abstract

We are concerned with the calculation of limits of real-valued functions, and more generally with their asymptotic growth. One source of difficulties is that, for example, two large functions may cancel to give a much smaller function. We present a general method for handling such cancellation problems. As is normal in this area, we have to assume the existence of an oracle which determines the sign of any constants that we meet. On that basis we show how to compute the asymptotic forms of real Liouvillian functions. That is to say, elements of a field given by a tower of extensions of the basic constants by integrals, exponentials and real algebraic functions. Our method centres on the concept of an asymptotic field, in which difficulties caused by cancellation can be resolved. We show how to pass from a given asymptotic field to an elementary extension. The asymptotic expressions we derive will, in general, contain a finite number of arbitrary constants of integration. In addition, we provide different asymptotic expressions corresponding to different branches of algebraic functions. We do not determine the arbitrary constants or branches by specifying values at finite points.

Item Type: | Article |
---|---|

Subjects: | Q Science > QA Mathematics (inc Computing science) |

Divisions: | Faculties > Science Technology and Medical Studies > School of Mathematics Statistics and Actuarial Science |

Depositing User: | P. Ogbuji |

Date Deposited: | 27 May 2009 11:22 |

Last Modified: | 01 Jun 2009 18:55 |

Resource URI: | http://kar.kent.ac.uk/id/eprint/18489 (The current URI for this page, for reference purposes) |

- Export to:
- RefWorks
- EPrints3 XML
- CSV

- Depositors only (login required):