Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
From MaRDI portal
Publication:4016789
Recommendations
- Efficient complex matrix multiplication
- Implementing High-performance Complex Matrix Multiplication via the 3m and 4m Methods
- Modifying a numerical algorithm for solving the matrix equation X + AX T B = C
- On the complexity of some algorithms of matrix multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
Cited in
(7)- Numerical stability and tensor nuclear norm
- Tensors in computations
- The complex step approximation to the Fréchet derivative of a matrix function
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Implementing high-performance complex matrix multiplication via the 1M method
- Complex matrix inversion via real matrix inversions
- Some fast algorithms multiplying a matrix by its adjoint
This page was built for publication: Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016789)