{"id":"W2142455750","doi":"10.1109/cdc.2009.5400336","title":"Schur-based decomposition for reachability analysis of linear time-invariant systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Reduction (mathematics); Linear system; Decomposition; Computer science; Invariant (physics); Computational complexity theory; LTI system theory; Set (abstract data type); Algorithm; Variety (cybernetics); Mathematical optimization; Mathematics; Artificial intelligence","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.00200885,0.00008524337,0.0002817691,0.0002612485,0.00006411316,0.00004498686,0.0004607865,0.00006278009,0.00001072458],"category_scores_gemma":[0.0001834655,0.00007253533,0.0001710878,0.0009831297,0.00002130021,0.0002536024,0.00001854454,0.00004074961,0.000008809449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005407197,"about_ca_system_score_gemma":0.00004068706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004439807,"about_ca_topic_score_gemma":0.000001321426,"domain_scores_codex":[0.998686,0.0002030102,0.0004595587,0.00029942,0.000217287,0.0001347639],"domain_scores_gemma":[0.9984249,0.0002054254,0.0002147094,0.0008428412,0.0002636461,0.00004848557],"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.0001296192,0.0007567407,0.0007354899,0.0001086601,0.0003447581,8.759287e-7,0.0002839045,0.1085662,0.09286286,0.7556034,0.0003427824,0.04026467],"study_design_scores_gemma":[0.0001414681,0.0001955745,0.006377005,0.000006989,0.00008451541,4.349548e-7,0.000003498749,0.9699472,0.02255014,0.0004962286,0.0001179551,0.00007905679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01675539,0.00001157926,0.9815266,0.0002471036,0.00008466111,0.0003198108,0.000008599906,0.0001001611,0.0009461276],"genre_scores_gemma":[0.3664517,2.431491e-7,0.6333861,0.00007018127,0.00001363221,0.00001095174,0.00001699563,0.000001715202,0.00004842925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8613809,"threshold_uncertainty_score":0.2957905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02820843780917342,"score_gpt":0.3384560428677051,"score_spread":0.3102476050585317,"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."}}