Some fast algorithms multiplying a matrix by its adjoint (Q2674011): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FFLAS-FFPACK / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3120503253 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114154420 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 2101.01025 / rank | |||
Normal rank | |||
Latest revision as of 08:54, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some fast algorithms multiplying a matrix by its adjoint |
scientific article |
Statements
Some fast algorithms multiplying a matrix by its adjoint (English)
0 references
22 September 2022
0 references
matrix multiplication
0 references
adjoint
0 references
quaternions
0 references
anti-homomorphism
0 references
skew-unitary matrix
0 references
