In older versions of Mathematica, there was a function called SequenceLimit that allowed taking the limit of a numerical sequence. It is useful for speeding up the convergence of numerical algorithms, and sometimes for getting them unstuck using the last few results. What happened to it? Any improvements available?


SequenceLimit became NumericalMath`NSequenceLimit. In the past, that change broke some of the examples on NLimit that used SequenceLimit. I reported the breakage, and the examples were fixed to use the same syntax but not actually call the now-non-existent function. The only remaining reference in the documentation that I can find to the use of SequenceLimit as if it were still a function is on the last bullet point of NLimit's detailed description for its Method option: "uses SequenceLimit on constructed sequence".

Recently, I started investigating the behavior of NumericalMath`NSequenceLimit because I need it in my engineering work. I feel NumericalMath`NSequenceLimit has some quite confusing shortcomings in regard to the approximation it returns vs. the number of terms supplied, so I wrote my own version below from some references. I also posted a C++ gist version on GitHub.

A comparison appears below showing the convergence of partial sums of series approximations to Pi and E. Afterward, I use symbolic lists to document several parts of NumericalMath`NSequenceLimit that seem... possibly wrong... to me.



(*my answer is closer to Pi~=3.141, for good reason as shown
  below in the general case with 4 terms {a,b,c,d}*)

sE@n_:=Piecewise[{{(1+1/n)^n ,n!=0}},1] 


(*my answer is closer to E~=2.71828, for good reason as shown
  below in the general case with 4 terms {a,b,c,d}*)

Below, I illustrate the difference between the behavior of the built-in NumericalMath`NSequenceLimit function vs. my sequenceLimit function for symbolic lists, like {a,b,c,d}.

(*yes, unevaluated with 3 inputs*)

sequenceLimit[{a,b,c}]//Simplify (*my function*)
(*same as Mathematica's next result with 4 inputs*)

(*yes, only references a, b, & c not the later, more converged, d*)

sequenceLimit[{a,b,c,d}]//Simplify (*my function*)
(*note use of d, which explains why my approximations
  for Pi and E above are better*)

(*yes, same result as with 4 terms, no d or e in output*)

sequenceLimit[{a,b,c,d,e}]//Simplify (*my function*)
(*note use of d and e*)

I also document some error messages that seem spurious.

(*NumericalMath`NSequenceLimit::seqw Sequence of length 1
  is too short for use with Degree -> 1*)
(*NumericalMath`NSequenceLimit::bdmtd WynnEpsilon is not
  a valid specification of a sequence limit extrapolation

NumericalMath`NSequenceLimit[{a},Degree->1]; (*Nulled output*)
(*NumericalMath`NSequenceLimit:optx Unknown option ° in 

NumericalMath`NSequenceLimit[{a},"Degree"->1]; (*Note quotes*)
(*NumericalMath`NSequenceLimit::optx Unknown option "Degree"
  in NumericalMath`NSequenceLimit[{a}]*)

sequenceLimit[{a}] (*sequence limit is my function*)

Quiet@NumericalMath`NSequenceLimit[{a,b}] (*Note Quiet & no evaluation*)

sequenceLimit[{a,b}] (*my function*)

Everything above is from the current version of Mathematica Online.

(*11.3.0 for Linux x86 (64-bit) (March 7, 2018)*)

Here is the definition of my function

wynnE[rkp1_,n_,s_]:=(*wynnE[rkp1,n,s]=*)(*optional caching*)

  • $\begingroup$ DiscreteLimit[Sum[4 (-1)^nn/(2 nn + 1), {nn, 0, n}], n -> Infinity] performs [Pi] . $\endgroup$ – user64494 Jul 18 '18 at 19:32
  • $\begingroup$ Please give a concrete example. $\endgroup$ – user64494 Jul 18 '18 at 19:59
  • $\begingroup$ All that is based on four numbers is built on sand. $\endgroup$ – user64494 Jul 18 '18 at 20:07
  • $\begingroup$ I gave a compact implementation of Wynn $\varepsilon$ here. The generalization due to van den Broeck and Schwartz that I implemented here might be useful as well. Maybe you know this already, but you can use PadeApproximant[] as an additional check if you're using a sequence of partial sums of a power series. $\endgroup$ – J. M.'s torpor Sep 25 '18 at 13:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.