Referenced Items are not available for this document.
In this paper, we introduce a method for designing efficient Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix. The algorithms use only real arithmetic and achieve ultimate quadratic convergence. A theoretical analysis is conducted and some experimental results are presented
Published in:
Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International
Date of Conference: 15-19 Apr 1996
- Page(s):
- 593 - 600
- Meeting Date :
- 15 Apr 1996-19 Apr 1996
- Print ISBN:
- 0-8186-7255-2
- INSPEC Accession Number:
- 5309772
- Conference Location :
- Honolulu, HI
- Digital Object Identifier :
- 10.1109/IPPS.1996.508117
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
