{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083938,0.0007968036,0.0007159161,0.0005791503,0.0003655238,0.0006396037,0.0009719598,0.0009825208,0.002285677],"category_scores_gemma":[0.002425812,0.0004232928,0.0007596294,0.0006538386,0.0005154018,0.001092412,0.0006606313,0.00119978,0.001853023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004088926,"about_ca_system_score_gemma":0.0009967928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317702,"about_ca_topic_score_gemma":0.003041932,"domain_scores_codex":[0.9993087,0.0001641283,0.00003474502,0.0001206413,0.0003348051,0.00003703077],"domain_scores_gemma":[0.9994912,0.0002057979,0.00004193038,0.00007581027,0.0001695604,0.0000156163],"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.00009772118,0.00005627181,0.0003853822,0.0001639327,0.00009362991,0.00009595692,0.0001046488,0.2600524,0.02999913,0.04105908,0.005243024,0.662649],"study_design_scores_gemma":[0.00002189697,0.00004491458,0.0001176638,0.000009405981,0.00001240908,0.00008081594,0.000006714451,0.9831161,0.00397305,0.005071486,0.007525177,0.0000203708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004718392,0.00007295611,0.9989605,0.00002299053,0.00002297192,0.000009450567,0.000007505575,0.0002006053,0.0002310854],"genre_scores_gemma":[0.022607,0.0002124392,0.9747962,0.00005356449,0.00005644561,0.00008929173,0.0001031727,0.0001099448,0.001971859],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002317702,"threshold_uncertainty_score":0.007646382,"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."}}