Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization (Q442659): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2012.04.026 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Generalized inverses. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized Bott-Duffin inverse and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation and approximation of the outer inverse \(A_{T,S}^{(2)}\) of a matrix \(A\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the inverse of a polynomial matrix and evaluation of its Laurent expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Pseudoinverse of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation and application of the generalized inverse via Maple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the generalized inverse of a polynomial matrix and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized inverses of two-variable polynomial matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved method for the computation of the Moore-Penrose inverse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective partitioning method for computing weighted Moore-Penrose inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic computation of the Moore–Penrose inverse using a partitioning method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full-rank representation of generalized inverse \(A_{T,S}^{(2)}\) and its application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of generalized inverses by using the \(LDL^{\ast}\) decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing generalized inverses using LU factorization of matrix product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning method for rational and polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Leverrier-Faddeev algorithm for computing the Moore-Penrose inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full-rank and determinantal representation of the Drazin inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic computation of weighted Moore-Penrose inverse using partitioning method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic and recursive computation of different types of generalized inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4727284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization and representation of the generalized inverse \(A_{T,S}^{(2)}\) and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Report on test matrices for generalized inverses / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2012.04.026 / rank
 
Normal rank

Latest revision as of 17:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization
scientific article

    Statements

    Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2012
    0 references
    The authors propose a method and an algorithm for efficient symbolic computation of \(A^{(2)}_{T,S}\) inverses of a given rational matrix \(A\). Their algorithm uses the \(QDR\) factorization of a rational matrix in order to avoid entries containing square roots. In this respect the proposed algorithm is highly suitable for implementation in procedural programming languages.
    0 references
    Generalized inverse \(A^{(2)}_{T,S}\)
    0 references
    QDR factorization
    0 references
    full-rank representation
    0 references
    rational matrices
    0 references
    Mathematica
    0 references
    algorithm
    0 references
    symbolic computation
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references