What is the Puiseux series of the Bessel function $J_n(n)$? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Show that Bessel function $J_n(x)$ satisfies Bessel's differential equation.What is the Fourier series of $e^mucostheta$?Integral equal to 0'th Bessel functionProve a certain integral expression of Bessel type for the Bessel function of the first kindContour integration of the bessel functionShow the equivalence of two infinite series over Bessel functionsSimpler proof of an integral representation of Bessel function of the first kind $J_n(x)$Expansion of some singular kernel with the help of Bessel and Neumann spherical harmonic functionsThe Bessel function and finding expressionBessel function limit

What are the pros and cons of Aerospike nosecones?

If Jon Snow became King of the Seven Kingdoms what would his regnal number be?

How can players work together to take actions that are otherwise impossible?

When is phishing education going too far?

What is the musical term for a note that continously plays through a melody?

How to draw this diagram using TikZ package?

Should I call the interviewer directly, if HR aren't responding?

Is above average number of years spent on PhD considered a red flag in future academia or industry positions?

List *all* the tuples!

Is it true that "carbohydrates are of no use for the basal metabolic need"?

What causes the vertical darker bands in my photo?

Did Xerox really develop the first LAN?

Why is "Captain Marvel" translated as male in Portugal?

Is the Standard Deduction better than Itemized when both are the same amount?

What's the purpose of writing one's academic bio in 3rd person?

How to find all the available tools in macOS terminal?

Difference between these two cards?

Can inflation occur in a positive-sum game currency system such as the Stack Exchange reputation system?

Gastric acid as a weapon

What is the correct way to use the pinch test for dehydration?

Do you forfeit tax refunds/credits if you aren't required to and don't file by April 15?

Did Kevin spill real chili?

Storing hydrofluoric acid before the invention of plastics

Antler Helmet: Can it work?



What is the Puiseux series of the Bessel function $J_n(n)$?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Show that Bessel function $J_n(x)$ satisfies Bessel's differential equation.What is the Fourier series of $e^mucostheta$?Integral equal to 0'th Bessel functionProve a certain integral expression of Bessel type for the Bessel function of the first kindContour integration of the bessel functionShow the equivalence of two infinite series over Bessel functionsSimpler proof of an integral representation of Bessel function of the first kind $J_n(x)$Expansion of some singular kernel with the help of Bessel and Neumann spherical harmonic functionsThe Bessel function and finding expressionBessel function limit










4












$begingroup$


By numerical experimentation I find the first three terms of the Puiseux series of the Bessel function of the first kind



$$
J_n(n) =
fracGamma(frac13)2^2/3cdot 3^1/6 cdot pin^-1/3
- frac135cdot 6^1/3cdotGamma(frac13)n^-5/3
- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pin^-7/3
+mathcalO(n^-11/3)
$$



How does this series continue?



See also this application.



How I got this far



first term



For the first term, start with the integral representation



$$
J_n(n) = frac12piint_-pi^pi dtheta cos[n(sin(theta)-theta)]
$$



For $ntoinfty$ the only significant contributions to this integral come from values of $theta$ that are close to zero. Therefore we approximate $sin(theta)-thetaapprox-theta^3/6$ and find



$$
lim_ntoinfty n^1/3cdotfrac12piint_-pi^pi dtheta cos[-ntheta^3/6] = fracGamma(frac13)2^2/3cdot3^1/6cdotpi
$$



In Mathematica:





Limit[1/(2π) Integrate[Cos[n (-(θ^3/6))], θ, -π, π]*n^(1/3), n -> ∞]



Gamma[1/3]/(2^(2/3) 3^(1/6) π)




second term



In Mathematica, define the Bessel function and its one-term approximation, as well as their numerical difference evaluated to 1000 digits:





b[n_] = BesselJ[n, n];
ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3);
B[n_] := N[b[n] - ba[n], 10^3]


Calculate how the numerical difference behaves for large $n$ (after multiplying it by $n^5/3$):





ListLinePlot[T = Table[B[n]*n^(5/3), n, 10^Range[2, 5, 1/4]]]


and find the approximate numerical value of the limit as $ntoinfty$:





