return the subresultant sequence of first kind

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

OreTools[FractionFree][RightEuclidean] - return the subresultant sequence of first kind

OreTools[FractionFree][RightPseudoQuotient] - return the right pseudo-quotient

OreTools[FractionFree][RightPseudoRemainder] - return the right pseudo-remainder

	Calling Sequence
	RightEuclidean(Poly1, Poly2, A, 'c1', 'c2') RightPseudoRemainder(Poly1, Poly2, A, 'mult', 'pquo') RightPseudoQuotient(Poly1, Poly2, A, 'mult', 'prem')

Parameters

Poly1, Poly2	-	Ore polynomials; to define an Ore polynomial, use the OrePoly structure.
A	-	Ore algebra; to define an Ore algebra, use the SetOreRing function.
c1, c2, mult, pquo, prem	-	(optional) unevaluated names.

Description

•	The RightEuclidean(Poly1, Poly2, A) calling sequence returns a list [m, S] where m is a positive integer and S is an array with m elements storing the subresultant sequence of the first kind of Poly1 and Poly2.

If Poly1 and Poly2 are fraction-free, and the commutation rule of the Ore algebra A are also fraction-free, then the output of RightEuclidean is fraction-free.

•	If the optional fourth argument to the RightEuclidean command c1 is specified, the first co-sequence of Poly1 and Poly2 is assigned to c1, so that:

and c1[m+1] Poly2 is a least common left multiple (LCLM) of Poly1 and Poly2.

•	If the optional fifth argument to the RightEuclidean command c2 is specified, the second co-sequence of Poly1 and Poly2 is assigned to c2, so that:

and c1[m+1] Poly2 = - c2[m+1] Poly1 is an LCLM of Poly1 and Poly2.

•	The RightPseudoRemainder(Poly1, Poly2, A) calling sequence returns the right pseudo-remainder R of Poly1 and Poly2 such that:

where the degree of R is less than that of Poly2, pquo is the right pseudo-quotient, and mult (the multiplier) is the sigma power of the leading coefficient of Poly2.

If the fourth argument 'mult' is specified, it is assigned the multiplier defined above. If the fifth argument 'pquo' is specified, it is assigned the right pseudo-quotient defined above.

•	The RightPseudoQuotient(Poly1, Poly2, A) calling sequence returns the right pseudo-quotient Q of Poly1 and Poly2 such that:

where the degree of the right pseudo-remainder prem is less than that of Poly2 and mult (the multiplier) is the sigma power of the leading coefficient of Poly2.

If the fourth argument 'mult' is specified, it is assigned the multiplier defined above. If the fifth argument 'prem' is specified, it is assigned the right pseudo-remainder defined above.

Examples

(1)

(2)

(3)

(4)

Check the result

(5)

vector([OrePoly(1, 3*x, x^2-1-x, 23*x+1), OrePoly(x, x, x^2+x+1), OrePoly(x^4+49*x^3+7*x^2-20*x-x^5, 2*x^5-17*x^4+32*x^3-14*x^2-20*x-1), OrePoly(x^8+3*x^7-209*x^6+1005*x^5+61*x^4-587*x^3+971*x^2+35*x-20)])

(6)

for i to m do W1 := Multiply(c1[i], Ore2, A); W2 := Multiply(c2[i], Ore1, A); W := Add(W1, W2); C := Minus(W, S[i]); print(C) end do

(7)

(8)

(9)

(10)

(11)

(12)

(13)

(14)

(15)

Check the result

(16)

(17)

(18)

(19)

(20)

Check the result

(21)

	See Also
	OreTools, OreTools/OreAlgebra, OreTools/OrePoly, OreTools[Euclidean], OreTools[FractionFree], OreTools[Quotient], OreTools[Remainder], OreTools[SetOreRing]