In mathematics, a Padé approximant is the "best" approximation of a function near a specific point by a rational function of given order. Under this technique, the approximant's power series agrees with the power series of the function it is approximating. The technique was developed around 1890 by Henri Padé, but goes back to Georg Frobenius, who introduced the idea and investigated the features of rational approximations of power series. The Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. For these reasons Padé approximants are used extensively in computer calculations. They have also been used as auxiliary functions in Diophantine approximation and transcendental number theory, though for sharp results ad hoc methods— in some sense inspired by the Padé theory— typically replace them. Since Padé approximant is a rational function, an artificial singular point may occur as an approximation, but this can be avoided by Borel–Padé analysis. The reason the Padé approximant tends to be a better approximation than a truncating Taylor series is clear from the viewpoint of the multi-point summation method. Since there are many cases in which the asymptotic expansion at infinity becomes 0 or a constant, it can be interpreted as the "incomplete two-point Padé approximation", in which the ordinary Padé approximation improves the method truncating a Taylor series. Given a function f and two integers m ≥ 0 and n ≥ 1, the Padé approximant of order [m/n] is the rational function which agrees with f(x) to the highest possible order, which amounts to Equivalently, if is expanded in a Maclaurin series (Taylor series at 0), its first terms would cancel the first terms of , and as such When it exists, the Padé approximant is unique as a formal power series for the given m and n. The Padé approximant defined above is also denoted as For given x, Padé approximants can be computed by Wynn's epsilon algorithm and also other sequence transformations from the partial sums of the Taylor series of f, i.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (2)
MATH-540: Diophantine approximation
The main theme in Diopahntine approximation is to approximate a real number by a rational number with a certain denominator bound. The course covers the case of one real number, that is classical and
ME-608: Methods of asymptotic analysis in mechanics
The introduction to asymptotic analysis provides the basis for constructing many simplified analytical models in mechanics and for testing computations in limiting cases.
Related lectures (7)
Quantum Field Theory: Renormalization
Covers the concept of renormalization in quantum field theory, focusing on regularization and divergences removal.
Borel Resummation: Techniques and Applications
Covers the theory and applications of Borel resummation in physics.
Show more
Related publications (10)

Approximation Algorithms for Allocation and Network Design

Etienne Michel François Bamas

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...
EPFL2023

Model order reduction based on functional rational approximants for parametric PDEs with meromorphic structure

Davide Pradovera

Many engineering fields rely on frequency-domain dynamical systems for the mathematical modeling of physical (electrical/mechanical/etc.) structures. With the growing need for more accurate and reliable results, the computational burden incurred by frequen ...
EPFL2021

Schwinger pair production from Pade-Borel reconstruction

Adrien Florio

In this work, we show how the knowledge of the first few terms of the Euler-Heisenberg Lagrangian's weak-field expansion in a magnetic field background is enough to reconstruct the pair-production rate in a strong electric field background. To this end, we ...
AMER PHYSICAL SOC2020
Show more
Related concepts (7)
Puiseux series
In mathematics, Puiseux series are a generalization of power series that allow for negative and fractional exponents of the indeterminate. For example, the series is a Puiseux series in the indeterminate x. Puiseux series were first introduced by Isaac Newton in 1676 and rediscovered by Victor Puiseux in 1850. The definition of a Puiseux series includes that the denominators of the exponents must be bounded. So, by reducing exponents to a common denominator n, a Puiseux series becomes a Laurent series in an nth root of the indeterminate.
Laurent series
In mathematics, the Laurent series of a complex function is a representation of that function as a power series which includes terms of negative degree. It may be used to express complex functions in cases where a Taylor series expansion cannot be applied. The Laurent series was named after and first published by Pierre Alphonse Laurent in 1843. Karl Weierstrass may have discovered it first in a paper written in 1841, but it was not published until after his death.
Divergent series
In mathematics, a divergent series is an infinite series that is not convergent, meaning that the infinite sequence of the partial sums of the series does not have a finite limit. If a series converges, the individual terms of the series must approach zero. Thus any series in which the individual terms do not approach zero diverges. However, convergence is a stronger condition: not all series whose terms approach zero converge. A counterexample is the harmonic series The divergence of the harmonic series was proven by the medieval mathematician Nicole Oresme.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.