{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063481,0.001029129,0.0007297165,0.0006818125,0.0004161609,0.0006556342,0.001067549,0.001162966,0.002071427],"category_scores_gemma":[0.003168904,0.0004054765,0.0006205613,0.000786593,0.000787964,0.001054884,0.0007945055,0.001506928,0.0008409262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005574152,"about_ca_system_score_gemma":0.001066849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606215,"about_ca_topic_score_gemma":0.002667072,"domain_scores_codex":[0.9995958,0.0001264172,0.00002178994,0.00006539604,0.000160339,0.00003022243],"domain_scores_gemma":[0.999331,0.0003810306,0.00005637959,0.00005032533,0.0001644152,0.00001697645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004332271,0.0000681692,0.0005814975,0.0003074384,0.00007546701,0.0001115027,0.0002245791,0.6305235,0.006163719,0.2074197,0.002758972,0.1517221],"study_design_scores_gemma":[0.000009530819,0.00001559859,0.0000472307,0.000009757879,0.00000421992,0.0000245017,0.000008940696,0.976334,0.0008581502,0.02067485,0.002007111,0.0000061224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001300959,0.0001461631,0.9970981,0.00004807591,0.0000168846,0.00002624643,0.000008741958,0.00009117812,0.001263672],"genre_scores_gemma":[0.08796046,0.0006076714,0.9069616,0.00008535273,0.00006978801,0.0003382951,0.00008295407,0.0001039941,0.003789958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002606215,"threshold_uncertainty_score":0.006929636,"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."}}