Finite type projective modules, crossed linear maps and generalized inverses. (Modules projectifs de type fini, applications linéaires croisées et inverses généralisés) (Q2509264): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jalgebra.2006.03.026 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jalgebra.2006.03.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036258456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4314299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizing Cramer's Rule: Solving Uniformly Linear Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic theory of arithmetic rings, Prüfer rings and Dedekind rings. (Théorie algorithmique des anneaux arithmétiques, des anneaux de Prüfer et des anneaux de Dedekind.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inertia characteristics of self-adjoint matrix polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A course in constructive algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses of matrices over commutative rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized Moore-Penrose inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286355 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JALGEBRA.2006.03.026 / rank
 
Normal rank

Latest revision as of 03:05, 19 December 2024

scientific article
Language Label Description Also known as
English
Finite type projective modules, crossed linear maps and generalized inverses. (Modules projectifs de type fini, applications linéaires croisées et inverses généralisés)
scientific article

    Statements

    Finite type projective modules, crossed linear maps and generalized inverses. (Modules projectifs de type fini, applications linéaires croisées et inverses généralisés) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2006
    0 references
    This paper deals with a general theory of generalized inverse matrices by putting it in connection with the constructive theory of the projective modules of finite type. In this context, certain aspects of this theory related to formal calculation and to the matriceal numerical analysis are presented. In particular, it is shown the possibility to test if an \(A\)-module of finite form is projective and to calculate a matrix of corresponding projection ``in polynomial time''. Further, it can be decided if for a matrix \(A \in \mathbf A^m{}^\times{}^n\) there exists a generalized inverse \(B\) for \(A\) (satisfying \(ABA = A\) and \(BAB = B\)). In the event of positive answer, such an inverse can be calculated by an algorithm which uses \(\mathcal O(p^6q^2\)) arithmetic operations, where \(p\) = inf\((m, n)\), \(q\) = sup\((m, n)\), and a polynomial number of tests of membership of an element to an ideal generated by ``a small number of elements''.
    0 references
    0 references
    matrix inversion
    0 references
    generalized inverse
    0 references
    projective and free module
    0 references
    ideal
    0 references
    algorithm
    0 references

    Identifiers