{"id":"W2049871086","doi":"10.1016/j.sysconle.2004.06.008","title":"Iterative least-squares solutions of coupled Sylvester matrix equations","year":2004,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":417,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sylvester matrix; Sylvester equation; Iterative method; Mathematics; Sylvester's law of inertia; Matrix-free methods; Least-squares function approximation; Applied mathematics; Matrix (chemical analysis); Block (permutation group theory); Gauss–Seidel method; Augmented matrix; Mathematical optimization; Algorithm; State-transition matrix; Sparse matrix; Symmetric matrix; Mathematical analysis; Eigenvalues and eigenvectors; Polynomial matrix; Polynomial","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.0005280923,0.0001865297,0.0003539595,0.0001747995,0.0001765492,0.0001809707,0.0005684202,0.0000587385,0.00001638128],"category_scores_gemma":[0.00004098859,0.0001655148,0.0001473438,0.0003020697,0.00008454864,0.0005675262,0.00006477701,0.0001339874,0.0001313653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008272709,"about_ca_system_score_gemma":0.00007665479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001870769,"about_ca_topic_score_gemma":0.000007882477,"domain_scores_codex":[0.9982592,0.0002247821,0.0004814274,0.0003321338,0.000333749,0.0003686896],"domain_scores_gemma":[0.9987153,0.0002605799,0.0002499958,0.0005517734,0.0001264994,0.00009583488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002164169,0.00008398901,0.00009536785,0.00008567923,0.0001389449,0.0000214734,0.001450791,0.06177771,0.06765155,0.8683269,0.000152175,0.0001937868],"study_design_scores_gemma":[0.01738415,0.0007334577,0.001341359,0.0010664,0.0002089446,0.0001775499,0.0009109036,0.9543133,0.001803059,0.01723962,0.002996673,0.001824553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02538016,0.0004101339,0.967697,0.004682868,0.0008142081,0.0006406924,0.000028294,0.0001382335,0.0002084005],"genre_scores_gemma":[0.9970529,0.00000106941,0.001949904,0.0005681972,0.0001590384,0.00008392209,0.000004543164,0.00001129389,0.0001691263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9716728,"threshold_uncertainty_score":0.6749499,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01244607554982687,"score_gpt":0.2367437615219746,"score_spread":0.2242976859721477,"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."}}