{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254817,0.0009799084,0.001152661,0.001555229,0.0005934165,0.002974532,0.001030934,0.0009709399,0.01044787],"category_scores_gemma":[0.01494769,0.0004711371,0.0004879736,0.001681687,0.001143696,0.002748937,0.00155045,0.002177119,0.00256181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008303014,"about_ca_system_score_gemma":0.00100041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002296437,"about_ca_topic_score_gemma":0.004868071,"domain_scores_codex":[0.9986705,0.0003752749,0.00005499849,0.0001408305,0.000585941,0.0001725051],"domain_scores_gemma":[0.9946983,0.0032927,0.000291604,0.0008462702,0.0006668646,0.0002042512],"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.001460398,0.0004583932,0.002340041,0.0005724524,0.0001342202,0.0003527736,0.0005988069,0.336061,0.01656673,0.3039148,0.01902293,0.3185175],"study_design_scores_gemma":[0.00004560726,0.00009065141,0.0001992366,0.0000280972,0.00001473103,0.00006673515,0.0001057554,0.8814361,0.005126139,0.1098441,0.003027649,0.00001525292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1626774,0.0005754854,0.8175864,0.0008844474,0.0003571295,0.00007421135,0.0005077174,0.001922377,0.01541482],"genre_scores_gemma":[0.6572089,0.000404547,0.324888,0.0002676538,0.0002812778,0.00008307808,0.0009862686,0.0005495772,0.01533077],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01044787,"threshold_uncertainty_score":0.03495157,"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."}}