NumericalMath`NSequenceLimit[T]



-0.00586928848357833870




Then use AskConstants to find that this number is probably equal to $-frac135cdot 6^1/3cdotGamma(frac13)$.



third term



Same procedure as second term, but with the better approximation





ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3) -
1/(35*6^(1/3)*Gamma[1/3])*n^(-5/3);


and multiplying the difference B[n] by $n^7/3$ before taking the numerical limit $ntoinfty$. The result is $-0.0019880325262065435671$, which AskConstants thinks is equal to $- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pi$.



higher-order terms



The above recipe can be continued to higher-order terms, but I lose confidence in the capabilities of AskConstants. The fourth term is $+0.00048679979012516409164$, which may be



$$
+frac1213511875cdot6^1/3cdot Gamma(frac13)n^-11/3
$$



but such large rationals don't inspire confidence.










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Nitpick: this is not a Laurent series, it's a Puiseux series
    $endgroup$
    – Wojowu
    Mar 26 at 8:46










  • $begingroup$
    Thanks @Wojowu, edited & learned something.
    $endgroup$
    – Roman
    Mar 26 at 8:49










  • $begingroup$
    I don't know what has been your process (I really would like to know) but this is beautiful.
    $endgroup$
    – Claude Leibovici
    Mar 26 at 9:07






  • 1




    $begingroup$
    Have you seen this?
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:25






  • 1




    $begingroup$
    Yes, Watson indeed has it; the formula is attributed to Meissel.
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:51















4












$begingroup$


By numerical experimentation I find the first three terms of the Puiseux series of the Bessel function of the first kind



$$
J_n(n) =
fracGamma(frac13)2^2/3cdot 3^1/6 cdot pin^-1/3
- frac135cdot 6^1/3cdotGamma(frac13)n^-5/3
- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pin^-7/3
+mathcalO(n^-11/3)
$$



How does this series continue?



See also this application.



How I got this far



first term



For the first term, start with the integral representation



$$
J_n(n) = frac12piint_-pi^pi dtheta cos[n(sin(theta)-theta)]
$$



For $ntoinfty$ the only significant contributions to this integral come from values of $theta$ that are close to zero. Therefore we approximate $sin(theta)-thetaapprox-theta^3/6$ and find



$$
lim_ntoinfty n^1/3cdotfrac12piint_-pi^pi dtheta cos[-ntheta^3/6] = fracGamma(frac13)2^2/3cdot3^1/6cdotpi
$$



In Mathematica:





Limit[1/(2π) Integrate[Cos[n (-(θ^3/6))], θ, -π, π]*n^(1/3), n -> ∞]



Gamma[1/3]/(2^(2/3) 3^(1/6) π)




second term



In Mathematica, define the Bessel function and its one-term approximation, as well as their numerical difference evaluated to 1000 digits:





b[n_] = BesselJ[n, n];
ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3);
B[n_] := N[b[n] - ba[n], 10^3]


Calculate how the numerical difference behaves for large $n$ (after multiplying it by $n^5/3$):





ListLinePlot[T = Table[B[n]*n^(5/3), n, 10^Range[2, 5, 1/4]]]


and find the approximate numerical value of the limit as $ntoinfty$:





NumericalMath`NSequenceLimit[T]



-0.00586928848357833870




Then use AskConstants to find that this number is probably equal to $-frac135cdot 6^1/3cdotGamma(frac13)$.



third term



Same procedure as second term, but with the better approximation





ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3) -
1/(35*6^(1/3)*Gamma[1/3])*n^(-5/3);


and multiplying the difference B[n] by $n^7/3$ before taking the numerical limit $ntoinfty$. The result is $-0.0019880325262065435671$, which AskConstants thinks is equal to $- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pi$.



higher-order terms



The above recipe can be continued to higher-order terms, but I lose confidence in the capabilities of AskConstants. The fourth term is $+0.00048679979012516409164$, which may be



$$
+frac1213511875cdot6^1/3cdot Gamma(frac13)n^-11/3
$$



but such large rationals don't inspire confidence.










share|cite|improve this question











$endgroup$







  • 1




    $begingroup$
    Nitpick: this is not a Laurent series, it's a Puiseux series
    $endgroup$
    – Wojowu
    Mar 26 at 8:46










  • $begingroup$
    Thanks @Wojowu, edited & learned something.
    $endgroup$
    – Roman
    Mar 26 at 8:49










  • $begingroup$
    I don't know what has been your process (I really would like to know) but this is beautiful.
    $endgroup$
    – Claude Leibovici
    Mar 26 at 9:07






  • 1




    $begingroup$
    Have you seen this?
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:25






  • 1




    $begingroup$
    Yes, Watson indeed has it; the formula is attributed to Meissel.
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:51













