find an integer dependence (relation)

はじめる前に
新機能一覧
Maple ワークシートの作成
Mapleワークシートを共有
Maple ウィンドウのカスタマイズ
Maple システムのカスタマイズ
コネクティビティ
Mathematics
数学
- テンソル解析
- パッケージ
- ファンクションアドバイザ
- ベキ級数
- ベクトル解析
- 不活性関数
- 代数
- 因数分解と方程式解法
- 基本数学
- 基本的な注意事項
- 変分法
- 変換
- 幾何
- 微分代数方程式
- 微分幾何学
- 微分方程式
- 微積分
- 数
- 数値計算
  - Maple の数値表現
  - MATLAB リンクパッケージ
  - 区間
  - 多項式近似代数（SNAP）パッケージ
  - 整数用関数
  - 補間とカーブフィッティング
  - 近似
    - evalf
    - IntegerRelations パッケージ
    - numapprox パッケージ
    - 連分数
    - fdiff
    - float
    - identify コマンド
    - testfloat
    - Tolerance
    - 桁
  - 離散変換
  - Numerical Analysis パッケージ
- 数学関数
- 数論
- 最適化
- 特殊関数
- 統計
- 線形代数
- 群論
- 評価
- 論理
- 過去のパッケージ
- 金融
- 離散数学
- piecewise examples
- グラフ電卓
- 区分関数
物理
プログラミング
グラフィックス
Student パッケージ
Science and Engineering
科学・エンジニアリング
アプリケーションと例題
リファレンス
システム
MapleSim
MapleSim ツールボックス
MapleSim ヘルプ
Tasks
Toolboxes
エラーメッセージガイド
マニュアル
数学アプリ

IntegerRelations[PSLQ] - find an integer dependence (relation)

	Calling Sequence
	PSLQ(v)

Parameters

list or Vector of (complex) floating-point numbers

Description

•	Given a list (or a Vector) v of real numbers, the PSLQ(v) command outputs a list (or a Vector) u of integers such that is minimized. Thus the PSLQ function finds an integer relation between a vector of linearly dependent real numbers if the input has enough precision.

•	Given a list (or a Vector) v of complex numbers, the PSLQ(v) command outputs a list (or a vector) u of complex integers (Gaussian integers) such that the norm of is minimized.

•	This is an implementation of Bailey and Ferguson's PSLQ algorithm. You can also use the Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm to find a linear relation. For more information, see IntegerRelations[LLL]. Generally speaking, PSLQ is faster.

•

One application of PSLQ is to find the minimal polynomial of an algebraic number given a decimal approximation of the algebraic number. The examples below illustrate this. Generally speaking, if the height of the minimal polynomial is and its degree is , then you need more than correct decimal digits for the algebraic number. If the input has digits and this is insufficient, the output of PSLQ will typically be a list of integers each with approximately / digits long.

Examples

(1)

(2)

Check that the following linear combination is small.

(3)

Finding a integer relation between non-algebraic constants.

Logs := Vector[column]([[ln(2)], [ln(3)], [ln(5)], [ln(6)], [ln(10)]])

(4)

u := Vector[column]([[1], [0], [1], [0], [-1]])

(5)

(6)

Using PSLQ to find the minimal polynomial for .

(7)

(8)

Approximate with digits and round to digits.

(9)

(10)

(11)

(12)

The minimal polynomial for

(13)

Check that is a root of

(14)

The next example involves complex numbers. First define a tenth root of unity.

(15)

(16)

(17)

(18)

(19)

(20)

In the next example, a Gaussian integer relation is found. We subsequently find an integer relation from the Gaussian integer relation by eliminating I.

(21)

(22)

(23)

(24)

(25)

(26)

(27)

(28)

The last example is of much larger degree requiring more than the default digits of precision. In the example, we are using PSLQ to test if the algebraic number is of degree or less.

(29)

(30)

Compute to digits and round to digits.

(31)

u := Vector[column]([[-162], [324], [0], [-297], [108], [27], [27], [-45], [27], [-8], [1]])

(32)

(33)

(34)

Check.

(35)

(36)

Thus, the minimal polynomial for must be the degree 9 factor.

Here is what happens if we mistakenly assume that algebraic number is of degree or less. The output of PSLQ looks like random digit integers, which indicates that it has not found anything interesting.