Calculating the Galois group of \(Y'=AY+B\), \(Y'=AY\) completely reducible (Q1864902): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On rational solutions of systems of linear differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating the Galois group of \(L_1(L_2(y))=0,\) \(L_1, L_2\) completely reducible operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4025967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Galois groups of completely reducible differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Groups and Algebraic Dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3496299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Reducible Subgroups of Algebraic Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing reducibility of linear differential operators: A group theoretic perspective / rank
 
Normal rank

Latest revision as of 14:11, 5 June 2024

scientific article
Language Label Description Also known as
English
Calculating the Galois group of \(Y'=AY+B\), \(Y'=AY\) completely reducible
scientific article

    Statements

    Calculating the Galois group of \(Y'=AY+B\), \(Y'=AY\) completely reducible (English)
    0 references
    0 references
    23 March 2003
    0 references
    In his previous work with \textit{M. Singer} [J. Pure Appl. Algebra 139, 3-23 (1999; Zbl 0931.12009)] the author provided an algorithm for calculating the Galois group of a system of the form \(Y' = AY + B\). But that algorithm demanded the computation of a certain set of factorizations for a scalar linear differential polynomial associated with the system. This set is very large and difficult to compute in general. In this paper, the author gives a new and more efficient algorithm for calculating the Galois group of the system replacing the factorization tasks by a single block-diagonal decomposition of the coefficient matrix satisfying certain properties.
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithm
    0 references
    Galois group
    0 references
    block-diagonal decomposition
    0 references
    0 references