4












4








4


1



$begingroup$


By numerical experimentation I find the first three terms of the Puiseux series of the Bessel function of the first kind



$$
J_n(n) =
fracGamma(frac13)2^2/3cdot 3^1/6 cdot pin^-1/3
- frac135cdot 6^1/3cdotGamma(frac13)n^-5/3
- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pin^-7/3
+mathcalO(n^-11/3)
$$



How does this series continue?



See also this application.



How I got this far



first term



For the first term, start with the integral representation



$$
J_n(n) = frac12piint_-pi^pi dtheta cos[n(sin(theta)-theta)]
$$



For $ntoinfty$ the only significant contributions to this integral come from values of $theta$ that are close to zero. Therefore we approximate $sin(theta)-thetaapprox-theta^3/6$ and find



$$
lim_ntoinfty n^1/3cdotfrac12piint_-pi^pi dtheta cos[-ntheta^3/6] = fracGamma(frac13)2^2/3cdot3^1/6cdotpi
$$



In Mathematica:





Limit[1/(2π) Integrate[Cos[n (-(θ^3/6))], θ, -π, π]*n^(1/3), n -> ∞]



Gamma[1/3]/(2^(2/3) 3^(1/6) π)




second term



In Mathematica, define the Bessel function and its one-term approximation, as well as their numerical difference evaluated to 1000 digits:





b[n_] = BesselJ[n, n];
ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3);
B[n_] := N[b[n] - ba[n], 10^3]


Calculate how the numerical difference behaves for large $n$ (after multiplying it by $n^5/3$):





ListLinePlot[T = Table[B[n]*n^(5/3), n, 10^Range[2, 5, 1/4]]]


and find the approximate numerical value of the limit as $ntoinfty$:





NumericalMath`NSequenceLimit[T]



-0.00586928848357833870




Then use AskConstants to find that this number is probably equal to $-frac135cdot 6^1/3cdotGamma(frac13)$.



third term



Same procedure as second term, but with the better approximation





ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3) -
1/(35*6^(1/3)*Gamma[1/3])*n^(-5/3);


and multiplying the difference B[n] by $n^7/3$ before taking the numerical limit $ntoinfty$. The result is $-0.0019880325262065435671$, which AskConstants thinks is equal to $- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pi$.



higher-order terms



The above recipe can be continued to higher-order terms, but I lose confidence in the capabilities of AskConstants. The fourth term is $+0.00048679979012516409164$, which may be



$$
+frac1213511875cdot6^1/3cdot Gamma(frac13)n^-11/3
$$



but such large rationals don't inspire confidence.










share|cite|improve this question











$endgroup$




By numerical experimentation I find the first three terms of the Puiseux series of the Bessel function of the first kind



$$
J_n(n) =
fracGamma(frac13)2^2/3cdot 3^1/6 cdot pin^-1/3
- frac135cdot 6^1/3cdotGamma(frac13)n^-5/3
- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pin^-7/3
+mathcalO(n^-11/3)
$$



How does this series continue?



See also this application.



How I got this far



first term



For the first term, start with the integral representation



$$
J_n(n) = frac12piint_-pi^pi dtheta cos[n(sin(theta)-theta)]
$$



For $ntoinfty$ the only significant contributions to this integral come from values of $theta$ that are close to zero. Therefore we approximate $sin(theta)-thetaapprox-theta^3/6$ and find



$$
lim_ntoinfty n^1/3cdotfrac12piint_-pi^pi dtheta cos[-ntheta^3/6] = fracGamma(frac13)2^2/3cdot3^1/6cdotpi
$$



In Mathematica:





Limit[1/(2π) Integrate[Cos[n (-(θ^3/6))], θ, -π, π]*n^(1/3), n -> ∞]



Gamma[1/3]/(2^(2/3) 3^(1/6) π)




second term



In Mathematica, define the Bessel function and its one-term approximation, as well as their numerical difference evaluated to 1000 digits:





b[n_] = BesselJ[n, n];
ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3);
B[n_] := N[b[n] - ba[n], 10^3]


Calculate how the numerical difference behaves for large $n$ (after multiplying it by $n^5/3$):





ListLinePlot[T = Table[B[n]*n^(5/3), n, 10^Range[2, 5, 1/4]]]


and find the approximate numerical value of the limit as $ntoinfty$:





NumericalMath`NSequenceLimit[T]



