{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:30:47Z","timestamp":1743003047099,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":8,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811528095"},{"type":"electronic","value":"9789811528101"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-981-15-2810-1_61","type":"book-chapter","created":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T18:03:11Z","timestamp":1580580191000},"page":"663-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Absorbing Diagonal Algorithm: A Scalable Iterative Parallel Fast Eigen-Solver for Symmetric Matrices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1263-3051","authenticated-orcid":false,"given":"Junfeng","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5959-2483","authenticated-orcid":false,"given":"Hui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5026-5347","authenticated-orcid":false,"given":"Peng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,2]]},"reference":[{"issue":"1","key":"61_CR1","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1137\/030601107","volume":"27","author":"P Bientinesi","year":"2003","unstructured":"Bientinesi, P., Dhillon, I.S., Van de Geijn, R.A.: A parallel eigensolver for dense symmetric matrices based on multiple relatively robust representations. SIAM J. Sci. Comput. 27(1), 43\u201366 (2003)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"61_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01396757","volume":"36","author":"JJM Cuppen","year":"1980","unstructured":"Cuppen, J.J.M.: A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36(2), 177\u2013195 (1980)","journal-title":"Numer. Math."},{"key":"61_CR3","unstructured":"Dhillon, I., Fann, G., Parlett, B.: Application of a new algorithm for the symmetric eigenproblem to computational quantum chemistry. In: Eighth SIAM Conference on Parallel Processing for Scientific Computing SIAM (1999)"},{"key":"61_CR4","unstructured":"Dhillon, I.S.: A new $$O(n^2)$$ algorithm for the symmetric tridiagonal eigenvalue\/eigenvector problem. Ph.D. thesis, University of California at Berkeley, October 1997"},{"key":"61_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1952-8","volume-title":"Guaranteed Accuracy in Numerical Linear Algebra","author":"SK Godunov","year":"1993","unstructured":"Godunov, S.K., Antonov, A.G., Kiriljuk, O.P., Kostin, V.I.: Guaranteed Accuracy in Numerical Linear Algebra. Kluwer Academic Publishers Group, Dordrecht (1993)"},{"key":"61_CR6","volume-title":"Matrix Computations","author":"GH Golub","year":"1989","unstructured":"Golub, G.H., Loan, C.V.: Matrix Computations, 2nd edn. The Johns Hopkins University Press, Baltimore (1989)","edition":"2"},{"issue":"3","key":"61_CR7","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/S1064827595296719","volume":"21","author":"M Hegland","year":"1970","unstructured":"Hegland, M., Kahn, M., Osborne, M.: A parallel algorithm for the reduction to tridiagonal form for eigendecomposition. SIAM J. Sci. Comput. 21(3), 987\u20131005 (1970)","journal-title":"SIAM J. Sci. Comput."},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"Luszczek, P., Ltaief, H., Dongarra, J.: Two-stage tridiagonal reduction for dense symmetric matrices using tile algorithms on multicore architectures, pp. 944\u2013955 (2011)","DOI":"10.1109\/IPDPS.2011.91"}],"container-title":["Communications in Computer and Information Science","Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-2810-1_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T10:10:19Z","timestamp":1587809419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-2810-1_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811528095","9789811528101"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-2810-1_61","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Service","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ningbo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icds2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/vcrab.com.au\/ICDS2019\/home.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}