搜索资源列表
contor
- 简单的分形算法,主要是是演示康托三分集的形成-simple fractal algorithm is mainly Cantor is to demonstrate the formation of a third set
Cantor 表问题
- Cantor 表问题： 问题描述： 把分子和分母均小于108 的分数按下面的办法排成一个数表。 1/1 1/2 1/3 1/4 1/5 ... 2/1 2/2 2/3 2/4 2/5 ... 3/1 3/2 3/3 3/4 3/5 ... 4/1 4/2 4/3 4/4 4/5 ... 5/1 5/2 5/3 5/4 5/5 ... ... ... 我们以Z 方形方法给上表的每项编号。第一项是1/1，第二项是1/2， 然后是2/1，3/1，2/2，1/3，1/4，2/3，3/2，4/1，5/1，
fenxing
- matlab的分形程序：康托集，koch树等-matlab fractal procedures: Cantor sets, koch trees, etc.
fractal
- 分形计算的几个程序原码，可用于康托集，求解非线性方程，分形树，分形维计算，庞加莱截面描述等功能，共19个程序或函数-Fractal several procedures for calculating the original code, can be used for Cantor sets, solving nonlinear equations, fractal tree, the fractal dimension, the Poincare cross-section describe
CantorDust
- cantor dust programm using iteration
8numcant
- 广度搜索八数码问题，用康托展开判重，哈希表的思想。-BFS 8 digital issues, with Cantor re-start negotiations, hash table ideas.
MATLABprogram4fractal
- 一些基本的分形的MATLAB程序，比如cantor集，Julia集，分形树的绘制等-Some of the basic fractal MATLAB program, such as the cantor set, Julia sets, fractal tree drawing, etc.
KaSaC
- Koch曲线、Sierpinski三角形、Cantor集的MATLAB实现代码 含结果图-Koch curve, Sierpinski triangle, Cantor set of MATLAB implementation code contains the results of Figure
cantor
- Cantor in chaotic analysis in quasi-periodic root to chaos
cantor
- 该函数实现了cantor三分集的生成，例如输入cantor(0,0,1,0)即可产生[0,1]区间的三分集-The function implements the generation of the cantor ternary set, for example, enter the cantor (0,0,1,0) to generate the third set of the interval [0,1]
sicily-1150
- sicily 1150 简单魔板。使用坎托展开，-sicily 1150 simple magic board. Use Cantor expansion
0.4P2
- You can use it to make the singularity spectrum of the cantor set .The syms is 0.4P2.
queenList1
- 八皇后问题最早是由国际西洋棋棋手马克斯·贝瑟尔于1848年提出。之后陆续有数学家对其进行研究，其中包括高斯和康托，并且将其推广为更一般的n皇后摆放问题。八皇后问题的第一个解是在1850年由弗朗兹·诺克给出的。诺克也是首先将问题推广到更一般的n皇后摆放问题的人之一。1874年，S.冈德尔提出了一个通过行列式来求解的方法，这个方法后来又被J.W.L.格莱舍加以改进。-Eight queens problem was first proposed by the International Chess
cantor
- 一、Cantor三分集的递归算法 选取一个欧氏长度的直线段，将该线段三等分，去掉中间一段，剩下两段。将剩下的两段分别再三等分，各去掉中间一段，剩下四段。将这样的操作继续下去，直到无穷，则可得到一个离散的点集。点数趋于无穷多，而欧氏长度趋于零。经无限操作，达到极限时所得到的离散点集称之为Cantor集。-A recursive algorithm selection Cantor ternary set a Euclidean line segment length, the three eq
Cantor-dash
- 新手写的cantor dust算法，逻辑可能有点混乱，欢迎大神批评指正-The new algorithm handwritten cantor dust, logic may be a bit confusing, welcome to the great God criticism
sier_pinski
- Instead of using classical Cantor iteration algorithm,we introduce a cellular automation approach to the construction of Sierpinski triangle,which is simple,direct and magic.