-0.00586928848357833870




Then use AskConstants to find that this number is probably equal to $-frac135cdot 6^1/3cdotGamma(frac13)$.



third term



Same procedure as second term, but with the better approximation





ba[n_] = Gamma[1/3]/(2^(2/3)*3^(1/6)*π)*n^(-1/3) -
1/(35*6^(1/3)*Gamma[1/3])*n^(-5/3);


and multiplying the difference B[n] by $n^7/3$ before taking the numerical limit $ntoinfty$. The result is $-0.0019880325262065435671$, which AskConstants thinks is equal to $- fracGamma(frac13)225 cdot 2^2/3cdot 3^1/6cdot pi$.



higher-order terms



The above recipe can be continued to higher-order terms, but I lose confidence in the capabilities of AskConstants. The fourth term is $+0.00048679979012516409164$, which may be



$$
+frac1213511875cdot6^1/3cdot Gamma(frac13)n^-11/3
$$



but such large rationals don't inspire confidence.







special-functions laurent-series bessel-functions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 26 at 11:17







Roman

















asked Mar 26 at 8:31









RomanRoman

2188




2188







  • 1




    $begingroup$
    Nitpick: this is not a Laurent series, it's a Puiseux series
    $endgroup$
    – Wojowu
    Mar 26 at 8:46










  • $begingroup$
    Thanks @Wojowu, edited & learned something.
    $endgroup$
    – Roman
    Mar 26 at 8:49










  • $begingroup$
    I don't know what has been your process (I really would like to know) but this is beautiful.
    $endgroup$
    – Claude Leibovici
    Mar 26 at 9:07






  • 1




    $begingroup$
    Have you seen this?
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:25






  • 1




    $begingroup$
    Yes, Watson indeed has it; the formula is attributed to Meissel.
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:51












  • 1




    $begingroup$
    Nitpick: this is not a Laurent series, it's a Puiseux series
    $endgroup$
    – Wojowu
    Mar 26 at 8:46










  • $begingroup$
    Thanks @Wojowu, edited & learned something.
    $endgroup$
    – Roman
    Mar 26 at 8:49










  • $begingroup$
    I don't know what has been your process (I really would like to know) but this is beautiful.
    $endgroup$
    – Claude Leibovici
    Mar 26 at 9:07






  • 1




    $begingroup$
    Have you seen this?
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:25






  • 1




    $begingroup$
    Yes, Watson indeed has it; the formula is attributed to Meissel.
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 11:51







1




1




$begingroup$
Nitpick: this is not a Laurent series, it's a Puiseux series
$endgroup$
– Wojowu
Mar 26 at 8:46




$begingroup$
Nitpick: this is not a Laurent series, it's a Puiseux series
$endgroup$
– Wojowu
Mar 26 at 8:46












$begingroup$
Thanks @Wojowu, edited & learned something.
$endgroup$
– Roman
Mar 26 at 8:49




$begingroup$
Thanks @Wojowu, edited & learned something.
$endgroup$
– Roman
Mar 26 at 8:49












$begingroup$
I don't know what has been your process (I really would like to know) but this is beautiful.
$endgroup$
– Claude Leibovici
Mar 26 at 9:07




$begingroup$
I don't know what has been your process (I really would like to know) but this is beautiful.
$endgroup$
– Claude Leibovici
Mar 26 at 9:07




1




1




$begingroup$
Have you seen this?
$endgroup$
– J. M. is a poor mathematician
Mar 26 at 11:25




$begingroup$
Have you seen this?
$endgroup$
– J. M. is a poor mathematician
Mar 26 at 11:25




1




1




$begingroup$
Yes, Watson indeed has it; the formula is attributed to Meissel.
$endgroup$
– J. M. is a poor mathematician
Mar 26 at 11:51




$begingroup$
Yes, Watson indeed has it; the formula is attributed to Meissel.
$endgroup$
– J. M. is a poor mathematician
Mar 26 at 11:51










1 Answer
1






active

oldest

votes


















3












$begingroup$

The answer is given by Ernst Meissel in this 1891 paper (in German):



