Cart (Loading....) | Create Account
Close category search window
 

Authors' reply [Computational complexity of matrix inversion]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Koc, C.K. ; Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR ; Guanrong Chen

The purpose of our two-page communication was to study the computational complexity of a matrix inversion formula with the intention of showing its improvement over the naive method of computing the inverse separately. We did not intend to claim that the matrix inversion formula is our discovery. However, it is true that this point was not made clear in our short paper

Published in:

Aerospace and Electronic Systems, IEEE Transactions on  (Volume:30 ,  Issue: 4 )

Date of Publication:

Oct 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.