Piecewise smooth chebfuns
Algorithms are described that make it possible to manipulate piecewise-smooth functions on real intervals numerically with close to machine precision. Breakpoints are introduced in some such calculations at points determined by numerical rootfinding, and in others by recursive subdivision or automat...
Main Authors: | Pachόn, R, Platte, R, Trefethen, N |
---|---|
Format: | Report |
Published: |
Oxford University Computing Laboratory
2008
|
Similar Items
-
Piecewise smooth chebfuns
by: Pachon, R, et al.
Published: (2008) -
Piecewise-smooth chebfuns
by: Pachon, R, et al.
Published: (2010) -
Barycentric−Remez algorithms for best polynomial approximation in the chebfun system
by: Pachόn, R, et al.
Published: (2008) -
Chebfun: A New Kind of Numerical Computing
by: Platte, R, et al.
Published: (2008) -
Chebfun: A New Kind of Numerical Computing
by: Platte, R, et al.
Published: (2008)