When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 ...

  3. List of mathematical series - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_series

    An infinite series of any rational function of can be reduced to a finite series of polygamma functions, by use of partial fraction decomposition, [8] as explained here. This fact can also be applied to finite series of rational functions, allowing the result to be computed in constant time even when the series contains a large number of terms.

  4. Inverse function theorem - Wikipedia

    en.wikipedia.org/wiki/Inverse_function_theorem

    For functions of a single variable, the theorem states that if is a continuously differentiable function with nonzero derivative at the point ; then is injective (or bijective onto the image) in a neighborhood of , the inverse is continuously differentiable near = (), and the derivative of the inverse function at is the reciprocal of the derivative of at : ′ = ′ = ′ (()).

  5. Inverse iteration - Wikipedia

    en.wikipedia.org/wiki/Inverse_iteration

    In numerical analysis, inverse iteration (also known as the inverse power method) is an iterative eigenvalue algorithm. It allows one to find an approximate eigenvector when an approximation to a corresponding eigenvalue is already known. The method is conceptually similar to the power method. It appears to have originally been developed to ...

  6. Series (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Series_(mathematics)

    In mathematics, a series is, roughly speaking, an addition of infinitely many terms, one after the other. [1] The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures in combinatorics through generating functions.

  7. Computational complexity of mathematical operations - Wikipedia

    en.wikipedia.org/wiki/Computational_complexity...

    The complexity of an elementary function is equivalent to that of its inverse, since all elementary functions are analytic and hence invertible by means of Newton's method. In particular, if either exp {\displaystyle \exp } or log {\displaystyle \log } in the complex domain can be computed with some complexity, then that complexity is ...

  8. Inverse function - Wikipedia

    en.wikipedia.org/wiki/Inverse_function

    The square root of x is a partial inverse to f(x) = x 2. Even if a function f is not one-to-one, it may be possible to define a partial inverse of f by restricting the domain. For example, the function = is not one-to-one, since x 2 = (−x) 2.

  9. Implicit function - Wikipedia

    en.wikipedia.org/wiki/Implicit_function

    A common type of implicit function is an inverse function. Not all functions have a unique inverse function. If g is a function of x that has a unique inverse, then the inverse function of g, called g −1, is the unique function giving a solution of the equation = for x in terms of y. This solution can then be written as