List of changes and additions to the previous release (Version 2.0440).
New functions and overloads
- CHEBPOLYPLOT has been added for plotting Chebyshev coefficients of chebfuns on a semilogy plot.
- BLKDIAG has been added for easy construction of block diagonal CHEBOPS.
- FRED has been added to generate Fredholm integral CHEBOPS.
- Two chebfuns, say F and G, can now be composed using F(G).
- MINANDNMAX has been added to perform both MIN and MAX operations.
- RANGE has been added to compute MAX(F)-MIN(F).
- INV (experimental) returns the inverse of a chebfun.
Changes in existing methods/functions
- CHEBPTS can now take a domain as input and return Chebyshev points at arbitrary intervals.
- MAX has been modified so that the result of MAX(F,G) is now continuous at break points at which F and G are smooth. The same modification applies to MIN.
- Better handling of endpoint values in the construction process. Small jumps at breakpoints, due to rounding errors, have been eliminated.
- REMEZ now works on arbitrary intervals.
- The implementation of the barycentric formula (in BARY) has been improved.
- Preferences can now be passed in a chebfun call.
Example: f = chebfun(@(x) sign(x-1), [0 3], 'splitting','on') - New test for aliasing in the chebfun constructor. A known issue in the system was aliasing in the construction of Chebyshev polynomials from samples at Chebyshev points. The adaptive algorithm now uses an extra test for this. The test is currently called "sampletest" in chebfunpref and is "on" by default.
- CHEBTEST now displays the time required for each test.
- A structure can now be passed into CHEBFUNPREF to set preferences.