tetration base conversion, and sexp/slog limit equations - Printable Version +- Tetration Forum ( https://math.eretrandre.org/tetrationforum)+-- Forum: Tetration and Related Topics ( https://math.eretrandre.org/tetrationforum/forumdisplay.php?fid=1)+--- Forum: Mathematical and General Discussion ( https://math.eretrandre.org/tetrationforum/forumdisplay.php?fid=3)+--- Thread: tetration base conversion, and sexp/slog limit equations ( /showthread.php?tid=236) |

RE: tetration base conversion, uniqueness criterion? - sheldonison - 02/22/2009
Bo, Thanks for your reply. bo198214 Wrote:How do you make use of this increased linearity to define ( little bigger thean )? Yes, I'm using these equations. In particular, I did a lot of work on the critical section, with most of my results posted here. I rediscovered the same critical section that Jay discovered for any arbitrary base b larger than , but I also extended the results by finding the equations for a smooth 2nd and 3rd derivative for the function for the critical unit section from . The link shows how that a linear approximation has a continuous first derivative, since the 1st derivative is equal on both endpoints of the critical section, and I also posted the equations for a continuous 2nd derivative (3rd order approximation), and a continuous 3rd derivative (4th order approximation). Quote:The data in this posts used b=1.485 (mostly an arbitrary number larger than ). To improve convergence, I used a 3rd order polynomial estimate for the critical section (2nd order smooth derivative), and used the delta to the 4th order polynomial approximation (with a 3rd order smooth derivative) as the error term. I also tried a second base a little smaller than the first, and got similar results consistent to within about in the conversion to base e.Quote:The wobble turned out to be quite a bit larger than the error term for my estimates,How do you obtain the error term? Quote:I see, the proper tetrational should become more and more linear when the base approaches from above, and is characterized by this demand.Lots of difficulties. The easy part is defining a sequence that approaches , and showing that the sequence itself has continually reducing relative error terms in the critical section, and by extrapolation, all of the sexp curve. But then for each element in the sequence, the base conversion constant must be calculated. That requires a sequence. Then one must show the base conversion factor converges to a value. I think the base conversion factor can be shown to converge to a value for each term in the sequence, but that's not the same as showing it converges to the same value as b approaches . Then one must show that the resulting tetration curve converting from base b as it approaches converges when it is converted to another arbitrary tetration base curve (it may not converge). RE: tetration base conversion, uniqueness criterion? - sheldonison - 02/22/2009
bo198214 Wrote:Here I see some difficulties to put that mathematically. You want to define tetration only for one base, but "approaching" means that you have to define tetration at least for a sequence of bases. OK, here's my proposal for a rigorous mathematical approach -- going all the way back to my original post: > This is equivalent to analyzing the following equation as b approaches , for increasing values of n. Subtracting the two terms slog terms from each other cancels out the fact that slog(x) increases as the base approaches . There are other ways to handle this, but this is a concise way to handle it in a limit equation. In these equation, slog refers to the slog with a linear approximation of the critical section. First off, we can show that as n increases, the series converges for any individual value of b, (convergence as n increases is an easier problem discussed in the base conversion post by Jay; values of n>6 ought to give more or less unlimited accuracy for bases greater than 2). The harder part is to show that the limit converges as b approaches . If it converges, an extension of the sexp/slog function to real numbers can be defined. As an example of how this equation could define the sexp/slog function extension to real numbers, consider the following equation, where x is a real number. If the limit above converges, then the limit below should converge to x. With a little additional algebra, this allows defining an sexp/slog extension to real numbers, for base e, by iterating the ln function "n" times. In practice, for base e, using n=5 will give approximately a million digits of precision for positive values of x. This also works for any other arbitrary base. RE: tetration base conversion, uniqueness criterion? - sheldonison - 02/24/2009
sheldonison Wrote:....In this post, I will use this equation to derive the , accurate to five significant digits, using a linear approximation of sexp/slog. I haven't made any progress in proving the limit converges, but assuming it does, earlier in this thread I derived the error term of a linear approximation as the base approaches . error term =~ relative error term =~ with m=, as b approaches , The error term uses the difference between a linear approximation, and a 3rd order approximation for the critical section. A linear approximation has a continuous 1st derivative, and a 3rd order approximation has a continuous 2nd derivative. For this example, use a linear approximation to calculate sexp_e(-0.5), accurate to five significant digits. The relative error term required would be , which leads to m=~1/295. Use b=+(1/1500). As a comparison, the other results I used were +(1/25), but using a third order approximation. The base being used here is much closer to , and there are a lot more iterations. Starting with the limit equation, I picked a value of n=5, for sexp_e(5). My excel spreadsheet can't handle sexp_e(5), but it can handle x=slog_b(slog_b(sexp_e(5)), which is x=10355300. Then, keep iterating x=log_b(x), another 65 times, for a total of 67 log_b iterations, until the value of x is less then log_b(e). I stopped at x=2.71365. Now that x is in the linear region of the slog_b(x) curve, let x= sexp_b(slog_b(x)-0.5). For the slog_b function, I got a remainder term of 0.638016. Subtract 0.5, and use the linear approximation to begin the conversion back to the sexp_b, x=2.71194. The error term doubles to +/-0.000002 since two different linear approximations are required, one for the slog_b and another for the sexp_b. Now iterate, taking x=b^x 66 times. I got x=5.36*10^77. One last exponentiation will be too large for the spread sheet, so I pair it up with the first ln. Let x= ln(ln(ln(ln(ln(b^x))))). The result I got was sexp(-0.5)=0.497818+/-0.00002. Using the more accurate 3rd order approximation for the critical section, I got sexp(-0.5)=0.49783297. The delta between the two values was 1.5*10^-5 which is less than 2*10^-5. The next thing I plan to do is to convert the base=e sexp function posted by Kouznetsov to another base, probably b=1.45, and graph the equations and derivatives to show that Kouznetsov's sexp function requires a 1-cyclic definition of sexp/slog base conversions, as the limit cannot converge to a constant, but instead wobbles. Jay noticed the same thing for Andy's sexp/slog extension to real numbers. I will also graph the sexp_e function converting from base=1.45. Any other suggestions? RE: tetration base conversion, uniqueness criterion? - bo198214 - 02/24/2009
sheldonison Wrote: A very appealing formula (though the two limits belong to the right side of the equal sign)! For my taste, if I rewrite and generalize your formula a bit ad hoc (dont know whether it is true in that form): has a big similarity to Zdun's [1] formula for regular iteration (where is assumed to have fixed point at 0): , . Only is replaced by . But be aware that , which makes the similarity even more striking. [1] Zdun, Marek Cezary. Regular fractional iterations. Aequationes Math. 28 (1985), no. 1-2, 73--79. MR0781210 RE: tetration base conversion, uniqueness criterion? - bo198214 - 02/24/2009
bo198214 Wrote: I wonder whether this formula works also if we dont take the limit but directly put: where of course we can again replace where we can compute by regular iteration because it has a fixed point at (though not with Zdun's formula as his formula is only valid for while ). RE: tetration base conversion, uniqueness criterion? - sheldonison - 02/24/2009
bo198214 Wrote:bo198214 Wrote: In your equations, what does mean? And what does mean? I assume this is the mathematical shorthand for iterating "n" times. I'm going to have to get some education in higher mathematics . What does mean? Is it restricted to values of x<e? And doesn't that limit the usefulness of the equation? RE: tetration base conversion, uniqueness criterion? - bo198214 - 02/24/2009
sheldonison Wrote:In your equations, what does mean? And what does mean? I assume this is the mathematical shorthand for iterating "n" times.Yes, but its not that common in higher mathematics. I use it to distinguish from the multiplicative power . Quote:What does mean? Is it restricted to values of x<e? And doesn't that limit the usefulness of the equation?Yes you are right, lets forget about that idea. RE: tetration base conversion, and sexp/slog limit equations - sheldonison - 02/26/2009
I generated two graphs using excel, one for sexp(base e), and the other for sexp(base 1.45). For the most interesting graph, I used the sexp base conversion equation to generate sexp base 1.45 from the taylor series for the published sexp base e equations. The data itself looks linear, but the first derivative is wobbly, indicating that the published taylor series is inconsistent with a base conversion definition of sexp/slog. The second graph shows that the conversion from base 1.45 to base e is well behaved, at least to the accuracy that can be seen from the approximation. The base conversion equations are symmetrical, so this sexp_e would convert cleanly back to base 1.45. The sexp data for base e for the second graph is close to what I originally posted. It should be accurate to six significant digits, and was generated with the base conversion equation using a 3rd order approximation for the critical section of base 1.45. For higher precision, and to help determine whether or not the base conversion equation converges, I need to download mathematica, and generate data using higher precision arithmetic. I also plan to generate graphs converting to base 2, and base 10, and post those results as well. -1.00 0.000000000 -0.95 0.053832512 -0.90 0.106246779 -0.85 0.157466974 -0.80 0.207696439 -0.75 0.257121484 -0.70 0.305914394 -0.65 0.354235817 -0.60 0.402236633 -0.55 0.450059416 -0.50 0.497839585 -0.45 0.545706334 -0.40 0.593783475 -0.35 0.642190320 -0.30 0.691042745 -0.25 0.740454582 -0.20 0.790539404 -0.15 0.841412723 -0.10 0.893194454 -0.05 0.946011467 +0.00 1.000000000 RE: tetration base conversion, and sexp/slog limit equations - bo198214 - 02/26/2009
On the other hand Dmitrii's plot of the derivatives looks quite like yours: where is red; is green; is blue; is pink. Compared with Jays suggestion, which has a completely different second derivation: [attachment=3] So can it just be a rounding error (Taylor series)? And why not ask Dmitrii, to compute for to infinity, whether it wobbles or not Dmitrii, can you do this? RE: tetration base conversion, and sexp/slog limit equations - sheldonison - 02/26/2009
bo198214 Wrote:On the other hand Dmitrii's plot of the derivatives looks quite like yours:No, its not a rounding error..... I'm not sure how the higher order derivatives will behave as the base approaches , but the lower derivatives should behave similar to Dimitrii's result. The correct equation to have Dimitrii verify has 1-cyclic convergence as x increases is . For integer values of x, I calculated a base conversion constant of 40.036534. The wobble is not particular large, and has a peak to peak range of about 0.0008. Also, the wobble for base 1.45 is not all that different than the wobble Dimitrii would calculate for any other pair of bases, using his sexp/slog. Its just that a base like 1.45 has fewer degrees of freedom, so the equations derived using my base conversion equation from Dimitrii's equations already show the wobble in the first derivative of the equation. By the way Jay noticed the wobble in a previous post, which makes me wonder how the higher order derivatives will behave, when converting from a base approaching . So far, the 1st, 2nd and 3rd derivatives look well behaved, but after that, I'm outside of the error range of my calculations. jaydfox Wrote:.... |