Talk:Padé approximant

where's epsilon?
The epsilon algorithm, the page refers to for getting the coefficients is missing. A search leads to nothing. I'm not from that field and thus cannot contribute the missing page. 84.226.41.90 17:52, 21 January 2007 (UTC)

Riemann-Padé Zeta function
(EDIT)

To study the resummation of divergent series, it can be useful to introduce the Padé o simply Rational zeta function as:

$$ \sum_{n=1}^{\infty} \frac{[N/M]_f(n)}{n^{s}}= \zeta _{Q}(s) $$

so the zeta regularization value at s=0 it is equal to the 'sum' S, of the divergent series:

$$ S= \sum_{n=1}^{\infty}f(n) $$

the functional equation for this Pade zeta as:

$$ \sum_{j=0}^{M}p_{j}\zeta _{Q}(s-j)= \sum_{j=0}^{N}q_{j}\zeta_{0}(s-j) $$

here '0' means that the Pade is of order [0/0] and hence, we got the Riemann zeta function. and $$ Q=Q(n)=[N/M]_f(n)$$

Sorry.. for my edition, perhaps now it looks clearer from the coefficients of the upper and lower Polynomials involving Padè approximant (If possible put it back) i thought i saw it into a book about Dirichlet series but can not remember its name.

The above section appeared in the article. It looks to me as it is valid, but unfortunately I have no idea what's meant. In the first formula, the numerator seems to be independent of n; and what is Q? In the last formula, the a_j and b_j is not defined. -- Jitse Niesen (talk) 13:28, 23 October 2007 (UTC)


 * Okay, it looks clearer now; thanks. I changed it a bit, hopefully without introducing any errors. -- Jitse Niesen (talk) 11:45, 26 October 2007 (UTC)

Introductory text
Consider the introductory text: Padé approximant is the "best" approximation of a function 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 by Henri Padé. The external link "[1]" to "http://www.dattalo.com/technical/theory/sinewave.html" is inappropriate in a lead-in text. I have moved it into the references. --Михал Орела 14:26, 11 November 2010 (UTC) —Preceding unsigned comment added by MihalOrela (talk • contribs)

Slight correction: I have moved the said link into the External References section. --Михал Орела 14:38, 11 November 2010 (UTC) —Preceding unsigned comment added by MihalOrela (talk • contribs)

Definition
I have inserted a slightly more formal definition:

Given a function f and two integers m &ge; 0 and n &ge; 0, the Padé approximant of order [M/N] is the rational function


 * $$R(x)= \frac{\sum_{m=0}^{M}p_m x^m}{1+\sum_{n=1}^{N}q_n x^n}=\frac{p_0+p_1x+p_2x^2+\cdots+p_Mx^M}{1+q_1 x+q_2x^2+\cdots+q_Nx^N}$$

--Михал Орела 14:04, 12 November 2010 (UTC) —Preceding unsigned comment added by MihalOrela (talk • contribs)

Now it is time to harmonize the notation used in this article with that of Padé table. Here in this article there are p's and q's. There, the more usual a's and b's are used. Since the Padé table article is already very well developed, I propose that harmonization of notation be undertaken here. Specifically,
 * $$R(x)= \frac{\sum_{m=0}^{M}p_m x^m}{1+\sum_{n=1}^{N}q_n x^n}=\frac{p_0+p_1x+p_2x^2+\cdots+p_Mx^M}{1+q_1 x+q_2x^2+\cdots+q_Nx^N}$$

becomes
 * $$R(x)= \frac{\sum_{m=0}^{M}a_m x^m}{1+\sum_{n=1}^{N}b_n x^n}=\frac{a_0+a_1x+a_2x^2+\cdots+a_Mx^M}{1+b_1 x+b_2x^2+\cdots+b_Nx^N}$$

--Михал Орела 14:59, 12 November 2010 (UTC) —Preceding unsigned comment added by MihalOrela (talk • contribs)

Just fixed a bad editing error. --Михал Орела 15:06, 12 November 2010 (UTC)

method
In the absence of epsilon algorithm, a presentation of at least one way to generate a P.a. would help. If I understand correctly: given Taylor series coefficients $$c_i$$, we have (with $$d_0=1$$ by convention), whence which can be expressed with a matrix that I don't quite know how to format neatly ... but anyway, is that accurate? (Is it reasonable to assume that M &ge; N ?) —Tamfang (talk) 18:54, 12 November 2010 (UTC)
 * $$(\sum_{i=0}^{M+N}{c_i x^i})(\sum_{j=1}^M{d_j x^j}) = \sum_{k=0}^N{n_k x^k}$$
 * $$ c_0 = n_0 $$
 * $$ c_1 = n_1 - c_0 d_1 $$
 * $$ c_N = n_N - c_{N-1} d_1 - \ldots - c_0 d_N $$
 * $$ c_{N+1} = -c_N d_1 - \ldots - c_0 d_{N+1} $$
 * $$ c_{N+M} = -c_{N+M-1} d_1 - \ldots - c_N d_M $$
 * $$ c_{N+M} = -c_{N+M-1} d_1 - \ldots - c_N d_M $$
 * $$ c_{N+M} = -c_{N+M-1} d_1 - \ldots - c_N d_M $$

