{"id":"https://openalex.org/W3101817049","doi":"https://doi.org/10.1145/3506691","title":"Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition","display_name":"Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition","publication_year":2022,"publication_date":"2022-03-30","ids":{"openalex":"https://openalex.org/W3101817049","doi":"https://doi.org/10.1145/3506691","mag":"3101817049"},"language":"en","primary_location":{"id":"doi:10.1145/3506691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3506691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3506691","source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3506691","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014402597","display_name":"V. Charumathi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"V. Charumathi","raw_affiliation_strings":["Indian Institute of Technology, Tamilnadu, India"],"raw_orcid":"https://orcid.org/0000-0003-1864-0631","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Tamilnadu, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"M. Ramakrishna","orcid":"https://orcid.org/0000-0003-2089-637X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Ramakrishna","raw_affiliation_strings":["Indian Institute of Technology, Tamilnadu, India"],"raw_orcid":"https://orcid.org/0000-0003-2089-637X","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Tamilnadu, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056698254","display_name":"V. Vasudevan","orcid":"https://orcid.org/0000-0001-7039-3821"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vinita Vasudevan","raw_affiliation_strings":["Indian Institute of Technology, Tamilnadu, India"],"raw_orcid":"https://orcid.org/0000-0001-7039-3821","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Tamilnadu, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4982,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.53791347,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"48","issue":"2","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"Singular value decomposition","score":0.746900200843811},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.6521146297454834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6120832562446594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5480490326881409},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.54731684923172},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5333461761474609},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.47837916016578674},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.47238779067993164},{"id":"https://openalex.org/keywords/proper-orthogonal-decomposition","display_name":"Proper orthogonal decomposition","score":0.46183040738105774},{"id":"https://openalex.org/keywords/nonuniform-sampling","display_name":"Nonuniform sampling","score":0.4342103600502014},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42924338579177856},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.397205650806427},{"id":"https://openalex.org/keywords/point-of-delivery","display_name":"Point of delivery","score":0.36031538248062134},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3523693382740021}],"concepts":[{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.746900200843811},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.6521146297454834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6120832562446594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5480490326881409},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.54731684923172},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5333461761474609},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.47837916016578674},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.47238779067993164},{"id":"https://openalex.org/C2984998066","wikidata":"https://www.wikidata.org/wiki/Q105037988","display_name":"Proper orthogonal decomposition","level":3,"score":0.46183040738105774},{"id":"https://openalex.org/C20326153","wikidata":"https://www.wikidata.org/wiki/Q7049638","display_name":"Nonuniform sampling","level":3,"score":0.4342103600502014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42924338579177856},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.397205650806427},{"id":"https://openalex.org/C137776501","wikidata":"https://www.wikidata.org/wiki/Q7208270","display_name":"Point of delivery","level":2,"score":0.36031538248062134},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3523693382740021},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C28855332","wikidata":"https://www.wikidata.org/wiki/Q198099","display_name":"Quantization (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3506691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3506691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3506691","source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3506691","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3506691","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3506691","source":{"id":"https://openalex.org/S163326656","display_name":"ACM Transactions on Mathematical Software","issn_l":"0098-3500","issn":["0098-3500","1557-7295"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Mathematical Software","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3101817049.pdf","grobid_xml":"https://content.openalex.org/works/W3101817049.grobid-xml"},"referenced_works_count":51,"referenced_works":["https://openalex.org/W637574335","https://openalex.org/W658559791","https://openalex.org/W1505090736","https://openalex.org/W1568377519","https://openalex.org/W1572352401","https://openalex.org/W1625660427","https://openalex.org/W1925032196","https://openalex.org/W1970576574","https://openalex.org/W1970950689","https://openalex.org/W1979750072","https://openalex.org/W1997120656","https://openalex.org/W1998269045","https://openalex.org/W2004791924","https://openalex.org/W2040387238","https://openalex.org/W2044610104","https://openalex.org/W2045390367","https://openalex.org/W2046164006","https://openalex.org/W2084439502","https://openalex.org/W2087399108","https://openalex.org/W2095846217","https://openalex.org/W2096908304","https://openalex.org/W2098693229","https://openalex.org/W2099781564","https://openalex.org/W2103318769","https://openalex.org/W2110121428","https://openalex.org/W2117756735","https://openalex.org/W2123921160","https://openalex.org/W2125874614","https://openalex.org/W2140839682","https://openalex.org/W2148541040","https://openalex.org/W2154249783","https://openalex.org/W2208476665","https://openalex.org/W2270314036","https://openalex.org/W2286444068","https://openalex.org/W2394933259","https://openalex.org/W2478275166","https://openalex.org/W2478426703","https://openalex.org/W2484275557","https://openalex.org/W2488424576","https://openalex.org/W2559655401","https://openalex.org/W2569261326","https://openalex.org/W2762090640","https://openalex.org/W2771019312","https://openalex.org/W2774813727","https://openalex.org/W2938965511","https://openalex.org/W2963098024","https://openalex.org/W3030910590","https://openalex.org/W3101791281","https://openalex.org/W4213245422","https://openalex.org/W4243341520","https://openalex.org/W4298273822"],"related_works":["https://openalex.org/W2654090051","https://openalex.org/W2122264603","https://openalex.org/W1965231199","https://openalex.org/W2112071792","https://openalex.org/W2126432300","https://openalex.org/W1766934673","https://openalex.org/W2997244757","https://openalex.org/W1971445692","https://openalex.org/W854600403","https://openalex.org/W2333109051"],"abstract_inverted_index":{"In":[0,20],"this":[1,21,130],"article,":[2],"we":[3],"propose":[4,111],"a":[5,30,56,100,112],"computationally":[6],"efficient":[7],"iterative":[8,131],"algorithm":[9],"for":[10,47],"proper":[11],"orthogonal":[12],"decomposition":[13],"(POD)":[14],"using":[15,129],"random":[16],"sampling":[17,132],"based":[18],"techniques.":[19],"algorithm,":[22],"additional":[23],"rows":[24],"and":[25,29,133],"columns":[26],"are":[27,94],"sampled":[28],"merging":[31,59,134],"technique":[32],"is":[33],"used":[34],"to":[35,66,114],"update":[36],"the":[37,48,52,72,80,88,92,106,116,127],"dominant":[38],"POD":[39,89,117],"modes":[40,90,118],"in":[41,126],"each":[42],"iteration.":[43,81],"We":[44,61,109],"derive":[45],"bounds":[46],"spectral":[49],"norm":[50],"of":[51,58,71,74,79,119],"error":[53],"introduced":[54],"by":[55],"series":[57],"operations.":[60],"use":[62],"an":[63,68],"existing":[64],"theorem":[65],"get":[67],"approximate":[69],"measure":[70],"quality":[73],"subspaces":[75,93],"obtained":[76],"on":[77,83],"convergence":[78],"Results":[82],"various":[84],"datasets":[85],"indicate":[86],"that":[87,122],"and/or":[91],"approximated":[95],"with":[96,99],"excellent":[97],"accuracy":[98],"significant":[101],"runtime":[102],"improvement":[103],"over":[104],"computing":[105],"truncated":[107],"SVD.":[108],"also":[110],"method":[113],"compute":[115],"large":[120],"matrices":[121],"do":[123],"not":[124],"fit":[125],"RAM":[128],"algorithms.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}