enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Taylor series - Wikipedia

    en.wikipedia.org/wiki/Taylor_series

    That is, the Taylor series diverges at x if the distance between x and b is larger than the radius of convergence. The Taylor series can be used to calculate the value of an entire function at every point, if the value of the function, and of all of its derivatives, are known at a single point. Uses of the Taylor series for analytic functions ...

  3. Lagrange inversion theorem - Wikipedia

    en.wikipedia.org/wiki/Lagrange_inversion_theorem

    Faà di Bruno's formula gives coefficients of the composition of two formal power series in terms of the coefficients of those two series. Equivalently, it is a formula for the nth derivative of a composite function. Lagrange reversion theorem for another theorem sometimes called the inversion theorem; Formal power series#The Lagrange inversion ...

  4. Taylor's theorem - Wikipedia

    en.wikipedia.org/wiki/Taylor's_theorem

    The Taylor series of f converges uniformly to the zero function T f (x) = 0, which is analytic with all coefficients equal to zero. The function f is unequal to this Taylor series, and hence non-analytic. For any order k ∈ N and radius r > 0 there exists M k,r > 0 satisfying the remainder bound above.

  5. Radius of convergence - Wikipedia

    en.wikipedia.org/wiki/Radius_of_convergence

    Two cases arise: The first case is theoretical: when you know all the coefficients then you take certain limits and find the precise radius of convergence.; The second case is practical: when you construct a power series solution of a difficult problem you typically will only know a finite number of terms in a power series, anywhere from a couple of terms to a hundred terms.

  6. Numerical methods for ordinary differential equations - Wikipedia

    en.wikipedia.org/wiki/Numerical_methods_for...

    multiderivative methods, which use not only the function f but also its derivatives. This class includes Hermite–Obreschkoff methods and Fehlberg methods, as well as methods like the Parker–Sochacki method [17] or Bychkov–Scherbakov method, which compute the coefficients of the Taylor series of the solution y recursively.

  7. Analytic function - Wikipedia

    en.wikipedia.org/wiki/Analytic_function

    Any Taylor series for this function converges not only for x close enough to x 0 (as in the definition) but for all values of x (real or complex). The trigonometric functions, logarithm, and the power functions are analytic on any open set of their domain. Most special functions (at least in some range of the complex plane): hypergeometric ...

  8. Non-analytic smooth function - Wikipedia

    en.wikipedia.org/wiki/Non-analytic_smooth_function

    For every sequence α 0, α 1, α 2, . . . of real or complex numbers, the following construction shows the existence of a smooth function F on the real line which has these numbers as derivatives at the origin. [1] In particular, every sequence of numbers can appear as the coefficients of the Taylor series of a smooth function.

  9. Rational function - Wikipedia

    en.wikipedia.org/wiki/Rational_function

    This is useful in solving such recurrences, since by using partial fraction decomposition we can write any proper rational function as a sum of factors of the form 1 / (ax + b) and expand these as geometric series, giving an explicit formula for the Taylor coefficients; this is the method of generating functions.