PyPyNum 1.8.0__tar.gz → 1.8.1__tar.gz

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.8.0
+Version: 1.8.1
 Summary: A multifunctional mathematical calculation package written in pure Python programming language [Python>=3.5]
 Home-page: https://www.gitee.com/PythonSJL/PyPyNum
 Author: Shen Jiayi
@@ -692,7 +692,7 @@ Description-Content-Type: text/markdown
 [![Downloads](https://static.pepy.tech/badge/pypynum/month)](https://pepy.tech/project/pypynum)
 [![Downloads](https://static.pepy.tech/badge/pypynum/week)](https://pepy.tech/project/pypynum)
 
-## Version -> 1.8.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
+## Version -> 1.8.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -741,65 +741,11 @@ Python interpreter and run it!)
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-新增代码行数为603行
+eig函数修复了计算错误并改名为eigen
 
-Add 603 new lines of code
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增函数“magic_square”的功能简介：可
-以生成任意大于等于三的整数阶幻方。
-
-Introduction to the newly added
-function "magic square": It can
-generate any integer order magic
-square greater than or equal to
-three.
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增模块“Graph”的功能简介：具有有向图
-、无向图、带权有向图、带权无向图这四个对
-象，支持添加或删除顶点和边，以及深度优先
-搜索与广度优先搜索这两种图的遍历方式，还
-有计算最短路径等功能。
-
-Introduction to the functions of
-the newly added module "Graph":
-it has four objects: directed
-graph, undirected graph,
-weighted directed graph, and
-weighted undirected graph. It
-supports adding or removing
-vertices and edges, as well as
-depth first search and breadth
-first search for graph
-traversal. It also has functions
-such as calculating the shortest
-path.
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增模块“polynomial”的功能简介：有一
-个多项式对象，可以通过传入包含“(次数,
-系数)”的二元组组成的序列创建多项式对象
-，可以随时设置某一项的数值，并且支持多
-项式形式的四则运算，还有取商式、取余式
-、求幂、求模幂的功能。
-
-Introduction to the newly added
-module "polynomial": There is a
-polynomial object that can be
-created by passing in a sequence
-of binary tuples containing
-"degree, coefficient". The value
-of a certain term can be set at
-any time, and it supports
-polynomial form arithmetic
-operations. It also has
-functions such as quotient,
-remainder, exponentiation, and
-modular exponentiation.
+The eig function fixed
+calculation errors and changed
+its name to eigen
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
@@ -808,23 +754,13 @@ modular exponentiation.
 <<<The ellipsis in the following structure represents the original part>>>
 
 PyPyNum
-    ★ Graph [Graph theory]
-        CLASSES
-            BaseGraph
-                BaseWeGraph
-                    WeDiGraph
-                    WeUnGraph
-                DiGraph
-                UnGraph
-    ★ polynomial [Polynomial object]
-        CLASSES
-            Polynomial
-        FUNCTIONS
-            poly(terms=None)
-    ★ tools [Other useful tools]
+    ★ Matrix [Matrix calculation]
         FUNCTIONS
             ...
-            magic_square(n)
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
+            ...
 ```
 
 ### 运行用时测试
@@ -939,14 +875,16 @@ PyPyNum
         CLASSES
             Matrix
         FUNCTIONS
-            eig(matrix)
-            identity(n)
-            lu(matrix)
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            identity(n: int) -> pypynum.Matrix.Matrix
+            lu(matrix: pypynum.Matrix.Matrix) -> tuple
             mat(data)
-            qr(matrix)
+            qr(matrix: pypynum.Matrix.Matrix) -> tuple
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
             same(rows, cols, value=0)
-            svd(matrix)
-            tril_indices(n, k=0, m=None)
+            svd(matrix: pypynum.Matrix.Matrix) -> tuple
+            tril_indices(n: int, k: int = 0, m: int = None) -> tuple
             zeros(_dimensions)
             zeros_like(_nested_list)
     ★ NeuralN [A simple neural network model]
@@ -1130,6 +1068,9 @@ PyPyNum
             average(data, weights, expected=False)
             exgcd(a: int, b: int) -> tuple
             crt(n: arr, a: arr) -> int
+            isqrt(x: int) -> int
+            is_possibly_square(n: int) -> bool
+            is_square(n: int) -> bool
     ★ numbers [Conversion of various numbers]
         FUNCTIONS
             float2fraction(number: float, mixed: bool = False, error: float = 1e-15) -> tuple
@@ -1359,7 +1300,7 @@ print(v1.angles())
 6.62607015e-34
 1.618033988749895
 3.141592653589793
-1000000000000.0
+1000000000000
 
 >>> p = [1, -2, -3, 4]
 >>> m = [
@@ -1373,7 +1314,9 @@ print(v1.angles())
 >>> print(equations.polynomial_equation(p))
 >>> print(equations.linear_equation(*m))
 
-[(-1.5615528128088307-6.5209667308287455e-24j)   (2.5615528128088294+4.456233626665941e-24j)   (1.0000000000000007+3.241554513744382e-25j)]
+[[(-1.5615528128088307-6.5209667308287455e-24j)                                             0                                             0]
+ [                                            0   (2.5615528128088294+4.456233626665941e-24j)                                             0]
+ [                                            0                                             0   (1.0000000000000007+3.241554513744382e-25j)]]
 [ 1.6666666666666667 -0.6666666666666666 -0.4444444444444444]
 
 >>> print(maths.cot(constants.pi / 3))
@@ -1468,10 +1411,10 @@ print(v1.angles())
 >>> print(random.randint(0, 9, [2, 3, 4]))
 >>> print(random.uniform(0, 9, [2, 3, 4]))
 
-[[[0.4334341920363395, 0.055711784711422116, -1.0235500373980284, 0.30031229336738374], [-0.2650367914670356, 0.5513398538865067, -0.9735921328831166, 0.41345578602104827], [-0.11598957920080871, -0.9044539791933183, 1.6448227575237069, -0.26304156924843813]], [[0.27363898507271256, -0.5897181011789576, 1.5120937498473583, 2.1302709742844694], [1.9743293887616236, 0.4117207260898469, 0.5809554193110543, -1.8456249006764007], [1.274481044612177, -0.30645083457981553, -1.3285606156236818, 0.33473439037886943]]]
-[[[0.5269441534226782, 0.36498666932667356, 0.7363066388832684, 0.5878544826035406], [0.5684721009896431, 0.9009577979323332, 0.036288112799501615, 0.18351641818419884], [0.24258369409385339, 0.09354340906140202, 0.4856203412285762, 0.783031677244552]], [[0.8777465681935882, 0.6406910705155251, 0.10275292827025073, 0.01295823682977526], [0.3898500974345528, 0.6216248983423127, 0.3179425906177036, 0.012870877167621808], [0.2660481991211192, 0.09872041627158801, 0.3681944568198672, 0.494087114885137]]]
-[[[5, 9, 5, 6], [6, 7, 6, 1], [1, 3, 2, 4]], [[5, 8, 8, 3], [3, 2, 3, 9], [3, 0, 7, 1]]]
-[[[8.610851610963957, 1.3747433091161905, 1.3831050577679438, 4.715182178697273], [0.8765517657148284, 4.809554825684029, 2.7557819856736137, 5.938765584746821], [6.088739464744903, 4.627722536295625, 0.6116370455995369, 5.875683438664389]], [[7.7228845997304845, 5.428461366109726, 8.02712172516869, 5.9319006090345425], [5.726626482636939, 7.978329508380601, 1.114307478513796, 6.236721706167868], [1.4123245528031072, 5.327811122183013, 7.324213082306745, 1.5016363011868927]]]
+[[[1.524086835643172, -0.20868457467847845, 0.5240261503975477, -0.6439838767682032], [-1.091904210196648, -0.20567633973733265, 1.374424576574523, 0.6563097903476932], [0.2171635934136032, 1.0821030876490199, -0.8410496800310051, -0.8321549344577578]], [[0.5306996954571072, -0.4441704154154241, 1.0481960055260355, 0.39805451821848287], [-0.4006858882593715, -0.06238294764009237, -1.1536673264483728, -0.8063185246185602], [0.3029117113345387, -0.32570360518676644, 0.6608320231980702, 1.7415150171137153]]]
+[[[0.3736243541521843, 0.8599079983285199, 0.4260061864869946, 0.8441437619796597], [0.8955986631978392, 0.7570336992646656, 0.6706841989644684, 0.328634366074538], [0.4371430562585502, 0.9576395263025738, 0.2380278778546957, 0.806813631306664]], [[0.18549375381453237, 0.5749941389233029, 0.7009767023241946, 0.30017399397762223], [0.6661914823434657, 0.7802291606608635, 0.6847755352217044, 0.2661053533652564], [0.07937643994416943, 0.5452043474222034, 0.8026792060861194, 0.07776400257578953]]]
+[[[9, 0, 9, 0], [2, 6, 3, 4], [5, 8, 4, 7]], [[7, 7, 6, 3], [5, 5, 5, 8], [3, 4, 6, 6]]]
+[[[5.049093842782947, 1.3880585421884204, 8.533634113864629, 3.550264239771317], [3.3311351975225176, 5.131771033264564, 0.9570872044431911, 5.165536082759862], [1.2035779060925538, 8.292998518472567, 8.014641974770818, 6.251632912237915]], [[6.411677800595937, 5.365937405245105, 8.70943859614565, 4.348757668525482], [7.827612569569748, 1.3718742546020972, 0.5252489627763138, 2.065015517785291], [4.620664668451086, 2.604569735623819, 5.548107842615733, 7.60342292447815]]]
 
 >>> print(regression.linear_regression(list(range(5)), [2, 4, 6, 7, 8]))
 >>> print(regression.parabolic_regression(list(range(5)), [2, 4, 6, 7, 8]))

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/PyPyNum.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: PyPyNum
-Version: 1.8.0
+Version: 1.8.1
 Summary: A multifunctional mathematical calculation package written in pure Python programming language [Python>=3.5]
 Home-page: https://www.gitee.com/PythonSJL/PyPyNum
 Author: Shen Jiayi
@@ -692,7 +692,7 @@ Description-Content-Type: text/markdown
 [![Downloads](https://static.pepy.tech/badge/pypynum/month)](https://pepy.tech/project/pypynum)
 [![Downloads](https://static.pepy.tech/badge/pypynum/week)](https://pepy.tech/project/pypynum)
 
-## Version -> 1.8.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
+## Version -> 1.8.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -741,65 +741,11 @@ Python interpreter and run it!)
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-新增代码行数为603行
+eig函数修复了计算错误并改名为eigen
 
-Add 603 new lines of code
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增函数“magic_square”的功能简介：可
-以生成任意大于等于三的整数阶幻方。
-
-Introduction to the newly added
-function "magic square": It can
-generate any integer order magic
-square greater than or equal to
-three.
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增模块“Graph”的功能简介：具有有向图
-、无向图、带权有向图、带权无向图这四个对
-象，支持添加或删除顶点和边，以及深度优先
-搜索与广度优先搜索这两种图的遍历方式，还
-有计算最短路径等功能。
-
-Introduction to the functions of
-the newly added module "Graph":
-it has four objects: directed
-graph, undirected graph,
-weighted directed graph, and
-weighted undirected graph. It
-supports adding or removing
-vertices and edges, as well as
-depth first search and breadth
-first search for graph
-traversal. It also has functions
-such as calculating the shortest
-path.
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增模块“polynomial”的功能简介：有一
-个多项式对象，可以通过传入包含“(次数,
-系数)”的二元组组成的序列创建多项式对象
-，可以随时设置某一项的数值，并且支持多
-项式形式的四则运算，还有取商式、取余式
-、求幂、求模幂的功能。
-
-Introduction to the newly added
-module "polynomial": There is a
-polynomial object that can be
-created by passing in a sequence
-of binary tuples containing
-"degree, coefficient". The value
-of a certain term can be set at
-any time, and it supports
-polynomial form arithmetic
-operations. It also has
-functions such as quotient,
-remainder, exponentiation, and
-modular exponentiation.
+The eig function fixed
+calculation errors and changed
+its name to eigen
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
@@ -808,23 +754,13 @@ modular exponentiation.
 <<<The ellipsis in the following structure represents the original part>>>
 
 PyPyNum
-    ★ Graph [Graph theory]
-        CLASSES
-            BaseGraph
-                BaseWeGraph
-                    WeDiGraph
-                    WeUnGraph
-                DiGraph
-                UnGraph
-    ★ polynomial [Polynomial object]
-        CLASSES
-            Polynomial
-        FUNCTIONS
-            poly(terms=None)
-    ★ tools [Other useful tools]
+    ★ Matrix [Matrix calculation]
         FUNCTIONS
             ...
-            magic_square(n)
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
+            ...
 ```
 
 ### 运行用时测试
@@ -939,14 +875,16 @@ PyPyNum
         CLASSES
             Matrix
         FUNCTIONS
-            eig(matrix)
-            identity(n)
-            lu(matrix)
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            identity(n: int) -> pypynum.Matrix.Matrix
+            lu(matrix: pypynum.Matrix.Matrix) -> tuple
             mat(data)
-            qr(matrix)
+            qr(matrix: pypynum.Matrix.Matrix) -> tuple
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
             same(rows, cols, value=0)
-            svd(matrix)
-            tril_indices(n, k=0, m=None)
+            svd(matrix: pypynum.Matrix.Matrix) -> tuple
+            tril_indices(n: int, k: int = 0, m: int = None) -> tuple
             zeros(_dimensions)
             zeros_like(_nested_list)
     ★ NeuralN [A simple neural network model]
@@ -1130,6 +1068,9 @@ PyPyNum
             average(data, weights, expected=False)
             exgcd(a: int, b: int) -> tuple
             crt(n: arr, a: arr) -> int
+            isqrt(x: int) -> int
+            is_possibly_square(n: int) -> bool
+            is_square(n: int) -> bool
     ★ numbers [Conversion of various numbers]
         FUNCTIONS
             float2fraction(number: float, mixed: bool = False, error: float = 1e-15) -> tuple
@@ -1359,7 +1300,7 @@ print(v1.angles())
 6.62607015e-34
 1.618033988749895
 3.141592653589793
-1000000000000.0
+1000000000000
 
 >>> p = [1, -2, -3, 4]
 >>> m = [
@@ -1373,7 +1314,9 @@ print(v1.angles())
 >>> print(equations.polynomial_equation(p))
 >>> print(equations.linear_equation(*m))
 
-[(-1.5615528128088307-6.5209667308287455e-24j)   (2.5615528128088294+4.456233626665941e-24j)   (1.0000000000000007+3.241554513744382e-25j)]
+[[(-1.5615528128088307-6.5209667308287455e-24j)                                             0                                             0]
+ [                                            0   (2.5615528128088294+4.456233626665941e-24j)                                             0]
+ [                                            0                                             0   (1.0000000000000007+3.241554513744382e-25j)]]
 [ 1.6666666666666667 -0.6666666666666666 -0.4444444444444444]
 
 >>> print(maths.cot(constants.pi / 3))
@@ -1468,10 +1411,10 @@ print(v1.angles())
 >>> print(random.randint(0, 9, [2, 3, 4]))
 >>> print(random.uniform(0, 9, [2, 3, 4]))
 
-[[[0.4334341920363395, 0.055711784711422116, -1.0235500373980284, 0.30031229336738374], [-0.2650367914670356, 0.5513398538865067, -0.9735921328831166, 0.41345578602104827], [-0.11598957920080871, -0.9044539791933183, 1.6448227575237069, -0.26304156924843813]], [[0.27363898507271256, -0.5897181011789576, 1.5120937498473583, 2.1302709742844694], [1.9743293887616236, 0.4117207260898469, 0.5809554193110543, -1.8456249006764007], [1.274481044612177, -0.30645083457981553, -1.3285606156236818, 0.33473439037886943]]]
-[[[0.5269441534226782, 0.36498666932667356, 0.7363066388832684, 0.5878544826035406], [0.5684721009896431, 0.9009577979323332, 0.036288112799501615, 0.18351641818419884], [0.24258369409385339, 0.09354340906140202, 0.4856203412285762, 0.783031677244552]], [[0.8777465681935882, 0.6406910705155251, 0.10275292827025073, 0.01295823682977526], [0.3898500974345528, 0.6216248983423127, 0.3179425906177036, 0.012870877167621808], [0.2660481991211192, 0.09872041627158801, 0.3681944568198672, 0.494087114885137]]]
-[[[5, 9, 5, 6], [6, 7, 6, 1], [1, 3, 2, 4]], [[5, 8, 8, 3], [3, 2, 3, 9], [3, 0, 7, 1]]]
-[[[8.610851610963957, 1.3747433091161905, 1.3831050577679438, 4.715182178697273], [0.8765517657148284, 4.809554825684029, 2.7557819856736137, 5.938765584746821], [6.088739464744903, 4.627722536295625, 0.6116370455995369, 5.875683438664389]], [[7.7228845997304845, 5.428461366109726, 8.02712172516869, 5.9319006090345425], [5.726626482636939, 7.978329508380601, 1.114307478513796, 6.236721706167868], [1.4123245528031072, 5.327811122183013, 7.324213082306745, 1.5016363011868927]]]
+[[[1.524086835643172, -0.20868457467847845, 0.5240261503975477, -0.6439838767682032], [-1.091904210196648, -0.20567633973733265, 1.374424576574523, 0.6563097903476932], [0.2171635934136032, 1.0821030876490199, -0.8410496800310051, -0.8321549344577578]], [[0.5306996954571072, -0.4441704154154241, 1.0481960055260355, 0.39805451821848287], [-0.4006858882593715, -0.06238294764009237, -1.1536673264483728, -0.8063185246185602], [0.3029117113345387, -0.32570360518676644, 0.6608320231980702, 1.7415150171137153]]]
+[[[0.3736243541521843, 0.8599079983285199, 0.4260061864869946, 0.8441437619796597], [0.8955986631978392, 0.7570336992646656, 0.6706841989644684, 0.328634366074538], [0.4371430562585502, 0.9576395263025738, 0.2380278778546957, 0.806813631306664]], [[0.18549375381453237, 0.5749941389233029, 0.7009767023241946, 0.30017399397762223], [0.6661914823434657, 0.7802291606608635, 0.6847755352217044, 0.2661053533652564], [0.07937643994416943, 0.5452043474222034, 0.8026792060861194, 0.07776400257578953]]]
+[[[9, 0, 9, 0], [2, 6, 3, 4], [5, 8, 4, 7]], [[7, 7, 6, 3], [5, 5, 5, 8], [3, 4, 6, 6]]]
+[[[5.049093842782947, 1.3880585421884204, 8.533634113864629, 3.550264239771317], [3.3311351975225176, 5.131771033264564, 0.9570872044431911, 5.165536082759862], [1.2035779060925538, 8.292998518472567, 8.014641974770818, 6.251632912237915]], [[6.411677800595937, 5.365937405245105, 8.70943859614565, 4.348757668525482], [7.827612569569748, 1.3718742546020972, 0.5252489627763138, 2.065015517785291], [4.620664668451086, 2.604569735623819, 5.548107842615733, 7.60342292447815]]]
 
 >>> print(regression.linear_regression(list(range(5)), [2, 4, 6, 7, 8]))
 >>> print(regression.parabolic_regression(list(range(5)), [2, 4, 6, 7, 8]))

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/PyPyNum.egg-info/SOURCES.txt

@@ -19,7 +19,6 @@ pypynum/Tensor.py
 pypynum/Tree.py
 pypynum/Vector.py
 pypynum/__init__.py
-pypynum/__temporary.py
 pypynum/chars.py
 pypynum/cipher.py
 pypynum/constants.py

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/pypynum/Matrix.py

@@ -217,13 +217,25 @@ def same(rows, cols, value=0):
     return Matrix([[value] * cols for _ in range(rows)])
 
 
-def lu(matrix):
+def rotate90(matrix: Matrix, times: int) -> Matrix:
+    matrix = matrix.copy()
+    if times % 4 == 0:
+        return matrix
+    elif times % 4 == 1:
+        return Matrix([list(col)[::-1] for col in zip(*matrix)])
+    elif times % 4 == 2:
+        return Matrix([row[::-1] for row in matrix[::-1]])
+    else:
+        return Matrix([list(col)[::-1] for col in zip(*matrix[::-1])][::-1])
+
+
+def lu(matrix: Matrix) -> tuple:
     rows = matrix.rows
     cols = matrix.cols
     if rows != cols:
         raise SquareError
     L = [[1.0 if a == b else 0.0 for a in range(cols)] for b in range(rows)]
-    U = [[float(matrix.data[b][a]) for a in range(cols)] for b in range(rows)]
+    U = [[float(matrix[b][a]) for a in range(cols)] for b in range(rows)]
     for i in range(rows - 1):
         for j in range(i + 1, rows):
             L[j][i] = U[j][i] / U[i][i]
@@ -235,7 +247,7 @@ def lu(matrix):
     return Matrix(L), Matrix(U)
 
 
-def tril_indices(n, k=0, m=None):
+def tril_indices(n: int, k: int = 0, m: int = None) -> tuple:
     if m is None:
         m = n
     if n < 1 or k <= -n or m < 1:
@@ -244,11 +256,11 @@ def tril_indices(n, k=0, m=None):
     return [y[1] for y in _indices], [x[0] for x in _indices]
 
 
-def identity(n):
+def identity(n: int) -> Matrix:
     return Matrix([[1.0 if a == b else 0.0 for a in range(n)] for b in range(n)])
 
 
-def qr(matrix):
+def qr(matrix: Matrix) -> tuple:
     from math import hypot
     r = matrix.rows
     c = matrix.cols
@@ -273,33 +285,225 @@ def qr(matrix):
     return Matrix([[item for item in line] for line in Q]), Matrix([[item for item in line] for line in R])
 
 
-def eig(matrix):
-    try:
-        from numpy.linalg import eig as eigen
-        e, Q = eigen(matrix.data)
-        e, Q = Matrix([e.tolist()]), Matrix(Q.tolist())
-        return e, Q
-    except ImportError:
-        eigen = "\n\033[91m提示：Matrix模块的eig函数可能存在计算错误\n\nTip: The eig function of the Matrix module may have calculation errors\033[m\n"
-        print(eigen)
-    _qr = []
-    n = matrix.rows
-    Q = identity(n)
-    for i in range(100):
-        _qr = qr(matrix)
-        Q = Q @ _qr[0]
-        matrix = _qr[1] @ _qr[0]
-    AK = (_qr[0] @ _qr[1]).data
-    e = Matrix([[AK[i][i] for i in range(n)]])
-    return e, Q
-
-
-def svd(matrix):
-    e0, U = eig(matrix @ matrix.t())
-    e1, V = eig(matrix.t() @ matrix)
-    sigma = Matrix([[((e0.data[0][a] + e1.data[0][a]) / 2) ** 0.5 if a == b else 0 for a in range(matrix.cols)]
-                    for b in range(matrix.rows)])
-    return U, sigma, V.t()
+def hessenberg(matrix: Matrix) -> tuple:
+    from math import sqrt
+    a = matrix.copy()
+    n = a.rows
+    t = [0.0] * n
+    a[-1, -1] = float(a[-1, -1])
+    if n > 2:
+        inf = float("inf")
+        for i in range(n - 1, 1, -1):
+            scale = 0.0
+            for k in range(0, i):
+                scale += abs(a[i, k].real) + abs(a[i, k].imag)
+            scale_inv = 0.0
+            if scale != 0:
+                scale_inv = 1 / scale
+            if scale == 0 or scale_inv == inf:
+                t[i] = 0.0
+                a[i, i - 1] = 0.0
+                continue
+            h = 0.0
+            for k in range(0, i):
+                a[i, k] = a[i, k] * scale_inv
+                rr, ii = a[i, k].real, a[i, k].imag
+                h += rr * rr + ii * ii
+            f = a[i, i - 1]
+            f0 = abs(f)
+            g = sqrt(h)
+            a[i, i - 1] = - g * scale
+            if f0 == 0:
+                t[i] = g
+            else:
+                ff = f / f0
+                t[i] = f + g * ff
+                a[i, i - 1] = a[i, i - 1] * ff
+            h += g * f0
+            h = 1 / sqrt(h)
+            t[i] *= h
+            for k in range(0, i - 1):
+                a[i, k] = a[i, k] * h
+            for j in range(0, i):
+                g = t[i].conjugate() * a[j, i - 1]
+                for k in range(0, i - 1):
+                    g += a[i, k].conjugate() * a[j, k]
+                a[j, i - 1] = a[j, i - 1] - g * t[i]
+                for k in range(0, i - 1):
+                    a[j, k] = a[j, k] - g * a[i, k]
+            for j in range(0, n):
+                g = t[i] * a[i - 1, j]
+                for k in range(0, i - 1):
+                    g += a[i, k] * a[k, j]
+                a[i - 1, j] = a[i - 1, j] - g * t[i].conjugate()
+                for k in range(0, i - 1):
+                    a[k, j] = a[k, j] - g * a[i, k].conjugate()
+    q = a.copy()
+    if n == 1:
+        q[0, 0] = 1.0
+        return q, a
+    q[0, 0] = q[1, 1] = 1.0
+    q[0, 1] = q[1, 0] = 0.0
+    for i in range(2, n):
+        if t[i] != 0:
+            for j in range(0, i):
+                g = t[i] * q[i - 1, j]
+                for k in range(0, i - 1):
+                    g += q[i, k] * q[k, j]
+                q[i - 1, j] -= g * t[i].conjugate()
+                for k in range(0, i - 1):
+                    q[k, j] -= g * a[i, k].conjugate()
+        q[i, i] = 1.0
+        for j in range(0, i):
+            q[j, i] = q[i, j] = 0.0
+    for x in range(n):
+        for y in range(x + 2, n):
+            a[y, x] = 0.0
+    return q, a
+
+
+def eigen(matrix: Matrix) -> tuple:
+    from math import hypot
+    from cmath import sqrt
+    a = matrix.copy()
+    n = a.rows
+    if n == 1:
+        return Matrix([[float(a[0, 0])]]), Matrix([[1.0]])
+    q, a = hessenberg(a)
+    norm = 0
+    for x in range(n):
+        for y in range(min(x + 2, n)):
+            norm += abs(a[y, x])
+    norm = norm ** 0.5 / n
+    if norm == 0:
+        return None, None
+    n0 = 0
+    n1 = n
+    its = 0
+    while True:
+        k = n0
+        while k + 1 < n1:
+            if abs(a[k + 1, k]) <= 1e-100:
+                break
+            k += 1
+        if k + 1 < n1:
+            a[k + 1, k] = 0.0
+            n0 = k + 1
+            its = 0
+            if n0 + 1 >= n1:
+                n0 = 0
+                n1 = k + 1
+                if n1 < 2:
+                    break
+        else:
+            if its % 30 == 10:
+                shift = a[n1 - 1, n1 - 2]
+            elif its % 30 == 20:
+                shift = abs(a[n1 - 1, n1 - 2])
+            elif its % 30 == 29:
+                shift = norm
+            else:
+                t = a[n1 - 2, n1 - 2] + a[n1 - 1, n1 - 1]
+                s = (a[n1 - 1, n1 - 1] - a[n1 - 2, n1 - 2]) ** 2 + 4 * a[n1 - 1, n1 - 2] * a[n1 - 2, n1 - 1]
+                if s.real > 0:
+                    s = sqrt(s)
+                else:
+                    s = sqrt(-s) * 1j
+                if s.imag == 0:
+                    s = s.real
+                a0 = (t + s) / 2
+                b0 = (t - s) / 2
+                if abs(a[n1 - 1, n1 - 1] - a0) > abs(a[n1 - 1, n1 - 1] - b0):
+                    shift = b0
+                else:
+                    shift = a0
+            its += 1
+            c = a[n0, n0] - shift
+            s = a[n0 + 1, n0]
+            v = hypot(abs(c), abs(s))
+            if v == 0:
+                c = 1
+                s = 0
+            else:
+                c /= v
+                s /= v
+            cc = c.conjugate()
+            cs = s.conjugate()
+            for k in range(n0, n):
+                x = a[n0, k]
+                y = a[n0 + 1, k]
+                a[n0, k] = cc * x + cs * y
+                a[n0 + 1, k] = c * y - s * x
+            for k in range(min(n1, n0 + 3)):
+                x = a[k, n0]
+                y = a[k, n0 + 1]
+                a[k, n0] = c * x + s * y
+                a[k, n0 + 1] = cc * y - cs * x
+            if not isinstance(q, bool):
+                for k in range(n):
+                    x = q[k, n0]
+                    y = q[k, n0 + 1]
+                    q[k, n0] = c * x + s * y
+                    q[k, n0 + 1] = cc * y - cs * x
+            for j in range(n0, n1 - 2):
+                c = a[j + 1, j]
+                s = a[j + 2, j]
+                v = hypot(abs(c), abs(s))
+                if v == 0:
+                    a[j + 1, j] = 0.0
+                    c = 1
+                    s = 0
+                else:
+                    a[j + 1, j] = v
+                    c /= v
+                    s /= v
+                a[j + 2, j] = 0.0
+                cc = c.conjugate()
+                cs = s.conjugate()
+                for k in range(j + 1, n):
+                    x = a[j + 1, k]
+                    y = a[j + 2, k]
+                    a[j + 1, k] = cc * x + cs * y
+                    a[j + 2, k] = c * y - s * x
+                for k in range(0, min(n1, j + 4)):
+                    x = a[k, j + 1]
+                    y = a[k, j + 2]
+                    a[k, j + 1] = c * x + s * y
+                    a[k, j + 2] = cc * y - cs * x
+                if not isinstance(q, bool):
+                    for k in range(0, n):
+                        x = q[k, j + 1]
+                        y = q[k, j + 2]
+                        q[k, j + 1] = c * x + s * y
+                        q[k, j + 2] = cc * y - cs * x
+    e = Matrix([[a[i, i] if j == i else 0 for j in range(n)] for i in range(n)])
+    er = identity(n)
+    m = 1
+    for i in range(1, n):
+        s = a[i, i]
+        for j in range(i - 1, -1, -1):
+            r = 0
+            for k in range(j + 1, i + 1):
+                r += a[j, k] * er[k, i]
+            t = a[j, j] - s
+            r = -r / t
+            er[j, i] = r
+            m = max(m, abs(r))
+        if m != 1:
+            for k in range(0, i + 1):
+                er[k, i] /= m
+    q = q @ er
+    return e, q
+
+
+def svd(matrix: Matrix) -> tuple:
+    print("\n警告：SVD函数可能存在计算错误\n\nWarning: The SVD function may have calculation errors\n")
+    e0, u = eigen(matrix @ matrix.t())
+    u = Matrix([_[::-1] for _ in u])
+    e1, v = eigen(matrix.t() @ matrix)
+    sigma = Matrix([[((e0[i, i] + e1[i, i]) / 2) ** 0.5 if j == i else 0 for j in range(matrix.cols - 1, -1, -1)]
+                    for i in range(matrix.rows - 1, -1, -1)])
+    return u, sigma, v.t()
 
 
 del Array

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/pypynum/README.md

@@ -18,7 +18,7 @@
 [![Downloads](https://static.pepy.tech/badge/pypynum/month)](https://pepy.tech/project/pypynum)
 [![Downloads](https://static.pepy.tech/badge/pypynum/week)](https://pepy.tech/project/pypynum)
 
-## Version -> 1.8.0 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
+## Version -> 1.8.1 | PyPI -> https://pypi.org/project/PyPyNum/ | Gitee -> https://www.gitee.com/PythonSJL/PyPyNum
 
 ![LOGO](PyPyNum.png)
 
@@ -67,65 +67,11 @@ Python interpreter and run it!)
 ```
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
-新增代码行数为603行
+eig函数修复了计算错误并改名为eigen
 
-Add 603 new lines of code
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增函数“magic_square”的功能简介：可
-以生成任意大于等于三的整数阶幻方。
-
-Introduction to the newly added
-function "magic square": It can
-generate any integer order magic
-square greater than or equal to
-three.
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增模块“Graph”的功能简介：具有有向图
-、无向图、带权有向图、带权无向图这四个对
-象，支持添加或删除顶点和边，以及深度优先
-搜索与广度优先搜索这两种图的遍历方式，还
-有计算最短路径等功能。
-
-Introduction to the functions of
-the newly added module "Graph":
-it has four objects: directed
-graph, undirected graph,
-weighted directed graph, and
-weighted undirected graph. It
-supports adding or removing
-vertices and edges, as well as
-depth first search and breadth
-first search for graph
-traversal. It also has functions
-such as calculating the shortest
-path.
-
-!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
-
-新增模块“polynomial”的功能简介：有一
-个多项式对象，可以通过传入包含“(次数,
-系数)”的二元组组成的序列创建多项式对象
-，可以随时设置某一项的数值，并且支持多
-项式形式的四则运算，还有取商式、取余式
-、求幂、求模幂的功能。
-
-Introduction to the newly added
-module "polynomial": There is a
-polynomial object that can be
-created by passing in a sequence
-of binary tuples containing
-"degree, coefficient". The value
-of a certain term can be set at
-any time, and it supports
-polynomial form arithmetic
-operations. It also has
-functions such as quotient,
-remainder, exponentiation, and
-modular exponentiation.
+The eig function fixed
+calculation errors and changed
+its name to eigen
 
 !=!=!=!=!=!=!=!=!=!=!=!=!=!=!=!=
 
@@ -134,23 +80,13 @@ modular exponentiation.
 <<<The ellipsis in the following structure represents the original part>>>
 
 PyPyNum
-    ★ Graph [Graph theory]
-        CLASSES
-            BaseGraph
-                BaseWeGraph
-                    WeDiGraph
-                    WeUnGraph
-                DiGraph
-                UnGraph
-    ★ polynomial [Polynomial object]
-        CLASSES
-            Polynomial
-        FUNCTIONS
-            poly(terms=None)
-    ★ tools [Other useful tools]
+    ★ Matrix [Matrix calculation]
         FUNCTIONS
             ...
-            magic_square(n)
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
+            ...
 ```
 
 ### 运行用时测试
@@ -265,14 +201,16 @@ PyPyNum
         CLASSES
             Matrix
         FUNCTIONS
-            eig(matrix)
-            identity(n)
-            lu(matrix)
+            eigen(matrix: pypynum.Matrix.Matrix) -> tuple
+            hessenberg(matrix: pypynum.Matrix.Matrix) -> tuple
+            identity(n: int) -> pypynum.Matrix.Matrix
+            lu(matrix: pypynum.Matrix.Matrix) -> tuple
             mat(data)
-            qr(matrix)
+            qr(matrix: pypynum.Matrix.Matrix) -> tuple
+            rotate90(matrix: pypynum.Matrix.Matrix, times: int) -> pypynum.Matrix.Matrix
             same(rows, cols, value=0)
-            svd(matrix)
-            tril_indices(n, k=0, m=None)
+            svd(matrix: pypynum.Matrix.Matrix) -> tuple
+            tril_indices(n: int, k: int = 0, m: int = None) -> tuple
             zeros(_dimensions)
             zeros_like(_nested_list)
     ★ NeuralN [A simple neural network model]
@@ -456,6 +394,9 @@ PyPyNum
             average(data, weights, expected=False)
             exgcd(a: int, b: int) -> tuple
             crt(n: arr, a: arr) -> int
+            isqrt(x: int) -> int
+            is_possibly_square(n: int) -> bool
+            is_square(n: int) -> bool
     ★ numbers [Conversion of various numbers]
         FUNCTIONS
             float2fraction(number: float, mixed: bool = False, error: float = 1e-15) -> tuple
@@ -685,7 +626,7 @@ print(v1.angles())
 6.62607015e-34
 1.618033988749895
 3.141592653589793
-1000000000000.0
+1000000000000
 
 >>> p = [1, -2, -3, 4]
 >>> m = [
@@ -699,7 +640,9 @@ print(v1.angles())
 >>> print(equations.polynomial_equation(p))
 >>> print(equations.linear_equation(*m))
 
-[(-1.5615528128088307-6.5209667308287455e-24j)   (2.5615528128088294+4.456233626665941e-24j)   (1.0000000000000007+3.241554513744382e-25j)]
+[[(-1.5615528128088307-6.5209667308287455e-24j)                                             0                                             0]
+ [                                            0   (2.5615528128088294+4.456233626665941e-24j)                                             0]
+ [                                            0                                             0   (1.0000000000000007+3.241554513744382e-25j)]]
 [ 1.6666666666666667 -0.6666666666666666 -0.4444444444444444]
 
 >>> print(maths.cot(constants.pi / 3))
@@ -794,10 +737,10 @@ print(v1.angles())
 >>> print(random.randint(0, 9, [2, 3, 4]))
 >>> print(random.uniform(0, 9, [2, 3, 4]))
 
-[[[0.4334341920363395, 0.055711784711422116, -1.0235500373980284, 0.30031229336738374], [-0.2650367914670356, 0.5513398538865067, -0.9735921328831166, 0.41345578602104827], [-0.11598957920080871, -0.9044539791933183, 1.6448227575237069, -0.26304156924843813]], [[0.27363898507271256, -0.5897181011789576, 1.5120937498473583, 2.1302709742844694], [1.9743293887616236, 0.4117207260898469, 0.5809554193110543, -1.8456249006764007], [1.274481044612177, -0.30645083457981553, -1.3285606156236818, 0.33473439037886943]]]
-[[[0.5269441534226782, 0.36498666932667356, 0.7363066388832684, 0.5878544826035406], [0.5684721009896431, 0.9009577979323332, 0.036288112799501615, 0.18351641818419884], [0.24258369409385339, 0.09354340906140202, 0.4856203412285762, 0.783031677244552]], [[0.8777465681935882, 0.6406910705155251, 0.10275292827025073, 0.01295823682977526], [0.3898500974345528, 0.6216248983423127, 0.3179425906177036, 0.012870877167621808], [0.2660481991211192, 0.09872041627158801, 0.3681944568198672, 0.494087114885137]]]
-[[[5, 9, 5, 6], [6, 7, 6, 1], [1, 3, 2, 4]], [[5, 8, 8, 3], [3, 2, 3, 9], [3, 0, 7, 1]]]
-[[[8.610851610963957, 1.3747433091161905, 1.3831050577679438, 4.715182178697273], [0.8765517657148284, 4.809554825684029, 2.7557819856736137, 5.938765584746821], [6.088739464744903, 4.627722536295625, 0.6116370455995369, 5.875683438664389]], [[7.7228845997304845, 5.428461366109726, 8.02712172516869, 5.9319006090345425], [5.726626482636939, 7.978329508380601, 1.114307478513796, 6.236721706167868], [1.4123245528031072, 5.327811122183013, 7.324213082306745, 1.5016363011868927]]]
+[[[1.524086835643172, -0.20868457467847845, 0.5240261503975477, -0.6439838767682032], [-1.091904210196648, -0.20567633973733265, 1.374424576574523, 0.6563097903476932], [0.2171635934136032, 1.0821030876490199, -0.8410496800310051, -0.8321549344577578]], [[0.5306996954571072, -0.4441704154154241, 1.0481960055260355, 0.39805451821848287], [-0.4006858882593715, -0.06238294764009237, -1.1536673264483728, -0.8063185246185602], [0.3029117113345387, -0.32570360518676644, 0.6608320231980702, 1.7415150171137153]]]
+[[[0.3736243541521843, 0.8599079983285199, 0.4260061864869946, 0.8441437619796597], [0.8955986631978392, 0.7570336992646656, 0.6706841989644684, 0.328634366074538], [0.4371430562585502, 0.9576395263025738, 0.2380278778546957, 0.806813631306664]], [[0.18549375381453237, 0.5749941389233029, 0.7009767023241946, 0.30017399397762223], [0.6661914823434657, 0.7802291606608635, 0.6847755352217044, 0.2661053533652564], [0.07937643994416943, 0.5452043474222034, 0.8026792060861194, 0.07776400257578953]]]
+[[[9, 0, 9, 0], [2, 6, 3, 4], [5, 8, 4, 7]], [[7, 7, 6, 3], [5, 5, 5, 8], [3, 4, 6, 6]]]
+[[[5.049093842782947, 1.3880585421884204, 8.533634113864629, 3.550264239771317], [3.3311351975225176, 5.131771033264564, 0.9570872044431911, 5.165536082759862], [1.2035779060925538, 8.292998518472567, 8.014641974770818, 6.251632912237915]], [[6.411677800595937, 5.365937405245105, 8.70943859614565, 4.348757668525482], [7.827612569569748, 1.3718742546020972, 0.5252489627763138, 2.065015517785291], [4.620664668451086, 2.604569735623819, 5.548107842615733, 7.60342292447815]]]
 
 >>> print(regression.linear_regression(list(range(5)), [2, 4, 6, 7, 8]))
 >>> print(regression.parabolic_regression(list(range(5)), [2, 4, 6, 7, 8]))

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/pypynum/__init__.py

@@ -21,7 +21,7 @@ from .Graph import *
 from .Group import group
 from .Logic import *
 from .maths import *
-from .Matrix import mat, identity, lu, qr, eig, svd
+from .Matrix import mat, identity, rotate90, lu, qr, eigen, svd
 from .NeuralN import *
 from .numbers import *
 from .plotting import unary, binary, c_unary, color
@@ -39,7 +39,7 @@ from . import types
 from .utils import OrderedSet, InfIterator
 from .Vector import vec
 
-__version__ = "1.8.0"
+__version__ = "1.8.1"
 print("PyPyNum", "Version -> " + __version__, "PyPI -> https://pypi.org/project/PyPyNum/",
       "Gitee -> https://www.gitee.com/PythonSJL/PyPyNum", sep=" | ")
 del math, arr, ite, num, real, geom, ContentError, RandomError, LogicError, InputError, FullError, Union

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/pypynum/equations.py

@@ -10,8 +10,7 @@ def linear_equation(left: list, right: list) -> list:
 
 def polynomial_equation(coefficients: list) -> list:
     from .Array import array
-    from .Matrix import mat
-    from .__temporary import eigenvalue as eig
+    from .Matrix import eigen, mat
     p = [_ / coefficients[0] for _ in coefficients[1:]]
-    return array(eig(mat([[-p[i] if j == 0 else 1 if i + 1 == j else 0
-                           for j in range(len(p))] for i in range(len(p))])))
+    return array(eigen(mat([[-p[i] if j == 0 else 1 if i + 1 == j else 0
+                           for j in range(len(p))] for i in range(len(p))]))[0].data)

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/pypynum/maths.py

@@ -106,9 +106,14 @@ def lcm(*args: int) -> int:
     """
     if not args:
         return 0
+    try:
+        f = math.lcm
+    except AttributeError:
+        def f(a, b):
+            return a * b // math.gcd(a, b)
     lcm_value = args[0]
     for n in args[1:]:
-        lcm_value = math.lcm(lcm_value, n)
+        lcm_value = f(lcm_value, n)
     return lcm_value
 
 

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/pypynum/plotting.py

@@ -165,6 +165,7 @@ def c_unary(function, start: real, end: real, interval: real = 5, projection: st
     :param coloration: bool.
     :return:
     """
+    print("\n注意：自变量目前只支持实数范围\n\nNote: The independent variable currently only supports the real range\n")
     if abs(interval) != interval:
         raise ValueError("The interval cannot be less than zero")
     if not isinstance(character, str) or (len(character) != 1 and not coloration):

{PyPyNum-1.8.0 → PyPyNum-1.8.1}/setup.py

@@ -4,22 +4,14 @@ with open("pypynum/README.md", "r", encoding="UTF-8") as r:
     md = r.read()
 
 keywords = [
-    "math", "数学", "mathematics", "数学计算",
-    "numerical", "数值", "computation", "计算",
-    "scientific", "科学", "algebra", "代数",
-    "calculus", "微积分", "statistics", "统计",
-    "linear-algebra", "线性代数", "optimization", "优化",
-    "numerical-analysis", "数值分析", "matrix", "矩阵",
-    "vector", "向量", "tensor", "张量",
-    "numerics", "数值计算", "library", "库",
-    "tools", "工具", "utils", "实用程序",
-    "algorithms", "算法", "software", "软件",
-    "package", "包", "methods", "方法",
-    "data-science", "数据科学", "machine-learning", "机器学习",
-    "computational", "计算的", "operations", "操作",
-    "functions", "函数", "processing", "处理",
-    "programming", "编程", "simulation", "仿真",
-    "visualization", "可视化", "physics", "物理"
+    "math", "数学", "mathematics", "数学计算", "numerical", "数值", "computation", "计算",
+    "scientific", "科学", "algebra", "代数", "calculus", "微积分", "statistics", "统计",
+    "linear-algebra", "线性代数", "optimization", "优化", "numerical-analysis", "数值分析", "matrix", "矩阵",
+    "vector", "向量", "tensor", "张量", "numerics", "数值计算", "library", "库",
+    "tools", "工具", "utils", "实用程序", "algorithms", "算法", "software", "软件",
+    "package", "包", "methods", "方法", "data-science", "数据科学", "machine-learning", "机器学习",
+    "computational", "计算的", "operations", "操作", "functions", "函数", "processing", "处理",
+    "programming", "编程", "simulation", "仿真", "visualization", "可视化", "physics", "物理"
 ]
 
 LICENSE = """
@@ -688,7 +680,7 @@ For more information on this, and how to apply and follow the GNU AGPL, see
 
 setup(
     name="PyPyNum",
-    version="1.8.0",
+    version="1.8.1",
     packages=find_packages(),
     url="https://www.gitee.com/PythonSJL/PyPyNum",
     license=LICENSE,

PyPyNum-1.8.0/pypynum/__temporary.py

@@ -1,169 +0,0 @@
-def eigenvalue(matrix, eps=1e-100):
-    from math import hypot
-    from cmath import sqrt
-    from .Matrix import mat
-    A = matrix.copy()
-    n = A.rows
-    if n == 1:
-        return [A[0]], mat([[1]])
-    T = [0j] * n
-    if n > 2:
-        for i in range(n - 1, 1, -1):
-            scale = 0
-            for k in range(0, i):
-                scale += abs(A[i, k].real) + abs(A[i, k].imag)
-            scale_inv = 0
-            if scale != 0:
-                scale_inv = 1 / scale
-            if scale == 0 or scale_inv == float("inf"):
-                T[i] = 0
-                A[i, i - 1] = 0
-                continue
-            H = 0
-            for k in range(0, i):
-                A[i, k] = A[i, k] * scale_inv
-                rr, ii = A[i, k].real, A[i, k].imag
-                H += rr * rr + ii * ii
-            F = A[i, i - 1]
-            f = abs(F)
-            G = sqrt(H)
-            A[i, i - 1] = - G * scale
-            if f == 0:
-                T[i] = G
-            else:
-                ff = F / f
-                T[i] = F + G * ff
-                A[i, i - 1] = A[i, i - 1] * ff
-            H += G * f
-            H = 1 / sqrt(H)
-            T[i] *= H
-            for k in range(0, i - 1):
-                A[i, k] = A[i, k] * H
-            for j in range(0, i):
-                G = T[i].conjugate() * A[j, i - 1]
-                for k in range(0, i - 1):
-                    G += A[i, k].conjugate() * A[j, k]
-                A[j, i - 1] = A[j, i - 1] - G * T[i]
-                for k in range(0, i - 1):
-                    A[j, k] = A[j, k] - G * A[i, k]
-            for j in range(0, n):
-                G = T[i] * A[i - 1, j]
-                for k in range(0, i - 1):
-                    G += A[i, k] * A[k, j]
-                A[i - 1, j] = A[i - 1, j] - G * T[i].conjugate()
-                for k in range(0, i - 1):
-                    A[k, j] = A[k, j] - G * A[i, k].conjugate()
-    Q = A.copy()
-    for x in range(n):
-        for y in range(x + 2, n):
-            Q[y, x] = 0
-    norm = 0
-    for x in range(n):
-        for y in range(min(x + 2, n)):
-            norm += abs(Q[y, x])
-    norm = norm ** 0.5 / n
-    if norm == 0:
-        return
-    n0 = 0
-    n1 = n
-    eps0 = eps / (100 * n)
-    its = 0
-    while True:
-        k = n0
-        while k + 1 < n1:
-            s = abs(Q[k, k].real) + abs(Q[k, k].imag) + abs(Q[k + 1, k + 1].real) + abs(Q[k + 1, k + 1].imag)
-            if s < eps0 * norm:
-                s = norm
-            if abs(Q[k + 1, k]) < eps0 * s:
-                break
-            k += 1
-        if k + 1 < n1:
-            Q[k + 1, k] = 0
-            n0 = k + 1
-            its = 0
-            if n0 + 1 >= n1:
-                n0 = 0
-                n1 = k + 1
-                if n1 < 2:
-                    break
-        else:
-            if its % 30 == 10:
-                shift = Q[n1 - 1, n1 - 2]
-            elif its % 30 == 20:
-                shift = abs(Q[n1 - 1, n1 - 2])
-            elif its % 30 == 29:
-                shift = norm
-            else:
-                t = Q[n1 - 2, n1 - 2] + Q[n1 - 1, n1 - 1]
-                s = (Q[n1 - 1, n1 - 1] - Q[n1 - 2, n1 - 2]) ** 2 + 4 * Q[n1 - 1, n1 - 2] * Q[n1 - 2, n1 - 1]
-                if s.real > 0:
-                    s = sqrt(s)
-                else:
-                    s = sqrt(-s) * 1j
-                a = (t + s) / 2
-                b = (t - s) / 2
-                if abs(Q[n1 - 1, n1 - 1] - a) > abs(Q[n1 - 1, n1 - 1] - b):
-                    shift = b
-                else:
-                    shift = a
-            its += 1
-            c = Q[n0, n0] - shift
-            s = Q[n0 + 1, n0]
-            v = hypot(abs(c), abs(s))
-            if v == 0:
-                c = 1
-                s = 0
-            else:
-                c /= v
-                s /= v
-            cc = c.conjugate()
-            cs = s.conjugate()
-            for k in range(n0, n):
-                x = Q[n0, k]
-                y = Q[n0 + 1, k]
-                Q[n0, k] = cc * x + cs * y
-                Q[n0 + 1, k] = c * y - s * x
-            for k in range(min(n1, n0 + 3)):
-                x = Q[k, n0]
-                y = Q[k, n0 + 1]
-                Q[k, n0] = c * x + s * y
-                Q[k, n0 + 1] = cc * y - cs * x
-            if not isinstance(A, bool):
-                for k in range(n):
-                    x = A[k, n0]
-                    y = A[k, n0 + 1]
-                    A[k, n0] = c * x + s * y
-                    A[k, n0 + 1] = cc * y - cs * x
-            for j in range(n0, n1 - 2):
-                c = Q[j + 1, j]
-                s = Q[j + 2, j]
-                v = hypot(abs(c), abs(s))
-                if v == 0:
-                    Q[j + 1, j] = 0
-                    c = 1
-                    s = 0
-                else:
-                    Q[j + 1, j] = v
-                    c /= v
-                    s /= v
-                Q[j + 2, j] = 0
-                cc = c.conjugate()
-                cs = s.conjugate()
-                for k in range(j + 1, n):
-                    x = Q[j + 1, k]
-                    y = Q[j + 2, k]
-                    Q[j + 1, k] = cc * x + cs * y
-                    Q[j + 2, k] = c * y - s * x
-                for k in range(0, min(n1, j + 4)):
-                    x = Q[k, j + 1]
-                    y = Q[k, j + 2]
-                    Q[k, j + 1] = c * x + s * y
-                    Q[k, j + 2] = cc * y - cs * x
-                if not isinstance(A, bool):
-                    for k in range(0, n):
-                        x = A[k, j + 1]
-                        y = A[k, j + 2]
-                        A[k, j + 1] = c * x + s * y
-                        A[k, j + 2] = cc * y - cs * x
-    E = [Q[_, _] for _ in range(n)]
-    return E