{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:54:29Z","timestamp":1759838069293,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/acc.2016.7525428","type":"proceedings-article","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T13:52:25Z","timestamp":1470405145000},"page":"3310-3315","source":"Crossref","is-referenced-by-count":1,"title":["A computationally optimal randomized proper orthogonal decomposition technique"],"prefix":"10.1109","author":[{"given":"Dan","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suman","family":"Chakravorty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7170886"},{"key":"ref11","article-title":"A computationally optimal randomized proper orthogonal decomposition technique","author":"yu","year":"2015","journal-title":"arXiv 1509 05705 Tech Rep"},{"key":"ref12","article-title":"Perturbation results for singular values","author":"soderstrom","year":"1999","journal-title":"Department of Information Technology at Uppsala University Tech Rep"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"3044","DOI":"10.1109\/TSP.2007.916137","article-title":"First-order perturbation analysis of singular vectors in singular value decomposition","volume":"56","author":"friedlander","year":"2008","journal-title":"IEEE Transactions on Signal Processing"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-66282-9","author":"kato","year":"1995","journal-title":"Perturbation Theory for Linear Operators"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1981.1102568"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/S0218127405012429"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00162-010-0184-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2514\/3.20031"},{"key":"ref8","article-title":"Randomized algorithms for matrices and data","author":"mahnoey","year":"2011","journal-title":"arXiv 1104 5557 Tech Rep"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2514\/2.1570"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/10080991X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"}],"event":{"name":"2016 American Control Conference (ACC)","start":{"date-parts":[[2016,7,6]]},"location":"Boston, MA, USA","end":{"date-parts":[[2016,7,8]]}},"container-title":["2016 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7518121\/7524873\/07525428.pdf?arnumber=7525428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T03:19:01Z","timestamp":1568258341000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7525428\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/acc.2016.7525428","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}