{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118309,0.001386535,0.0008694855,0.001531433,0.0007193777,0.0009264678,0.0008414853,0.0005224653,0.005053358],"category_scores_gemma":[0.002681687,0.0005295787,0.001641936,0.000797137,0.00123633,0.001229969,0.001150068,0.001640855,0.001634834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001098416,"about_ca_system_score_gemma":0.001294893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00235513,"about_ca_topic_score_gemma":0.003924769,"domain_scores_codex":[0.9989109,0.0003159108,0.00006860615,0.0001220977,0.0004835438,0.00009886505],"domain_scores_gemma":[0.998896,0.0005297661,0.00007428949,0.0001571169,0.0002976444,0.00004513343],"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.0002330391,0.0001610139,0.0004202168,0.0004348964,0.0001048152,0.0002831993,0.0003324835,0.4900491,0.04294783,0.2737578,0.002722243,0.1885533],"study_design_scores_gemma":[0.0000180043,0.00004960857,0.0000604199,0.00002449055,0.00001817177,0.00003378216,0.00001962149,0.929674,0.007212045,0.06104669,0.001823211,0.00002009625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002667398,0.00005054313,0.995517,0.00002272212,0.00001118798,0.00004753457,0.00004087233,0.0002197599,0.001423061],"genre_scores_gemma":[0.1947427,0.0002643891,0.8011719,0.00008936234,0.00004922976,0.0004784661,0.0004790944,0.0002101807,0.002514654],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005053358,"threshold_uncertainty_score":0.01690519,"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."}}