IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v24y1982i1p1-18.html
   My bibliography  Save this article

Ultra-arithmetic I: Function data types

Author

Listed:
  • Epstein, C.
  • Miranker, W.L.
  • Rivlin, T.J.

Abstract

We develop ultra-arithmetic, a calculus for functions which is performable on a digital computer. We proceed with an analogy between the real numbers and their truncated positional number representations on the one hand and functions and their truncated generalized-Fourier series on the other. Thus we lift the digital computer from a setting corresponding to the real numbers to a setting corresponding to function spaces. Digitized function data types are defined along with computer versions of the corresponding ultra-arithmetic operations (addition, subtraction, multiplication, division, differentiation and integration). Error estimates for these operations (the analogues of traditional rounding errors) are given. Explicit examples of the error estimates for the ultra-arithmetic operations are given in the cases of five specific choices of basis functions; Fourier-, Chebyshev-, Legendre-, sine- and cosine-bases. Finally the algorithms of ultra-arithmetic are given in an explicitly implementable form for the cases both of the Fourier basis and the Chebyshev basis.

Suggested Citation

  • Epstein, C. & Miranker, W.L. & Rivlin, T.J., 1982. "Ultra-arithmetic I: Function data types," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 24(1), pages 1-18.
    • Handle: RePEc:eee:matcom:v:24:y:1982:i:1:p:1-18
    DOI: 10.1016/0378-4754(82)90045-3
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378475482900453
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/0378-4754(82)90045-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Epstein, C. & Miranker, W.L. & Rivlin, T.J., 1982. "Ultra-arithmetic II: intervals of polynomials," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 24(1), pages 19-29.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:24:y:1982:i:1:p:1-18. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.