Search - set of complex number

Search - set of complex number - List

[Fractal program] cutphoto DL : 0: 第一幅图被称作曼德勃罗特集，曼德勃罗特集的数学模型非常简单。假设有复数Z和μ，用下式迭代计算：Z=Z2＋μ，由于μ的取值不同，经过若干次数迭代以后Z的幅值可能趋向无穷，也可能保持有界，曼德勃罗特集就是那些使Z保持有界的μ的集合，把μ在复平面上的分布作成图像，就像上面演示的那样具有极其复杂的结构。假设屏幕的分辨率为640×480。 -section known as a map Mandebo Lott set Mandebo Lott episode is very simple mathematical model. Assuming that there is a plural Z and , with the following iterative calculation : Z = Z2 + , because the value of different , after several iteration number Z after the amplitude may tend to infinity. May also maintained sector, Mandebo Lott who is set to make Z maintained sector pool put on the complex plane make the distribution of images, as demonstrated above in the extremely complex structure. Assuming screen resolution of 640 480.
Date : 2008-10-13 Size : 3.59kb User : 飞机
[Fractal program] ising_model DL : 0: 给出了二次函数的Julia集分形图的概念及逃逸时间算法绘制复杂分形图的基本原理,对Julia集给出了严格的数学定义.逃逸时间算法即取定迭代次数界限N,经N次迭代后,若x点仍在给定的区域内,则认为x是分形A中的点否则x不是分形A中的点.该算法同样适用于Mandelbrot集、Sierpinski三角形等其他复杂分形图.试验表明,该算法绘制的Julia集分形图准确有效、优美清晰,算法简单实用. -given quadratic function of the Julia set fractal images and the concept of escape time algorithm mapping complex fractal graph - The principle of Julia Sets is a strict mathematical definition. Escape from time algorithm that will limit the number of iterations N, by the N-th iteration, if x is still point to the region, think x A fractal is the point otherwise x A fractal is not the point. It is also applicable to Mandelbro t set, Sierpinski triangle and other complex fractal images. Test shows that The algorithm mapping the Julia set fractal images accurately and effectively, a beautiful clear, simple and practical algorithm.
Date : 2008-10-13 Size : 1.11kb User : 为听
[Fractal program] cutphoto DL : 0: 第一幅图被称作曼德勃罗特集，曼德勃罗特集的数学模型非常简单。假设有复数Z和μ，用下式迭代计算：Z=Z2＋μ，由于μ的取值不同，经过若干次数迭代以后Z的幅值可能趋向无穷，也可能保持有界，曼德勃罗特集就是那些使Z保持有界的μ的集合，把μ在复平面上的分布作成图像，就像上面演示的那样具有极其复杂的结构。假设屏幕的分辨率为640×480。 -section known as a map Mandebo Lott set Mandebo Lott episode is very simple mathematical model. Assuming that there is a plural Z and , with the following iterative calculation : Z = Z2+ , because the value of different , after several iteration number Z after the amplitude may tend to infinity. May also maintained sector, Mandebo Lott who is set to make Z maintained sector pool put on the complex plane make the distribution of images, as demonstrated above in the extremely complex structure. Assuming screen resolution of 640 480.
Date : 2025-12-29 Size : 3kb User : 飞机
[Fractal program] ising_model DL : 0: 给出了二次函数的Julia集分形图的概念及逃逸时间算法绘制复杂分形图的基本原理,对Julia集给出了严格的数学定义.逃逸时间算法即取定迭代次数界限N,经N次迭代后,若x点仍在给定的区域内,则认为x是分形A中的点否则x不是分形A中的点.该算法同样适用于Mandelbrot集、Sierpinski三角形等其他复杂分形图.试验表明,该算法绘制的Julia集分形图准确有效、优美清晰,算法简单实用. -given quadratic function of the Julia set fractal images and the concept of escape time algorithm mapping complex fractal graph- The principle of Julia Sets is a strict mathematical definition. Escape from time algorithm that will limit the number of iterations N, by the N-th iteration, if x is still point to the region, think x A fractal is the point otherwise x A fractal is not the point. It is also applicable to Mandelbro t set, Sierpinski triangle and other complex fractal images. Test shows that The algorithm mapping the Julia set fractal images accurately and effectively, a beautiful clear, simple and practical algorithm.
Date : 2025-12-29 Size : 1kb User : 为听