{"id":"https://openalex.org/W6910595322","doi":"https://doi.org/10.48550/arxiv.2507.11095","title":"Performance Enhancement of the Recursive Least Squares Algorithms with Rank Two Updates","display_name":"Performance Enhancement of the Recursive Least Squares Algorithms with Rank Two Updates","publication_year":2025,"publication_date":"2025-07-15","ids":{"openalex":"https://openalex.org/W6910595322","doi":"https://doi.org/10.48550/arxiv.2507.11095"},"language":"en","primary_location":{"id":"doi:10.48550/arxiv.2507.11095","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.11095","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2507.11095","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Stotsky, Alexander","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stotsky, Alexander","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.8917999863624573,"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.8917999863624573,"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/T10320","display_name":"Neural Networks and Applications","score":0.011800000444054604,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.004900000058114529,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6901000142097473},{"id":"https://openalex.org/keywords/recursive-least-squares-filter","display_name":"Recursive least squares filter","score":0.6521000266075134},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5720000267028809},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.5098999738693237},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.461899995803833},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.44290000200271606},{"id":"https://openalex.org/keywords/performance-improvement","display_name":"Performance improvement","score":0.35100001096725464},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.32919999957084656},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.31619998812675476}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6901000142097473},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6873999834060669},{"id":"https://openalex.org/C145249878","wikidata":"https://www.wikidata.org/wiki/Q2835868","display_name":"Recursive least squares filter","level":3,"score":0.6521000266075134},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5720000267028809},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.5098999738693237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49070000648498535},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.461899995803833},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44290000200271606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4180999994277954},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.35100001096725464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34139999747276306},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C137345334","wikidata":"https://www.wikidata.org/wiki/Q7303350","display_name":"Recursive partitioning","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C2986800882","wikidata":"https://www.wikidata.org/wiki/Q7168187","display_name":"Performance enhancement","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.2621999979019165},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2599000036716461},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.2563999891281128},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.2529999911785126},{"id":"https://openalex.org/C7149132","wikidata":"https://www.wikidata.org/wiki/Q1377840","display_name":"Forgetting","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2507.11095","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.11095","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2507.11095","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.11095","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"New":[0],"recursive":[1,59],"least":[2],"squares":[3],"algorithms":[4,41,60,83],"with":[5,38,42,62],"rank":[6,43],"two":[7],"updates":[8],"(RLSR2)":[9],"that":[10],"include":[11],"both":[12],"exponential":[13],"and":[14,26,32,71],"instantaneous":[15],"forgetting":[16,24],"(implemented":[17],"via":[18],"a":[19],"proper":[20],"choice":[21],"of":[22,57,65,68,81,89,91,98],"the":[23,27,58,63,66,87,92,96],"factor":[25],"window":[28],"size)":[29],"are":[30,74],"introduced":[31],"systematically":[33],"associated":[34,61],"in":[35,76,86,95],"this":[36,77],"report":[37],"well-known":[39],"RLS":[40],"one":[44],"updates.":[45],"Moreover,":[46],"new":[47,82],"properties":[48],"(which":[49],"can":[50],"be":[51],"used":[52],"for":[53],"further":[54],"performance":[55,80],"improvement)":[56],"convergence":[64],"inverse":[67],"information":[69],"matrix":[70],"parameter":[72],"vector":[73],"established":[75],"report.":[78],"The":[79],"is":[84],"examined":[85],"problem":[88],"estimation":[90],"grid":[93],"events":[94],"presence":[97],"significant":[99],"harmonic":[100],"emissions.":[101]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}