$$
J_n(n) = frac1pi
sum_m=0^infty
lambda_m cdot
Gammaleft(frac2m+43right)
cdot left(frac6nright)^frac2m+13
cdot cosleft(frac2m+16piright)
$$



The coefficients $lambda_m$ describe the Taylor series of the solution $u(x)=sum_m=0^infty lambda_m x^2m+1$ of the transcendental equation $u-sin(u)=x^3/6$ around $x=0$. Term-by-term comparison gives



$$
lambda_0=1\
lambda_1=frac160\
lambda_2=frac11400\
lambda_3=frac125200\
lambda_4=frac4317248000\
lambda_5=frac12137207200000\
lambda_6=frac15143912713500800000\
lambda_7=frac3322738118080000000\
lambda_8=frac16542537833252957982717440000000\
lambda_9=frac887278009177399104762880000000\
lambda_10=frac1523380122455939217856135377920000000000\
ldots
$$



These coefficients can be calculated efficiently with the Mathematica code





λ[0] = 1;
λ[m_Integer /; m >= 1] := λ[m] = Module[Λ, u, x,
u = Sum[λ[j] x^(2 j + 1), j, 0, m - 1] + Λ x^(2 m + 1);
Λ /. First[Solve[SeriesCoefficient[u - Sin[u], x, 0, 2 m + 3] == 0, Λ]]]


Or all at once by series inversion (thanks to J.M.): calculate $lambda_0ldotslambda_n$ with





With[n = 5,
ComposeSeries[InverseSeries[Series[u-Sin[u], u,0,2n+3]], x^3/6 + O[x]^(2n+5)]]



$$
x+fracx^360+fracx^51400+fracx^725200+frac43 x^917248000+frac1213x^117207200000+mathcalO(x^12)
$$




Thanks to J.M. who pointed out Meissel's paper to me.






share|cite|improve this answer











$endgroup$








  • 1




    $begingroup$
    If you need a whole pile at once: ComposeSeries[InverseSeries[Series[u - Sin[u], u, 0, 25]], x^3/6 + O[x]^25]
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 14:19










  • $begingroup$
    Thanks @J.M.isnotamathematician , I was wondering how to make InverseSeries work on this case.
    $endgroup$
    – Roman
    Mar 26 at 14:35











Your Answer








StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3162888%2fwhat-is-the-puiseux-series-of-the-bessel-function-j-nn%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









3












$begingroup$

The answer is given by Ernst Meissel in this 1891 paper (in German):



$$
J_n(n) = frac1pi
sum_m=0^infty
lambda_m cdot
Gammaleft(frac2m+43right)
cdot left(frac6nright)^frac2m+13
cdot cosleft(frac2m+16piright)
$$



The coefficients $lambda_m$ describe the Taylor series of the solution $u(x)=sum_m=0^infty lambda_m x^2m+1$ of the transcendental equation $u-sin(u)=x^3/6$ around $x=0$. Term-by-term comparison gives



$$
lambda_0=1\
lambda_1=frac160\
lambda_2=frac11400\
lambda_3=frac125200\
lambda_4=frac4317248000\
lambda_5=frac12137207200000\
lambda_6=frac15143912713500800000\
lambda_7=frac3322738118080000000\
lambda_8=frac16542537833252957982717440000000\
lambda_9=frac887278009177399104762880000000\
lambda_10=frac1523380122455939217856135377920000000000\
ldots
$$



These coefficients can be calculated efficiently with the Mathematica code





λ[0] = 1;
λ[m_Integer /; m >= 1] := λ[m] = Module[Λ, u, x,
u = Sum[λ[j] x^(2 j + 1), j, 0, m - 1] + Λ x^(2 m + 1);
Λ /. First[Solve[SeriesCoefficient[u - Sin[u], x, 0, 2 m + 3] == 0, Λ]]]


Or all at once by series inversion (thanks to J.M.): calculate $lambda_0ldotslambda_n$ with





With[n = 5,
ComposeSeries[InverseSeries[Series[u-Sin[u], u,0,2n+3]], x^3/6 + O[x]^(2n+5)]]



$$
x+fracx^360+fracx^51400+fracx^725200+frac43 x^917248000+frac1213x^117207200000+mathcalO(x^12)
$$




Thanks to J.M. who pointed out Meissel's paper to me.






