{"entities":{"Q2732851":{"pageid":2743590,"ns":120,"title":"Item:Q2732851","lastrevid":82833836,"modified":"2026-05-06T22:11:21Z","type":"item","id":"Q2732851","labels":{"en":{"language":"en","value":"A robust, parallelizable, \\(O(m)\\), a posteriori recursive least squares algorithm for efficient adaptive filtering"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1632248"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2732851$03E2E5FC-C992-4640-A907-734EBC81EA51","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"73ab1574d4e58e765889f43bed10ee16d94dae06","datavalue":{"value":"1009.93077","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2732851$8CC6CFFF-A71F-4388-BC2A-0BD2B71026B5","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8032b53ade99a94b87f65c539e1ffe6192ff11eb","datavalue":{"value":"10.1109/78.782203","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2732851$62C50B51-89B0-4C03-8E00-5C51ABE3123B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"bd3fd59ea6c3a2f1a1b6fd86804a84d2be7bf629","datavalue":{"value":{"entity-type":"item","numeric-id":233697,"id":"Q233697"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2732851$0EEF0261-AC22-463F-82AE-725B3B3C31D4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"39346dfbe0bcea35dbae204dc5864c494831351b","datavalue":{"value":{"entity-type":"item","numeric-id":63219,"id":"Q63219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2732851$D3F1A145-D534-423F-8A34-9F14426C48D2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"09a65dcece05039203ce03236409dca56b9f1271","datavalue":{"value":{"time":"+2002-03-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2732851$0B3B2B6E-09F1-4C90-9E39-560F05BA52DE","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"19887720c9f9a189dd61bc85aa051ea9f0a2325d","datavalue":{"value":"93E11","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2732851$E62FAF08-DD9D-4ACC-9875-D78C5B54D08D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8507c5cb252c5fa8df88e8def65b15a4ca8f94f3","datavalue":{"value":"93E24","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2732851$1F5351E9-7333-4B2A-8EF4-0A68074D5B1C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a7edc01538ef78e7e423d9c49f622de0faa5a14","datavalue":{"value":"65Y05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2732851$DA2FA275-6FB6-44D6-9CF7-2FAE63EBA298","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ccf7b00a06dafb7d398cd3aa18049618f25bcd13","datavalue":{"value":"1632248","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2732851$384B749D-5E40-419E-B833-1A9E886B4C0D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9e422521c468e028d3c8d868c2a64451258be44d","datavalue":{"value":"adaptive filtering","type":"string"},"datatype":"string"},"type":"statement","id":"Q2732851$1B10298A-EEC5-4AA8-8F30-1DFA345F007A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"00cb10bb58fbfe2e94809826f6fb1c6bda4b8f62","datavalue":{"value":"RLS algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q2732851$0BA35208-7403-4125-A57B-8C4B03426736","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f53c7d61e73f6d94df425c83f07a716777d37df8","datavalue":{"value":"finite memory filtering","type":"string"},"datatype":"string"},"type":"statement","id":"Q2732851$86850806-557D-40A3-99DA-99406A0CCA3E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"fe5ee8e12f0d39468e87e17b5871f2dc0c3be60e","datavalue":{"value":"tracking","type":"string"},"datatype":"string"},"type":"statement","id":"Q2732851$BDC2FDC9-B9DE-4C51-AC58-B6F8C7E54164","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2732851$13DE128F-DA65-49CA-AE99-A6854D6BFD85","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3c2fcc024d9fb6acf6ae5ce0919e958b998ce69f","datavalue":{"value":"https://doi.org/10.1109/78.782203","type":"string"},"datatype":"url"},"type":"statement","id":"Q2732851$360E7E8A-0AFA-4734-A736-21E8255ADFBE","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"6d133dd5a6600b8295ed65d643f937bd11e1af6f","datavalue":{"value":"W2120082487","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2732851$F1BB8F54-2F6B-4970-83A5-61A94D9E482E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"831b477520b425972f06b72ea6589187b27e6e25","datavalue":{"value":{"text":"A robust, parallelizable, \\(O(m)\\), a posteriori recursive least squares algorithm for efficient adaptive filtering","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2732851$D35D894B-E8CC-4EAB-8A44-FF57C3EAF913","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ddaba53d99fd35006aabace859caf6b080ba5277","datavalue":{"value":"The paper presents a new recursive least squares finite memory adaptive filtering algorithm. Its main properties are small tracking error, high speed of convergence and simple stabilizability. Furthermore, it can be easily parallelized, thus resulting in a particularly fast algorithm, and its stabilized version appears to be suitable also for nonstationary signals. The results of a few applications to real data are shown.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2732851$AE2260A5-04DB-4E75-A2B3-C6A78AF7DEE5","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"44061b789072c99f5482cb96165547a961c2c6c3","datavalue":{"value":{"entity-type":"item","numeric-id":1050960,"id":"Q1050960"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2732851$6394B915-6719-410C-A14B-00CB077B8F8F","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"227de263c142a7e22e132e0966577ecd665781ed","datavalue":{"value":{"entity-type":"item","numeric-id":4392328,"id":"Q4392328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ce4ace2647e6ab0c21d9a81e0f17e4db33cb14b3","datavalue":{"value":{"amount":"+0.902390480041504","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2732851$909326B5-1B79-4995-8022-502518FE459E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5ec40de72f21ead50691023db39d1913ff0a4287","datavalue":{"value":{"entity-type":"item","numeric-id":1275479,"id":"Q1275479"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"94b8ce3f10c95dbcbbf755fe7bfbaae919f05cf2","datavalue":{"value":{"amount":"+0.811974287033081","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2732851$389986A9-C699-4D88-B001-0C40D94C1CF5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c335e270f43dd2b3cb51658c8c0140cf23fa3633","datavalue":{"value":{"entity-type":"item","numeric-id":3699595,"id":"Q3699595"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d583a27bc86645be6373d38f98e86d62195e94f8","datavalue":{"value":{"amount":"+0.8064841628074646","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2732851$C065D54E-BB85-47D5-84F9-20FD4AA97B49","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"81633cb118b7b5f1e774f84a11700736c259789e","datavalue":{"value":{"entity-type":"item","numeric-id":3986514,"id":"Q3986514"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e7ed867ef4fdf213986c7b63ed29ddf2561971da","datavalue":{"value":{"amount":"+0.8049750328063965","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2732851$E7241E99-A910-4E5B-B73C-41767B1B48C1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"75ecb730c7d043807f461cbe9838e5aa400ccfa0","datavalue":{"value":{"entity-type":"item","numeric-id":4034611,"id":"Q4034611"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"e513864af5eed1cdc95e57c3a70174715970b550","datavalue":{"value":{"amount":"+0.8040410280227661","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2732851$40BC4E7B-CA35-4B10-A5D3-13545BC50BA3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A robust, parallelizable, \\(O(m)\\), a posteriori recursive least squares algorithm for efficient adaptive filtering","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_robust,_parallelizable,_%5C(O(m)%5C),_a_posteriori_recursive_least_squares_algorithm_for_efficient_adaptive_filtering"}}}}}