compute a super-irreducible form of a linear differential system

はじめる前に
新機能一覧
Maple ワークシートの作成
Mapleワークシートを共有
Maple ウィンドウのカスタマイズ
Maple システムのカスタマイズ
コネクティビティ
Mathematics
数学
- テンソル解析
- パッケージ
- ファンクションアドバイザ
- ベキ級数
- ベクトル解析
- 不活性関数
- 代数
- 因数分解と方程式解法
- 基本数学
- 基本的な注意事項
- 変分法
- 変換
- 幾何
- 微分代数方程式
- 微分幾何学
- 微分方程式
  - dsolve コマンド
  - DEtools パッケージ
    - 1 次 DE の操作
    - Solving Methods
    - プロット
    - ポアンカレ
    - リー対称群による解法
    - 微分有理ノルム形式
    - 微分演算子
    - 概要
    - diff_table
  - PDEtools パッケージ
  - pdsolve コマンド
  - Rif パッケージ
  - Slode パッケージ
  - リー対称群による解法
  - 例題
  - 常微分方程式（ODE）の分類
  - 微分代数
  - 微分代数（diffalg）パッケージ
  - 微分形式
  - 偏微分方程式の解関数の確認（pdetest コマンド）
  - 初期条件
  - 常微分方程式の解関数の確認（odetest コマンド）
  - 常微分方程式用対話型 Maplet インターフェイス
- 微積分
- 数
- 数値計算
- 数学関数
- 数論
- 最適化
- 特殊関数
- 統計
- 線形代数
- 群論
- 評価
- 論理
- 過去のパッケージ
- 金融
- 離散数学
- piecewise examples
- グラフ電卓
- 区分関数
物理
プログラミング
グラフィックス
Student パッケージ
Science and Engineering
科学・エンジニアリング
アプリケーションと例題
リファレンス
システム
MapleSim
MapleSim ツールボックス
MapleSim ヘルプ
Tasks
Toolboxes
エラーメッセージガイド
マニュアル
数学アプリ

DEtools[super_reduce] - compute a super-irreducible form of a linear differential system

DEtools[moser_reduce] - compute a Moser-irreducible form of a linear differential system

	Calling Sequence
	super_reduce(A, x, p, u) super_reduce(A, x, p, u, T, invT) moser_reduce(A, x, p, u) moser_reduce(A, x, p, u, T, invT)

Parameters

A	-	square matrix with rational function entries
x	-	independent variable of the system
p	-	irreducible polynomial in x or the symbol infinity
u	-	name
T	-	name
invT	-	name

Description

•	Consider the linear differential system

For a rational function matrix with the transformation

leads to a new system . One has

B = (AS-(diff(S, x)))/S

The matrices A and are said to be equivalent.

•

The super_reduce function computes a matrix equivalent to A in a special form, called super-irreducible at p. The output is a list of two elements. The first is the super-irreducible matrix; the second gives information about the integer slopes and Newton polynomials of the Newton polygon of the computed system. It is a list of couples, the first element of which is an integer (the slope) and the second a polynomial in u (the Newton polynomial associated with the slope).

•	The moser_reduce function computes a matrix equivalent to A which is Moser-irreducible at p. This is an equivalent matrix of minimal pole order. The output is similar to the super_reduce function, but only the Newton polynomials associated with the two biggest slopes are returned.

•	If T and invT are passed as arguments, they are assigned to the transformation matrix T and their inverse which transforms A to the super-irreducible (Moser-irreducible) matrix.

•

These functions are part of the DEtools package, and so they can be used in the form super_reduce(..) and moser_reduce(..) only after executing the command with(DEtools). However, they can always be accessed through the long form of the command by using DEtools[super_reduce](..) or DEtools[moser_reduce](..).

Examples

Consider the following matrix:

A := array(1 .. 4, 1 .. 4, [(2, 1) = 0, (3, 2) = -6/x^4, (2, 4) = -1/x^2, (4, 2) = (3-2*x)/x^3, (1, 3) = (5+2*x)/x^3, (4, 1) = -4/x^2, (4, 3) = 1, (4, 4) = 2/x^2, (1, 1) = -1, (2, 2) = -1, (2, 3) = 0, (1, 4) = (4*x^2-2*x)/x^4, (3, 3) = -1, (3, 1) = 8/x^3, (1, 2) = 1/x, (3, 4) = 2/x^2])

A := matrix([[-1, 1/x, (5+2*x)/x^3, (4*x^2-2*x)/x^4], [0, -1, 0, -1/x^2], [8/x^3, -6/x^4, -1, 2/x^2], [-4/x^2, (3-2*x)/x^3, 1, 2/x^2]])

(1)

The pole order of this matrix at the point is . The Moser algorithm computes an equivalent matrix of minimal pole order.

Matrix([[-(1/3)*(7*x+6)/x, -(1/3)*(-5+16*x)/x^3, -24/x^2, -(4/9)*(4*x+3)/x^2], [-(-3*x+2*x^2-24)/x^3, -(6+x)/x^2, (5*x^2-24)/x^2, -(8/3)/x^2], [-6/x^3, 2/x^2, -(-8+x^2+x)/x^2, 0], [x, 2*(2*x-1)/x^2, 3*(6*x-1)/x^2, 1/3]])

(2)

Here, the pole order is now . The super reduction algorithm computes a matrix which is Moser-irreducible and moreover the minimum of the valuations of each column (or equivalently, each row) is minimal. This also gives as additional information the integer slopes of the Newton polygon and the associated Newton polynomials.

(3)

(4)

Check whether the matrix T is the correct transformation matrix:

matrix([[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]])

(5)

If p is an irreducible polynomial, the computations are done for all roots of p simultaneously. The transformation matrices and hence the transformed matrix do not involve algebraic extensions over the ground field.

A := array(1 .. 4, 1 .. 4, [(2, 1) = 0, (3, 2) = 0, (2, 4) = 7/(x^2+1)^2, (4, 2) = 3/(x^2+1)^2, (1, 3) = -6/(x^2+1), (4, 1) = 0, (4, 3) = -3*x^2/(x^2+1)^3, (4, 4) = 1, (1, 1) = 1, (2, 2) = 4/(x^2+1), (2, 3) = 0, (1, 4) = 9/(x^2+1), (3, 3) = 1, (3, 1) = (-5*x-3)/(x^2+1)^2, (1, 2) = 0, (3, 4) = 0])

A := matrix([[1, 0, -6/(x^2+1), 9/(x^2+1)], [0, 4/(x^2+1), 0, 7/(x^2+1)^2], [(-5*x-3)/(x^2+1)^2, 0, 1, 0], [0, 3/(x^2+1)^2, -3*x^2/(x^2+1)^3, 1]])

(6)

Matrix([[(x^2+1-2*x)/(x^2+1), -(5*x+3)/(x^2+1)^2, 7/(x^2+1)^2, -(x^2-3-2*x)/(x^2+1)], [-6/(x^2+1), (x^2+1-2*x)/(x^2+1), 9/(x^2+1)^2, 6/(x^2+1)], [-3*x^2/(x^2+1)^2, 0, 1, 3/(x^2+1)], [0, 0, 7/(x^2+1)^2, 4/(x^2+1)]])

(7)

	See Also
	DEtools

References

Pfluegel, E. "An Algorithm For Computing Exponential Solutions of First Order Linear Differential Systems." In Proceedings of ISSAC '97, pp. 164-171. Edited by Wolfgang Kuchlin. New York: ACM Press, 1997.

Download Help Document