share|cite|improve this answer











$endgroup$








  • 1




    $begingroup$
    If you need a whole pile at once: ComposeSeries[InverseSeries[Series[u - Sin[u], u, 0, 25]], x^3/6 + O[x]^25]
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 14:19










  • $begingroup$
    Thanks @J.M.isnotamathematician , I was wondering how to make InverseSeries work on this case.
    $endgroup$
    – Roman
    Mar 26 at 14:35















3












$begingroup$

The answer is given by Ernst Meissel in this 1891 paper (in German):



$$
J_n(n) = frac1pi
sum_m=0^infty
lambda_m cdot
Gammaleft(frac2m+43right)
cdot left(frac6nright)^frac2m+13
cdot cosleft(frac2m+16piright)
$$



The coefficients $lambda_m$ describe the Taylor series of the solution $u(x)=sum_m=0^infty lambda_m x^2m+1$ of the transcendental equation $u-sin(u)=x^3/6$ around $x=0$. Term-by-term comparison gives



$$
lambda_0=1\
lambda_1=frac160\
lambda_2=frac11400\
lambda_3=frac125200\
lambda_4=frac4317248000\
lambda_5=frac12137207200000\
lambda_6=frac15143912713500800000\
lambda_7=frac3322738118080000000\
lambda_8=frac16542537833252957982717440000000\
lambda_9=frac887278009177399104762880000000\
lambda_10=frac1523380122455939217856135377920000000000\
ldots
$$



These coefficients can be calculated efficiently with the Mathematica code





λ[0] = 1;
λ[m_Integer /; m >= 1] := λ[m] = Module[Λ, u, x,
u = Sum[λ[j] x^(2 j + 1), j, 0, m - 1] + Λ x^(2 m + 1);
Λ /. First[Solve[SeriesCoefficient[u - Sin[u], x, 0, 2 m + 3] == 0, Λ]]]


Or all at once by series inversion (thanks to J.M.): calculate $lambda_0ldotslambda_n$ with





With[n = 5,
ComposeSeries[InverseSeries[Series[u-Sin[u], u,0,2n+3]], x^3/6 + O[x]^(2n+5)]]



$$
x+fracx^360+fracx^51400+fracx^725200+frac43 x^917248000+frac1213x^117207200000+mathcalO(x^12)
$$




Thanks to J.M. who pointed out Meissel's paper to me.






share|cite|improve this answer











$endgroup$








  • 1




    $begingroup$
    If you need a whole pile at once: ComposeSeries[InverseSeries[Series[u - Sin[u], u, 0, 25]], x^3/6 + O[x]^25]
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 14:19










  • $begingroup$
    Thanks @J.M.isnotamathematician , I was wondering how to make InverseSeries work on this case.
    $endgroup$
    – Roman
    Mar 26 at 14:35













3












3








3





$begingroup$

The answer is given by Ernst Meissel in this 1891 paper (in German):



$$
J_n(n) = frac1pi
sum_m=0^infty
lambda_m cdot
Gammaleft(frac2m+43right)
cdot left(frac6nright)^frac2m+13
cdot cosleft(frac2m+16piright)
$$



The coefficients $lambda_m$ describe the Taylor series of the solution $u(x)=sum_m=0^infty lambda_m x^2m+1$ of the transcendental equation $u-sin(u)=x^3/6$ around $x=0$. Term-by-term comparison gives



$$
lambda_0=1\
lambda_1=frac160\
lambda_2=frac11400\
lambda_3=frac125200\
lambda_4=frac4317248000\
lambda_5=frac12137207200000\
lambda_6=frac15143912713500800000\
lambda_7=frac3322738118080000000\
lambda_8=frac16542537833252957982717440000000\
lambda_9=frac887278009177399104762880000000\
lambda_10=frac1523380122455939217856135377920000000000\
ldots
$$



These coefficients can be calculated efficiently with the Mathematica code





λ[0] = 1;
λ[m_Integer /; m >= 1] := λ[m] = Module[Λ, u, x,
u = Sum[λ[j] x^(2 j + 1), j, 0, m - 1] + Λ x^(2 m + 1);
Λ /. First[Solve[SeriesCoefficient[u - Sin[u], x, 0, 2 m + 3] == 0, Λ]]]


Or all at once by series inversion (thanks to J.M.): calculate $lambda_0ldotslambda_n$ with





