أعرض في EDS

Necessary and sufficient conditions for convergence of the QR algorithm on Hessenberg matrix

التفاصيل البيبلوغرافية
العنوان:	Necessary and sufficient conditions for convergence of the QR algorithm on Hessenberg matrix
المؤلفون:	Beresford Parlett
المصدر:	ACM National Conference
بيانات النشر:	ACM Press, 1966.
سنة النشر:	1966
مصطلحات موضوعية:	Mathematical optimization, Complex matrix, Convergence (routing), Order (ring theory), Applied mathematics, QR algorithm, Context (language use), General matrix, QR decomposition, Hessenberg matrix, Mathematics
الوصف:	The QR Algorithm was developed1 to find the eigen - values of real or complex matrices. We shall consider it here in the context of exact arithmetic. Sufficient conditions for convergence, listed in order of increasing strength, have been given.1,2,3,7 It seems that necessary and sufficient conditions would be very complicated for a general matrix.
DOI:	10.1145/800256.810675
URL الوصول:	https://explore.openaire.eu/search/publication?articleId=doi_________::c7313b09e9ecc9fbd33b942e68078afe https://doi.org/10.1145/800256.810675
رقم الانضمام:	edsair.doi...........c7313b09e9ecc9fbd33b942e68078afe
قاعدة البيانات:	OpenAIRE

الوصف
DOI:	10.1145/800256.810675