{"id":"https://openalex.org/W3029815899","doi":"https://doi.org/10.3390/a13060135","title":"A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms","display_name":"A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3029815899","doi":"https://doi.org/10.3390/a13060135","mag":"3029815899"},"language":"en","primary_location":{"id":"doi:10.3390/a13060135","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13060135","pdf_url":"https://www.mdpi.com/1999-4893/13/6/135/pdf?version=1591001534","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/6/135/pdf?version=1591001534","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069530681","display_name":"Camelia Elisei-Iliescu","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Camelia Elisei-Iliescu","raw_affiliation_strings":["Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013729905","display_name":"Laura-Maria Dogariu","orcid":"https://orcid.org/0000-0002-5945-5179"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Laura-Maria Dogariu","raw_affiliation_strings":["Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023279451","display_name":"Constantin Paleologu","orcid":"https://orcid.org/0000-0002-0379-2360"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Constantin Paleologu","raw_affiliation_strings":["Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"raw_orcid":"https://orcid.org/0000-0002-0379-2360","affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071376063","display_name":"Jacob Benesty","orcid":"https://orcid.org/0000-0002-0036-5865"},"institutions":[{"id":"https://openalex.org/I159129438","display_name":"Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al","ror":"https://ror.org/002rjbv21","country_code":"CA","type":"education","lineage":["https://openalex.org/I159129438","https://openalex.org/I49663120"]},{"id":"https://openalex.org/I39481719","display_name":"Institut National de la Recherche Scientifique","ror":"https://ror.org/04td37d32","country_code":"CA","type":"education","lineage":["https://openalex.org/I39481719","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jacob Benesty","raw_affiliation_strings":["INRS-EMT, University of Quebec, Montreal, QC H5A 1K6, Canada"],"raw_orcid":"https://orcid.org/0000-0002-0036-5865","affiliations":[{"raw_affiliation_string":"INRS-EMT, University of Quebec, Montreal, QC H5A 1K6, Canada","institution_ids":["https://openalex.org/I159129438","https://openalex.org/I39481719"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110462699","display_name":"Andrei-Alexandru Enescu","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Andrei-Alexandru Enescu","raw_affiliation_strings":["Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070256554","display_name":"Silviu Ciochin\u0103","orcid":"https://orcid.org/0000-0003-3982-1837"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Silviu Ciochin\u0103","raw_affiliation_strings":["Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5023279451"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.6796,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8404908,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"6","first_page":"135","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.994700014591217,"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.9855999946594238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/recursive-least-squares-filter","display_name":"Recursive least squares filter","score":0.8193563222885132},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6425652503967285},{"id":"https://openalex.org/keywords/impulse-response","display_name":"Impulse response","score":0.5697880983352661},{"id":"https://openalex.org/keywords/least-squares-function-approximation","display_name":"Least-squares function approximation","score":0.5570070147514343},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.5302167534828186},{"id":"https://openalex.org/keywords/impulse","display_name":"Impulse (physics)","score":0.5247704386711121},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5231236815452576},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.49746230244636536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4619259238243103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45896103978157043},{"id":"https://openalex.org/keywords/tensor-decomposition","display_name":"Tensor decomposition","score":0.4473589062690735},{"id":"https://openalex.org/keywords/system-identification","display_name":"System identification","score":0.44169512391090393},{"id":"https://openalex.org/keywords/rank-condition","display_name":"Rank condition","score":0.4375326931476593},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3867494463920593},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.18273228406906128},{"id":"https://openalex.org/keywords/adaptive-filter","display_name":"Adaptive filter","score":0.1751594841480255},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06641972064971924},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.06535577774047852}],"concepts":[{"id":"https://openalex.org/C145249878","wikidata":"https://www.wikidata.org/wiki/Q2835868","display_name":"Recursive least squares filter","level":3,"score":0.8193563222885132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6425652503967285},{"id":"https://openalex.org/C72279823","wikidata":"https://www.wikidata.org/wiki/Q1139726","display_name":"Impulse response","level":2,"score":0.5697880983352661},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.5570070147514343},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.5302167534828186},{"id":"https://openalex.org/C70836080","wikidata":"https://www.wikidata.org/wiki/Q837940","display_name":"Impulse (physics)","level":2,"score":0.5247704386711121},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5231236815452576},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.49746230244636536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4619259238243103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45896103978157043},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.4473589062690735},{"id":"https://openalex.org/C119247159","wikidata":"https://www.wikidata.org/wiki/Q1366192","display_name":"System identification","level":3,"score":0.44169512391090393},{"id":"https://openalex.org/C2778095854","wikidata":"https://www.wikidata.org/wiki/Q4420961","display_name":"Rank condition","level":3,"score":0.4375326931476593},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3867494463920593},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.18273228406906128},{"id":"https://openalex.org/C102248274","wikidata":"https://www.wikidata.org/wiki/Q168388","display_name":"Adaptive filter","level":2,"score":0.1751594841480255},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06641972064971924},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.06535577774047852},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C48209547","wikidata":"https://www.wikidata.org/wiki/Q1331104","display_name":"Controllability","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.0},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13060135","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13060135","pdf_url":"https://www.mdpi.com/1999-4893/13/6/135/pdf?version=1591001534","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:cd52dd4e61344ea9af2807e74ce7037a","is_oa":true,"landing_page_url":"https://doaj.org/article/cd52dd4e61344ea9af2807e74ce7037a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 6, p 135 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/6/135/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13060135","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13060135","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13060135","pdf_url":"https://www.mdpi.com/1999-4893/13/6/135/pdf?version=1591001534","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W32702425","https://openalex.org/W227277429","https://openalex.org/W1523680888","https://openalex.org/W1590500716","https://openalex.org/W1986326495","https://openalex.org/W2024165284","https://openalex.org/W2038920431","https://openalex.org/W2073389244","https://openalex.org/W2119412403","https://openalex.org/W2121235768","https://openalex.org/W2126491786","https://openalex.org/W2135271517","https://openalex.org/W2141793797","https://openalex.org/W2167083368","https://openalex.org/W2243159438","https://openalex.org/W2469230926","https://openalex.org/W2531542831","https://openalex.org/W2597756865","https://openalex.org/W2606722458","https://openalex.org/W2779954309","https://openalex.org/W2786077676","https://openalex.org/W2792920294","https://openalex.org/W2807511666","https://openalex.org/W2886148849","https://openalex.org/W2890592420","https://openalex.org/W2905247237","https://openalex.org/W2905357467","https://openalex.org/W2920877073","https://openalex.org/W2939066948","https://openalex.org/W2939732444","https://openalex.org/W2953212265","https://openalex.org/W2962926568","https://openalex.org/W4243373768"],"related_works":["https://openalex.org/W2281416914","https://openalex.org/W3008929766","https://openalex.org/W2385614044","https://openalex.org/W2803806910","https://openalex.org/W4388903858","https://openalex.org/W2054616108","https://openalex.org/W2375002642","https://openalex.org/W2120604275","https://openalex.org/W2016248580","https://openalex.org/W3029815899"],"abstract_inverted_index":{"High-dimensional":[0],"system":[1],"identification":[2,27],"problems":[3],"can":[4],"be":[5],"efficiently":[6],"addressed":[7],"based":[8,101],"on":[9,56,102],"tensor":[10,47],"decompositions":[11],"and":[12,73],"modelling.":[13],"In":[14,33],"this":[15],"paper,":[16],"we":[17],"design":[18],"a":[19,45],"recursive":[20],"least-squares":[21],"(RLS)":[22],"algorithm":[23,54,86],"tailored":[24],"for":[25],"the":[26,36,42,57,61,79,83,90,96,103],"of":[28,44,60,70],"trilinear":[29,37,99],"forms,":[30],"namely":[31],"RLS-TF.":[32],"our":[34],"framework,":[35],"form":[38],"is":[39],"related":[40],"to":[41],"decomposition":[43],"third-order":[46],"(of":[48],"rank":[49],"one).":[50],"The":[51],"proposed":[52,80],"RLS-TF":[53],"acts":[55],"individual":[58],"components":[59],"global":[62,91],"impulse":[63,92],"response,":[64],"thus":[65],"being":[66],"efficient":[67],"in":[68],"terms":[69],"both":[71],"performance":[72],"complexity.":[74],"Simulation":[75],"results":[76],"indicate":[77],"that":[78],"solution":[81],"outperforms":[82],"conventional":[84],"RLS":[85],"(which":[87],"handles":[88],"only":[89],"response),":[93],"but":[94],"also":[95],"previously":[97],"developed":[98],"counterparts":[100],"least-mean-":[104],"squares":[105],"algorithm.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}