The Mandelbrot set is a set that does not diverge to infinity in the following recurrence formula.
I modified the page to draw the Mandelbrot set of Mr. Kostas Symeonidis based on GPLv3 and made the following page by adding animation capabilities.
If you make a rectangle by dragging the mouse, you can expand its area. [Iterations] is the number of iterations of the calculation. Number of iterations of the initial state is 16. When you press the [Start] button to display the animation of the number of iterations increasing. You can observe the Mandelbrot Set is configured to correspond to the number of iterations increases.
When you expand the Mandelbrot set near the origin, you can see the following image.
We can see the spiral of the Mandelbrot set on the following page.
You will descend to the location of the image with the animation from the bird's eye view of the Mandelbrot set.
The Mandelbrot set was configured with the following recurrence formula.
Is it possible to configure the set by the following recurrence formula of the exponential?
We can configure the set by the above recurrence formula. We can confirm it on the following page.
Number of iterations of the initial state is 4. When you press the [Start] button to display the animation of the number of iterations increasing.
When you expand the Mandelbrot set near the origin, you can see the following image.
We can see the spiral of the Mandelbrot set of exponential on the following page. Please note that the page needs long calculation time.
The zeta function is the function expressed by the following series.
$$ \zeta(s)=\frac{1}{1^s} + \frac{1}{2^s} + \frac{1}{3^s} + \cdots $$We can confirm the graph on the following page.
I used Canvas and Web Workers of the JavaScript to draw the screen. [Term number] is the number of terms of the calculating formula. Number of terms of the initial state is 16. When you press the [Start] button to display the animation of the number of terms increasing. You can observe the zeros are configured to correspond to the number of terms increases.
Description:
The Mandelbrot set was configured with the following recurrence formula.
Is it possible to configure the set by the following recurrence formula of the zeta function?
We can configure the set by the above recurrence formula. We can confirm it on the following page.
When you press the [Start] button of [Iterations] to display the animation of the number of iterations increasing. When you press the [Start] button of [Term number] to display the animation of the number of terms increasing.
J. C. Woon of Cambridge University introduced the Mandelbrot set of the zeta function in 1998.
When you expand the Mandelbrot set near the point of zero, you can see the following image. Please note that the page needs long calculation time.
We can see the spiral of The Mandelbrot set of the zeta function on the following page. Please note that the page needs very long calculation time.
The above picture looks like a flower.
Each Mandelbrot set includes a similar image as shown in the following table.
| F (z) | z 2 | ez | ζ(z ) |
|---|---|---|---|
| Panoramic view |
|
|
|
| Origin /zero |
|
|
|
| Spiral | |
|
|
I guess the following reasons.
What is the physical meaning of the set?
One point of the Mandelbrot set will converge or diverge to infinity. On the other hand, the universe retracts or expands endlessly. One point of the Mandelbrot set might correspond to a certain universe.
The following calculating formula does not have good convergence.
$$ \zeta(s)=\frac{1}{1^s} + \frac{1}{2^s} + \frac{1}{3^s} + \cdots $$So we use the following calculating formulas.
We confirm the arithmetic precision of each calculating formula on the following page.
Arithmetic precision of calculating formula
I explain these formulas in the following sections.
Euler introduced the asymptotic expansion of the zeta function by Euler-Maclaurin formula. When you press the button [ζ_AE] you can confirm it on the page of the graph.
$$ \zeta_{AE}(s)=\sum_{k=1}^{q-1}\frac{1}{k^s} + \sum_{k=0}^{r} \frac{B_k}{k!}\;\;\frac{\Gamma(s+k-1)}{\Gamma(s)q^{s + k-1}} $$Here, Bk is the Bernoulli numbers. We use the Bernoulli polynomials Bk(1) as the Bernoulli numbers on this page. The variable q of the above formula is the number of terms ([Term number]). In addition, we calculate in r = q. We use the following formula in the domain with the number of terms more of 14 and more and the real part of s of -10 and less because a calculation error is large.
$$ \zeta(1-s) = \frac{2}{(2\pi)^s}\;\;\Gamma(s)\;\;\cos \Bigl(\frac{\pi}{2}s \Bigr) \; \zeta(s) $$The above calculating formula is the functional equation that mathematician Riemann showed in his paper in 1859. It is called "Riemann functional equation."
Knopp conjectured the following calculating formula around 1930. The formula was proved by Hasse in 1930. When you press the button [ζ_KH] you can confirm it in the page of the graph.
$$ \zeta_{KH}(s)=\frac{1}{1-2^{1-s}}\sum_{n=0}^q\frac{1}{2^{n + 1}} \sum_{k=0}^{n}{n \choose k}\frac{(-1)^k}{(k + 1)^s} $$We use the Riemann functional equation in the domain with the number of terms of 27 and more and the real part of s of -7 and less because a calculation error is large.
Peter Borwein published the following calculating formula in 2000. When you press the button [ζ_PB] you can confirm it in the page of the graph.
$$ \zeta_{PB}(s)=\frac{1}{1-2^{1-s}} \;\;\;\frac{-1}{d_q} \sum_{k=0}^{q-1}(d_k-d_q)\frac{(-1)^k}{(k + 1)^s} $$We use the Riemann functional equation in the domain with the number of terms of 32 and more and the real part of s of -7 and less because a calculation error is large.
©2013, xseek-qm.net
Sponsored Link
