{"id":"W2138844572","doi":"10.1109/tac.2005.852558","title":"Gradient based iterative algorithms for solving a class of matrix equations","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":497,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative method; Sylvester matrix; Matrix (chemical analysis); Mathematics; Algorithm; Convergence (economics); Rate of convergence; Matrix-free methods; Matrix splitting; Convergent matrix; Mathematical optimization; Applied mathematics; Local convergence; Computer science; Sparse matrix; State-transition matrix; Symmetric matrix; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0004985145,0.0001996098,0.0003292884,0.0002782435,0.00026568,0.00009038937,0.0004316737,0.00007005017,0.0001146914],"category_scores_gemma":[0.000028324,0.0001834939,0.0002537943,0.0003367196,0.00005490965,0.0003617307,0.00000137915,0.0001086859,0.00003427598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008722179,"about_ca_system_score_gemma":0.0001233877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005255331,"about_ca_topic_score_gemma":0.00001254588,"domain_scores_codex":[0.9984812,0.0001053146,0.0005184205,0.0003145563,0.0002765841,0.0003038946],"domain_scores_gemma":[0.997688,0.001392524,0.0001925991,0.0004742065,0.00015089,0.0001017785],"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.00007280122,0.001300607,0.000001060528,0.0001692738,0.0002705819,0.000004170677,0.002397968,0.2919021,0.005367031,0.04484842,0.0001561519,0.6535099],"study_design_scores_gemma":[0.002385236,0.0002594252,0.000006291434,0.0000626293,0.00006260855,0.000003967612,0.0000295335,0.981966,0.01339529,0.001342477,0.0003039755,0.0001825803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001054756,0.00003021209,0.9951734,0.001992032,0.0004144044,0.0008734322,0.00009674218,0.000267713,0.00009733752],"genre_scores_gemma":[0.8454934,0.000001027653,0.1535838,0.0002863035,0.00004919372,0.0003108063,0.000001446285,0.00001307,0.000260949],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8444387,"threshold_uncertainty_score":0.7482666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01600660647456744,"score_gpt":0.2689512016773292,"score_spread":0.2529445952027617,"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."}}