3. SymmetrogramsThe shortcoming of the "Brownian frieze" method is that two different numbers may have the same graph due to this restrictive second step of Algorithm A that performs "mod 8" operation. Besides, b(x) are long graphs that sometimes look "fuzzy" and occasionally not very aesthetic. The next algorithm is also based on continued fraction expansion and partly removes the above shortcomings although the output graphics is quite different than in the previous section.. 2. Create a sequence of pairs {(a_{k}, a_{m-k}), k = 0, 1,..., m}; E-numbers are peculiar as in the case of Brownian walk graphs. Here we display the sequence g(e,50), g(e^{2},65), g(e^{3},30) and g(e^{1/4},70) (figure below).
The first two subpictures of the next figure represents g(Log (2), 17), g(Log (3), 9). Next two subfigures show the dependence of a symmetrogram on m - the length of the sequence {a_{k}}. These contains the graphs g(g, 18) and g(g,32) (g » 0.577216..., the Euler gamma). The next row shows symmetrograms of numbers obtained by the Bessel function of the first kind, J_{n}(x), i.e. g(J_{4}(2.1),26), g(J_{4}(8),12), g(J_{2}(9),12) and g(J_{4}(e),39). Symmetrograms, obtained by Algorithm B are also numerically very sensitive. This will be confirmed by the leftmost two subframes of the next figure that represents numbers cos (1) and cos (1+ 10^{-10}) for the same m = 27. The rightmost subframes are portraits of sin(1) (8 points) and sin^{2}(1) (39 points). The following four figures show g(Arcsin (1), 12) , g(sh(sin (1)), 20) , g(ch(sh (1)), 12) and g(ch(sin (1)), 23), while the hyperbolic functions produce the symmetrograms g (sh(1),12), g(ch(1),15), g(sh(1),15), and g(sh(0.35),17) shown on the figure below. |