搜索资源列表
AddressBook_good
- 高级程序开发，用Ｃ＃编的，小得不能再小了，是我编的第一个程序，很垃圾。初作，发上来让大家当笑话看的-senior program development with C# Part of the small irreducible small, I was part of a process, is rubbish. For early, onto a joke so we can see
AddressBook_good
- 高级程序开发，用Ｃ＃编的，小得不能再小了，是我编的第一个程序，很垃圾。初作，发上来让大家当笑话看的-senior program development with C# Part of the small irreducible small, I was part of a process, is rubbish. For early, onto a joke so we can see
duoxianshi
- 不可约多项式与本原多项式.PDF 不可约多项式与本原多项式.PDF-Irreducible polynomials with the primitive polynomial. PDF irreducible polynomial and primitive polynomial. PDF
ploy
- 能求一个不可约的多项式的阶，在“项数”输入多项式在几项，指数中输入指数是多少。用“，”号隔开 -To seek an irreducible polynomial of order, the " item number" enter the polynomial in the number, enter the index number of the index. With " ," separate
Sequence
- 一个法雷序列算法，对任意给定的一个自然数(n<=100),将分母小于等于n的不可约的真分数按上升的次序排序,并且在第一个分数前加上0/1, 而在最后一个分数后加上1/1。-A method mine sequential algorithm, for any given a natural number (n < = 100), less than or equal to the denominator of the prop
Farey-sequence
- 对任意给定的一个自然数n，将分母≤n的不可约的真分数按照升序排列，并且在第一个分数前面加上数0/1，在最后一个分数后面加上数1/1，这个序列被称之为n级法雷序列，以Fn表示。-Irreducible the proper fraction of any given natural number n, the denominator ≤ n in ascending order, and in front of the first a
matrix
- matrix theory：Mathematically rigorous introduction covers vector and matrix norms, the condition-number of a matrix, positive and irreducible matrices, much more.-matrix theory
Fact
- 定义一个类Fact表示无符号有理数（分数），成员有分子（num）和分母(den) 构造函数2个 一组get方法 一组set方法 方法： -比较两个分数的大小，结果为boolen的值 -对分数进行约分（分子分母同时除以最大公约数） -对两个分数进行通分（先约分） -两个分数相加，结果为不可约数（先通分，然后再约分） 定义testFact类，创建Fact对象，并调用各个方法-The definition
G-S
- 本程序为G-S迭代法，若系数矩阵满足 1.G-S迭代矩阵谱半径小于一 2.jacobi迭代矩阵一范数或无穷范数小于一 3.系数矩阵A正定 4.系数矩阵A严格对角占优或不可约对角占优 则可返回A*x=b的解。算法迭代次数比 x=M*x+g形式的标准化迭代次数多，但所用时间少很多。-The program for the G-S iteration method, if the coefficient matrix
well-program
- 常规资料计算束缚水饱和度，是用于常规的资料处理等-Conventional data irreducible water saturation for conventional data processing
Tate_Bilinear_Pairing_latest.tar
- The Tate Bilinear Pairing core is for calculating Tate bilinear pairing especially on super-singular elliptic curve in affine coordinates defined over a Galois field , whose irreducible polynomial is . (For improving
Irreducible-polynomial
- How to get irreducible polynomial in channel coding
polynomial_test
- 根据所输入的素数和级数生成相应的不可约多项式，并输出系数列表。(According to the input of prime Numbers and series to generate the corresponding irreducible polynomials, and the output coefficient list.)