{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:55:01Z","timestamp":1761062101661},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549468_92","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"847-856","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallelization of Divide-and-Conquer Eigenvector Accumulation"],"prefix":"10.1007","author":[{"given":"Wilfried N.","family":"Gansterer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Zottl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"92_CR1","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1137\/S1064827598336951","volume":"20","author":"F. Tisseur","year":"1999","unstructured":"Tisseur, F., Dongarra, J.: A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures. SIAM J. Sci. Comput.\u00a020, 2223\u20132236 (1999)","journal-title":"SIAM J. Sci. Comput."},{"doi-asserted-by":"crossref","unstructured":"Gansterer, W.N., Ward, R.C., P.Muller, R., Goddard, III, W.A.: Computing approximate eigenpairs of symmetric block tridiagonal matrices. SIAM J. Sci. Comput.\u00a025, 65\u201385 (2003)","key":"92_CR2","DOI":"10.1137\/S1064827501399432"},{"key":"92_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-8191(87)90060-3","volume":"4","author":"G. Fox","year":"1987","unstructured":"Fox, G., Otto, S., Hey, A.: Matrix algorithms on a hypercube i: Matrix multiplication. Parallel Computing\u00a04, 17\u201331 (1987)","journal-title":"Parallel Computing"},{"key":"92_CR4","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/cpe.4330060702","volume":"6","author":"J. Choi","year":"1994","unstructured":"Choi, J., Dongarra, J.J., Walker, D.: Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency: Practice and Experience\u00a06, 543\u2013570 (1994)","journal-title":"Concurrency: Practice and Experience"},{"key":"92_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/(SICI)1096-9128(199704)9:4<255::AID-CPE250>3.0.CO;2-2","volume":"9","author":"R.A. Geijn van de","year":"1997","unstructured":"van de Geijn, R.A., Watts, J.: Summa: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience\u00a09, 255\u2013274 (1997)","journal-title":"Concurrency: Practice and Experience"},{"key":"92_CR6","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/IPPS.1997.580916","volume-title":"Proceedings of the 11th International Parallel Processing Symposium","author":"J. Choi","year":"1997","unstructured":"Choi, J.: A fast scalable universal matrix multiplication algorithm on distributedmemory concurrent computers. In: Proceedings of the 11th International Parallel Processing Symposium, pp. 310\u2013314. IEEE Press, Los Alamitos (1997)"},{"key":"92_CR7","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1137\/S089547989223924X","volume":"15","author":"M. Gu","year":"1994","unstructured":"Gu, M., Eisenstat, S.C.: A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl.\u00a015, 1266\u20131276 (1994)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"92_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895479892241287","volume":"16","author":"M. Gu","year":"1995","unstructured":"Gu, M., Eisenstat, S.C.: A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl.\u00a016, 172\u2013191 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"92_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/513001.513004","volume":"28","author":"W.N. Gansterer","year":"2002","unstructured":"Gansterer, W.N., Ward, R.C., Muller, R.P.: An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. ACM Trans. Math. Softw.\u00a028, 45\u201358 (2002)","journal-title":"ACM Trans. Math. Softw."},{"key":"92_CR10","series-title":"The Kluwer International Series in Engineering and Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/0-387-23096-3_5","volume-title":"Distributed and Parallel Systems: Cluster and Grid Computing","author":"W.N. Gansterer","year":"2005","unstructured":"Gansterer, W.N., Zottl, J.: Message passing vs. virtual shared memory - a performance comparison. In: Juh\u00e1sz, Z., Kacsuk, P., Kranzlm\u00fcller, D. (eds.) Distributed and Parallel Systems: Cluster and Grid Computing. The Kluwer International Series in Engineering and Computer Science, vol.\u00a0777, pp. 39\u201346. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Blackford, L.S., Choi, J., Cleary, A., D\u2019Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK Users\u2019 Guide. Society for Industrial and Applied Mathematics (1997)","key":"92_CR11","DOI":"10.1137\/1.9780898719642"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_92","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:10:33Z","timestamp":1587341433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11549468_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}