{"id":"W2771141647","doi":"10.1016/j.jsc.2019.07.012","title":"Computing lower rank approximations of matrix polynomials","year":2019,"lang":"en","type":"preprint","venue":"Journal of Symbolic Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Matrix polynomial; Robustness (evolution); Quadratic growth; Polynomial matrix; Singular value; Dimension (graph theory); Polynomial; Combinatorics; Applied mathematics; Discrete mathematics; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001688994,0.0002650139,0.0008534737,0.0006154554,0.00007806317,0.0002215681,0.001219845,0.0002096403,0.00001527961],"category_scores_gemma":[0.0001048847,0.0002458431,0.0004410929,0.0003524039,0.00005117942,0.0004121134,0.0006858975,0.0006565236,0.00002033234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009214192,"about_ca_system_score_gemma":0.000474227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001132352,"about_ca_topic_score_gemma":2.074318e-7,"domain_scores_codex":[0.9970323,0.0003003679,0.00152017,0.0002937557,0.0006257033,0.0002276718],"domain_scores_gemma":[0.9953081,0.0004590644,0.002969226,0.000440636,0.0007193378,0.0001036359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007264203,0.0004236227,0.0001974873,0.0008842862,0.0003606285,0.00003251163,0.004290024,0.8804597,0.0009332293,0.03088893,0.001451331,0.08000556],"study_design_scores_gemma":[0.001182545,0.0002314808,0.001736196,0.0009185466,0.000103298,0.0002144783,0.00009560847,0.9365437,0.0009126943,0.05738,0.0002768147,0.0004046254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1203078,0.0005061026,0.8745412,0.0004521325,0.003313317,0.0002979041,0.00000879243,0.00003905462,0.0005336173],"genre_scores_gemma":[0.8647087,0.00003354858,0.1345726,0.00004481639,0.0005480343,0.000001035205,0.000006649536,0.00001664453,0.00006796054],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7444008,"threshold_uncertainty_score":0.9999994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01577575626765196,"score_gpt":0.2928442761476158,"score_spread":0.2770685198799638,"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."}}