scientific article; zbMATH DE number 4059540
Let \(K\) be a field of characteristic 0, \(d\colon K\to K\) a derivation and \(V\) a finite dimensional \(K\)-vector space. A map \(\nabla\colon V\to V\) is called a \(d\)-connection if \(\nabla (v+w)=\nabla (v)+\nabla (w)\) and \(\nabla (av)=d(a)v+a\nabla (v)\) for \(a\in K\), \(v,w\in V\). \(v\in V\) is a cyclic vector for \(\nabla\) if \(\{\nabla i(v) \mid 0\le i\le n\}\) is a basis for \(V\). If \(K\) is a field in which the operations are effective, then the author notes that there is a Euclidean algorithm for the ring \(K[d]\). Using this, he shows that one can diagonalize any matrix \(A\in M_n[K[d]]\) with entries in \(K[d]\) via elementary row and column operations, that is, there are invertible matrices \(B_1\) and \(B_2\) such that \(B_1AB_2\) is diagonal with the first \(i\le n\) diagonal elements equal to 1 and the remaining diagonal elements equal to 0. The author applies this to the matrix of a connection and is able to give a formula for a cyclic vector in terms of the entries of \(B_2\).
- An algorithm for computing a companion block diagonal form for a system of linear differential equations
- scientific article; zbMATH DE number 1824074 (Why is no real title available?)
- A Simple Algorithm for Cyclic Vectors
- scientific article; zbMATH DE number 1305572 (Why is no real title available?)
- A unified approach for degree bound estimates of linear differential operators
- Differential modules and dormant opers of higher level
- Degree bounds for linear differential equations and recurrences
- Formal solutions of differential equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3794286)