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
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Henri Lombardi / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Claude Quitté / rank | |||
Normal rank |
Revision as of 03:07, 11 February 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
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
matrix inversion
0 references
generalized inverse
0 references
projective and free module
0 references
ideal
0 references
algorithm
0 references