{"id":"W2111643434","doi":"10.1109/tsp.2004.842180","title":"A fast recursive total least squares algorithm for adaptive IIR filtering","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Algorithm; Computational complexity theory; Recursive least squares filter; Ramer–Douglas–Peucker algorithm; Rayleigh quotient; Mathematics; Adaptive filter; Least-squares function approximation; Infinite impulse response; Kalman filter; Rayleigh quotient iteration; Computer science; Computation; Mathematical optimization; Iterative method; Filter (signal processing); Digital filter; Power iteration; Eigenvalues and eigenvectors","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008137697,0.0003406027,0.0002673427,0.0002154951,0.0002964908,0.00007635834,0.0001646565,0.0001218945,0.00005394161],"category_scores_gemma":[0.000001891973,0.0003755392,0.0001417234,0.0002264754,0.00007437902,0.0007015027,0.000001956785,0.0003740359,0.00001878945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002693485,"about_ca_system_score_gemma":0.00003269018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002688415,"about_ca_topic_score_gemma":0.000006606961,"domain_scores_codex":[0.9986598,0.00001622869,0.0003073167,0.0003607411,0.0002033998,0.0004525369],"domain_scores_gemma":[0.9994709,0.00007960391,0.0000607538,0.0001531514,0.000124685,0.0001109213],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004200583,0.00004401937,6.93444e-8,0.00004441974,0.00003024614,0.000002703528,0.0003419653,0.305438,0.01723386,0.000009211361,0.00003851731,0.676775],"study_design_scores_gemma":[0.0004092199,0.000264841,0.000004017825,0.0003487154,0.00003314403,0.00003840217,0.0002483928,0.6452436,0.3518755,0.0002624449,0.0008282935,0.0004433919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001481778,0.0001725782,0.9958801,0.00003617743,0.0001523396,0.0004250816,0.0001563998,0.001283923,0.000411609],"genre_scores_gemma":[0.6839253,0.00001020977,0.3153231,0.00002876686,0.0001985293,0.0002556778,0.000003576859,0.00008882143,0.0001659978],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6824436,"threshold_uncertainty_score":0.9998696,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01944094912806713,"score_gpt":0.253033004509188,"score_spread":0.2335920553811208,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}