Symbolic computation of \(A_{T,S}^{(2)}\)-inverses using QDR factorization (Q442659): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / author | |||
| Property / author: Predrag S. Stanimirović / rank | |||
Normal rank | |||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Constantin Popa / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65F20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15A09 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15A23 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6063134 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Generalized inverse \(A^{(2)}_{T,S}\) | |||
| Property / zbMATH Keywords: Generalized inverse \(A^{(2)}_{T,S}\) / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
QDR factorization | |||
| Property / zbMATH Keywords: QDR factorization / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
full-rank representation | |||
| Property / zbMATH Keywords: full-rank representation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
rational matrices | |||
| Property / zbMATH Keywords: rational matrices / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Mathematica | |||
| Property / zbMATH Keywords: Mathematica / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
algorithm | |||
| Property / zbMATH Keywords: algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
symbolic computation | |||
| Property / zbMATH Keywords: symbolic computation / rank | |||
Normal rank | |||
Revision as of 01:26, 30 June 2023
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
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
