{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:03:41Z","timestamp":1648634621930},"reference-count":9,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0167-8191(99)00035-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T14:52:00Z","timestamp":1049727120000},"page":"729-744","source":"Crossref","is-referenced-by-count":2,"title":["A high performance parallelization scheme for the Hessenberg double shift QR algorithm"],"prefix":"10.1016","volume":"25","author":[{"given":"Reiji","family":"Suda","sequence":"first","affiliation":[]},{"given":"Akira","family":"Nishida","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Oyanagi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-8191(99)00035-6_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1142\/S0129053389000068","article-title":"On a block implementation of Hessenberg multishift QR iteration","volume":"1","author":"Bai","year":"1989","journal-title":"Internat. J. High Speed Computing"},{"key":"10.1016\/S0167-8191(99)00035-6_BIB2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0010-4655(89)90148-3","article-title":"A parallel QR algorithm for the nonsymmetric eigenvalue problem","volume":"53","author":"Boley","year":"1989","journal-title":"Comput. Phys. Comm."},{"key":"10.1016\/S0167-8191(99)00035-6_BIB3","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-8191(90)90147-2","article-title":"Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor","volume":"13","author":"Geist","year":"1990","journal-title":"Parallel Computing"},{"issue":"4","key":"10.1016\/S0167-8191(99)00035-6_BIB4","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1137\/0917056","article-title":"Paralllelizing the QR algorithm for the unsymmetric algebraic eigenvalue problem: myths and reality","volume":"17","author":"Henry","year":"1996","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/S0167-8191(99)00035-6_BIB5","unstructured":"G. Henry, D. Watkins, J. Dongarra, A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures, Technical Report CS-97-352, Computer Science Department, University of Tennessee, 1997"},{"key":"10.1016\/S0167-8191(99)00035-6_BIB6","unstructured":"A. Nishida, R. Suda, Y. Oyanagi, Polynomial Acceleration for Restarted Arnoldi Iteration and its Parallelization, in: J. Wang et al. (Ed.), Iterative Methods in Scientific Computation, IMACS Series in Computational and Applied Mathematics, vol. 4, IMACS, New Brunswick, 1998, pp. 45\u201352"},{"issue":"6","key":"10.1016\/S0167-8191(99)00035-6_BIB7","first-page":"1587","article-title":"A new data mapping method for parallel Hessenberg double shift QR algorithm (in Japanese)","volume":"39","author":"Suda","year":"1998","journal-title":"Trans. IPSJ"},{"key":"10.1016\/S0167-8191(99)00035-6_BIB8","doi-asserted-by":"crossref","unstructured":"R.A. van de Geijn, Storage schemes for Parallel Eigenvalue Algorithms, in: G.H. Golub, P. van Dooren (Eds.), Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, NATO ASI Series, vol. F70, Springer, Berlin, 1991, pp. 639\u2013647","DOI":"10.1007\/978-3-642-75536-1_52"},{"key":"10.1016\/S0167-8191(99)00035-6_BIB9","unstructured":"L. Wu, E. Chu, New distributed-memory parallel algorithms for solving nonsymmetric eigenvalue problems, in: Proceedings of the seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995, pp. 540\u2013545"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819199000356?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T01:22:22Z","timestamp":1556328142000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819199000356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0167819199000356"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(99)00035-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}