Hi, the classical way to compute a Pade approximant is via the extended euclidean algorithm. The relation $$R(x)=P(x)/Q(x)=f(x) \mod x^{M+N+1}$$ is equivalent to the existence of some K(x) such that
 * $$P(x)=Q(x)f(x)+K(x)x^{M+N+1}$$,

which can be interpreted as one step in the computation of the xgcd. Since the xgcd page is horrible: to compute the gcd of two polynomials a and b, one computes via long division the remainder sequence
 * $$r_0=a,\;r_1=b,\quad r_{k-1}=q_kr_k+r_{k+1}$$ with $$\deg r_{k+1}<\deg r_k\,$$,

and for the Bezout identities
 * $$u_0=1,\;v_0=0,\quad u_1=0,\;v_1=1,\quad u_{k+1}=u_kq_k-u_{k-1},\;v_{k+1}=v_kq_k-v_{k-1}$$

to obtain in each step the identity
 * $$r_k(x)=u_k(x)a(x)+v_k(x)b(x)$$.

For the order (M/N) approximant, one thus carries out the extended euclidean algorithm for $$a=f,\;b=x^{M+N+1}$$ where f is replaced with its Taylor series up to degree M+N, until the step where $$u_k$$ has degree N. Then $$P=r_k,\;Q=u_k$$ gives the Pade approximant. If one computes the full table of the xgcd, then one has obtained a(n anti-)diagonal of the Pade table. This method is mentioned in Bini/Pan: Polynomial and Matrix computations, but there should also be better sources.--LutzL (talk) 13:50, 13 November 2010 (UTC)


 * Thank you, that's very interesting! (Now I need to find or write a polynomial division function.) —Tamfang (talk) 21:47, 13 November 2010 (UTC)
 * Ah, there it is. —Tamfang (talk) 21:55, 13 November 2010 (UTC)


 * It appears to me that $$ q_1=0,\, r_2=f=r_0 $$ ... is that intentional? —Tamfang (talk) 17:41, 14 November 2010 (UTC)


 * Yes and no. The remark is correct and it was not intended, I just didn't have time to change it. Better start with descending degree, $$r_0=a=x^{M+N+1},\;r_1=b=f$$, but notice that with this swap now the denominator Q is taken from the v cofactor sequence.--LutzL (talk) 13:35, 15 November 2010 (UTC)
 * And of course you can omit the computation of the u cofactors since they are not used anywhere intermediately or in the result.--LutzL (talk) 13:40, 15 November 2010 (UTC)

Can anyone help to revert an edit
Found that the example for exp(x) was edited by some IP user in March, and becomes mathematically incorrect.

https://en.wikipedia.org/w/index.php?title=Pad%C3%A9_approximant&type=revision&diff=769403635&oldid=769402974

However it could not be simply "undo" as there is conflicts. Can anyone help to revert the mal-edit?

Billyauhk (talk) 04:30, 18 November 2017 (UTC)

Is the exp(x) example wrong?
The example for exp(x) here: https://en.wikipedia.org/wiki/Padé_approximant#Examples does not match the example in the Padé table here: https://en.wikipedia.org/wiki/Padé_table#An_example_–_the_exponential_function.

I believe the Padé table is correct and this page is wrong. I haven't edited a page before and wanted to get confirmation from someone else that there is actually an error first. — Preceding unsigned comment added by Aerojunkie (talk • contribs) 16:49, 15 March 2018 (UTC)

I have already noted the incorrect exp(x) Pade approximation above and identified the commit which make it wrong. Pls check my last section. Billyauhk (talk) 08:56, 3 September 2018 (UTC)

Simple example MatLab code
QuentinUK (talk) 13:50, 9 December 2018 (UTC)

Pade approximation of erf(x) example is really bad
I just coded up that approximation. Return values are worse than single precision floating point for abs(x) > one sigma = sqrt(2)/2 and are completely unacceptable for abs(x) > two sigma.

In addition to some citations, these examples need error bounds or they should be removed. It is really morally wrong to waste people's time with bad algorithms. — Preceding unsigned comment added by 154.20.183.43 (talk) 22:08, 13 February 2019 (UTC)

Examples switch polynomial conventions
Many examples have highest order terms (say) first in the numerator, but bottom in the denominator. There is no consistency.

63.145.59.55 (talk) 17:17, 7 December 2020 (UTC)

Uniqueness
It says that the Padé approximant $$[p/q]_f$$ is unique, but from the definition it seems that for $$f(x)=0$$ both $$\frac{0}{1+x}$$ and $$\frac{0}{1+2x}$$ would go as $$[1/1]_f$$. How to properly define uniqueness then? adamant.pwn — contrib/talk 11:44, 6 April 2022 (UTC)
 * On the other hand, I don't see any way for e. g. $$[1/3]_f$$ to exist for $$f(x)=x^2$$. The way it's defined in the article, $$[1/3]_f$$ will start from either $$a_0$$ or $$a_1 x$$, which can't match $$x^2$$ in first $$4$$ terms. adamant.pwn — contrib/talk 19:07, 6 April 2022 (UTC)
 * I came across the same problem. The point is that the Padé approximation does not always exist! This should be mentioned more explicitly in the article. Benji104 (talk) 17:11, 31 August 2023 (UTC)