Abstract
A bilinear algorithm of bilinear complexity 22 for approximate multiplication of 2 × 7 and 7 × 2 matrices is presented. An upper bound is given for the bilinear complexity of approximate multiplication of 2 × 2 and 2 × n matrices (n ≥ 1).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.