Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications

DOI10.1137/0613043zbMATH Open0777.65027DBLPjournals/siammax/Higham92OpenAlexW2146406121WikidataQ56999001 ScholiaQ56999001MaRDI QIDQ4016789FDOQ4016789

Authors: Nicholas J. Higham 

Publication date: 16 January 1993

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: http://eprints.maths.manchester.ac.uk/348/1/0613043.pdf

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

zbMATH Keywords

error analysisnumerical stabilitymatrix multiplicationcomplex matrixlevel-3 BLASStrassen's methodWinograd's identity

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

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

Uses Software

• BLAS

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)