enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Taylor_series

    The function e (−1/x 2) is not analytic at x = 0: the Taylor series is identically 0, although the function is not. If f ( x ) is given by a convergent power series in an open disk centred at b in the complex plane (or an interval in the real line), it is said to be analytic in this region.

  3. 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.

  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. 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 ...

  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. Rational function - Wikipedia

    en.wikipedia.org/wiki/Rational_function

    Every Laurent polynomial can be written as a rational function while the converse is not necessarily true, i.e., the ring of Laurent polynomials is a subring of the rational functions. The rational function () = is equal to 1 for all x except 0, where there is a removable singularity. The sum, product, or quotient (excepting division by the ...

  8. 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 ...

  9. Binomial coefficient - Wikipedia

    en.wikipedia.org/wiki/Binomial_coefficient

    One may show by induction that F(n) counts the number of ways that a n × 1 strip of squares may be covered by 2 × 1 and 1 × 1 tiles. On the other hand, if such a tiling uses exactly k of the 2 × 1 tiles, then it uses n − 2k of the 1 × 1 tiles, and so uses n − k tiles total.