{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:13:50Z","timestamp":1652195630592},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/tkde.2019.2949309","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T20:08:40Z","timestamp":1572034120000},"page":"1-1","source":"Crossref","is-referenced-by-count":0,"title":["Absorbing Diagonal Algorithm: an Eigensolver of $O(n^{2.584963} \\log\\frac{1}{\\epsilon})$ Complexity at Precision \u03b5"],"prefix":"10.1109","author":[{"given":"Junfeng","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jing","family":"He","sequence":"additional","affiliation":[]},{"given":"Chi-Hung","family":"Chi","sequence":"additional","affiliation":[]},{"given":"Guangyan","family":"Huang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1274971.1275010"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/HPCASIA.2005.18"},{"key":"ref33","article-title":"On the complexity of matrix multiplication","author":"stothers","year":"2010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.52"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0211038"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688513"},{"key":"ref36","first-page":"193","article-title":"Communication-optimal parallel algorithm for strassen’s matrix multiplication","author":"ballard","year":"2012","journal-title":"Proc 4th Annu ACM Symp on Parallel Algorithms and Architectures"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90009-2"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90113-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0211020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.10.011"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2015.56"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396757"},{"key":"ref22","article-title":"A new $o(n^2)$o(n2) algorithm for the symmetric tridiagonal eigenvalue\/eigenvector problem","author":"dhillon","year":"1997"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1952-8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/030601107"},{"key":"ref23","article-title":"Application of a new algorithm for the symmetric eigenproblem to computational quantum chemistry","author":"dhillon","year":"1999","journal-title":"Proc 8th Siam Conf Parallel Process Sci Comput Siam"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.17"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s13160-018-0310-3"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275505"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.11.016"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.3233\/WIA-140303"},{"key":"ref53","article-title":"A quantum-inspired classical algorithm for recommendation systems","volume":"25","author":"tang","year":"2018","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.564"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.228"},{"key":"ref40","first-page":"157","article-title":"Strassen’s matrix multiplication on GPUs","author":"li","year":"2011","journal-title":"Proc IEEE 17th Int Conf Parallel Distrib Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.335"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2017.2703784"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-017-0237-2"},{"key":"ref15","article-title":"An under-sampled software defect prediction method based on hybrid multi-objective cuckoo search","author":"cai","year":"2019","journal-title":"Concurrency Practice Experience"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9729-5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2015.7177401"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2015.05.019"},{"key":"ref19","author":"golub","year":"1989","journal-title":"Matrix Computations"},{"key":"ref4","article-title":"A gaussian error correction multi-objective positioning model with NSGA-II","author":"wang","year":"2019","journal-title":"Concurrency Comput Practice Experience"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.jpdc.2017.12.014","article-title":"Optimal leach protocol with modified bat algorithm for big data sensing systems in internet of things","volume":"132","author":"cui","year":"2019","journal-title":"J Parallel Distrib Comput"},{"key":"ref6","author":"jolliffe","year":"2010","journal-title":"Principal Component Analysis"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5182"},{"key":"ref8","article-title":"The isomap algorithm and topological stability","volume":"295","author":"balasubramanian","year":"2002","journal-title":"Sci"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"roweis","year":"2000","journal-title":"Sci"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF00284194"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1162\/089976603321780317"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/BF00298007"},{"key":"ref45","author":"parlett","year":"1980","journal-title":"The Symmetric Eigenvalue Problem"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/BF00281384"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF00284184"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/4.3.265"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1846.30.51"},{"key":"ref44","first-page":"657","article-title":"Parallel absorbing diagonal algorithm: A scalable iterative parallel fast eigen-solver for symmetric matrices","author":"wu","year":"2019","journal-title":"Proc Int Conf Data Sci"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/4.4.332"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08883086.pdf?arnumber=8883086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:48Z","timestamp":1652194248000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8883086\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2949309","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}