Chebfun

Chebfun
Chebfun
Cheblogo.png
Developer(s) The Chebfun team, University of Oxford
Stable release v4.1 / September 2011
Written in MATLAB
Type Numerical software
License BSD
Website Chebfun home page

Chebfun is a freely available software system written in MATLAB for numerical computation with functions of a real variable. It is based on the idea of overloading MATLAB's commands for vectors and matrices to analogous commands for functions and operators. Thus, for example, whereas the SUM command in MATLAB adds up the elements of a vector, the SUM command in Chebfun evaluates a definite integral. Similarly the backslash command in MATLAB becomes a Chebfun command for solving differential equations[1].

The mathematical basis of Chebfun is numerical algorithms involving piecewise polynomial interpolants and Chebyshev polynomials, and this is where the name "Cheb" comes from. The package aims to combine the feel of symbolic computing systems like Maple and Mathematica with the speed of floating-point numerics[2][3].

The Chebfun project is based in the Mathematical Institute at the University of Oxford and was initiated in 2002 by Lloyd N. Trefethen and his student Zachary Battles[4]. The most recent version, Version 4.0, was released in February 2011.

Contents

Features

  • Approximation of functions
  • Quadrature
  • Rootfinding
  • 1D global optimisation
  • Ordinary differential equations
  • Partial differential equations

Example usage

A user may begin by initialising the variable x, on the interval [0,10], say.

>> x = chebfun('x',[0,10]);

This variable can now be used to perform further computations, for example, computing and plotting roots of a function:

>> f = sin(x) + sin(x.^2);  plot(f)
>> r = roots(f); hold on, plot(r,f(r),'.r'), hold off

ChebExampleRoots.png

The definite integral can be computed with:

>> sum(f) 
ans 
   = 2.422742429006079

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Chebyshev polynomials — Not to be confused with discrete Chebyshev polynomials. In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev,[1] are a sequence of orthogonal polynomials which are related to de Moivre s formula and which can be defined… …   Wikipedia

  • Lagrange polynomial — In numerical analysis, a Lagrange polynomial, named after Joseph Louis Lagrange, is the interpolation polynomial for a given set of data points in the Lagrange form. It was first discovered by Edward Waring in 1779 and later rediscovered by… …   Wikipedia

  • Lloyd Nicholas Trefethen — FRS is professor of numerical analysis and head of the Numerical Analysis Group in the Mathematical Institute at the University of Oxford. Nick Trefethen (as he is known) gained his bachelor s degree from Harvard in 1977 and his master s from… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”