Piecewise-smooth chebfuns
Algorithms are described that make it possible to manipulate piecewise-smooth functions on real intervals numerically with close to machine precision. Break points are introduced in some such calculations at points determined by numerical root finding and in others by recursive subdivision or automa...
Gespeichert in:
Veröffentlicht in: | IMA journal of numerical analysis 2010-10, Vol.30 (4), p.898-916 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Algorithms are described that make it possible to manipulate piecewise-smooth functions on real intervals numerically with close to machine precision. Break points are introduced in some such calculations at points determined by numerical root finding and in others by recursive subdivision or automatic edge detection. Functions are represented on each smooth subinterval by Chebyshev series or interpolants. The algorithms are implemented in object-oriented Matlab in an extension of the chebfun system, which was previously limited to smooth functions on [ – 1, 1]. |
---|---|
ISSN: | 0272-4979 1464-3642 |
DOI: | 10.1093/imanum/drp008 |