With[n = 5,
ComposeSeries[InverseSeries[Series[u-Sin[u], u,0,2n+3]], x^3/6 + O[x]^(2n+5)]]



$$
x+fracx^360+fracx^51400+fracx^725200+frac43 x^917248000+frac1213x^117207200000+mathcalO(x^12)
$$




Thanks to J.M. who pointed out Meissel's paper to me.






share|cite|improve this answer











$endgroup$



The answer is given by Ernst Meissel in this 1891 paper (in German):



$$
J_n(n) = frac1pi
sum_m=0^infty
lambda_m cdot
Gammaleft(frac2m+43right)
cdot left(frac6nright)^frac2m+13
cdot cosleft(frac2m+16piright)
$$



The coefficients $lambda_m$ describe the Taylor series of the solution $u(x)=sum_m=0^infty lambda_m x^2m+1$ of the transcendental equation $u-sin(u)=x^3/6$ around $x=0$. Term-by-term comparison gives



$$
lambda_0=1\
lambda_1=frac160\
lambda_2=frac11400\
lambda_3=frac125200\
lambda_4=frac4317248000\
lambda_5=frac12137207200000\
lambda_6=frac15143912713500800000\
lambda_7=frac3322738118080000000\
lambda_8=frac16542537833252957982717440000000\
lambda_9=frac887278009177399104762880000000\
lambda_10=frac1523380122455939217856135377920000000000\
ldots
$$



These coefficients can be calculated efficiently with the Mathematica code





λ[0] = 1;
λ[m_Integer /; m >= 1] := λ[m] = Module[Λ, u, x,
u = Sum[λ[j] x^(2 j + 1), j, 0, m - 1] + Λ x^(2 m + 1);
Λ /. First[Solve[SeriesCoefficient[u - Sin[u], x, 0, 2 m + 3] == 0, Λ]]]


Or all at once by series inversion (thanks to J.M.): calculate $lambda_0ldotslambda_n$ with





With[n = 5,
ComposeSeries[InverseSeries[Series[u-Sin[u], u,0,2n+3]], x^3/6 + O[x]^(2n+5)]]



$$
x+fracx^360+fracx^51400+fracx^725200+frac43 x^917248000+frac1213x^117207200000+mathcalO(x^12)
$$




Thanks to J.M. who pointed out Meissel's paper to me.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Mar 27 at 10:51

























answered Mar 26 at 13:43









RomanRoman

2188




2188







  • 1




    $begingroup$
    If you need a whole pile at once: ComposeSeries[InverseSeries[Series[u - Sin[u], u, 0, 25]], x^3/6 + O[x]^25]
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 14:19










  • $begingroup$
    Thanks @J.M.isnotamathematician , I was wondering how to make InverseSeries work on this case.
    $endgroup$
    – Roman
    Mar 26 at 14:35












  • 1




    $begingroup$
    If you need a whole pile at once: ComposeSeries[InverseSeries[Series[u - Sin[u], u, 0, 25]], x^3/6 + O[x]^25]
    $endgroup$
    – J. M. is a poor mathematician
    Mar 26 at 14:19










  • $begingroup$
    Thanks @J.M.isnotamathematician , I was wondering how to make InverseSeries work on this case.
    $endgroup$
    – Roman
    Mar 26 at 14:35







1




1




$begingroup$
If you need a whole pile at once: ComposeSeries[InverseSeries[Series[u - Sin[u], u, 0, 25]], x^3/6 + O[x]^25]
$endgroup$
– J. M. is a poor mathematician
Mar 26 at 14:19




$begingroup$
If you need a whole pile at once: ComposeSeries[InverseSeries[Series[u - Sin[u], u, 0, 25]], x^3/6 + O[x]^25]
$endgroup$
– J. M. is a poor mathematician
Mar 26 at 14:19












$begingroup$
Thanks @J.M.isnotamathematician , I was wondering how to make InverseSeries work on this case.
$endgroup$
– Roman
Mar 26 at 14:35




$begingroup$
Thanks @J.M.isnotamathematician , I was wondering how to make InverseSeries work on this case.
$endgroup$
– Roman
Mar 26 at 14:35

















draft saved

draft discarded
















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3162888%2fwhat-is-the-puiseux-series-of-the-bessel-function-j-nn%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye

random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer