{"id":"W4360942255","doi":"10.1093/nsr/nwad083","title":"Fast algorithms for singular value decomposition and the inverse of nearly low-rank matrices","year":2023,"lang":"en","type":"article","venue":"National Science Review","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Singular value decomposition; Rank (graph theory); Inverse; Decomposition; Mathematics; Singular value; Value (mathematics); Applied mathematics; Algorithm; Combinatorics; Statistics; Physics; Chemistry; Geometry; Eigenvalues and eigenvectors","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.002996713,0.002247167,0.001958844,0.001840474,0.0007472108,0.003005439,0.001933351,0.001807477,0.005167373],"category_scores_gemma":[0.01510078,0.001027734,0.00129281,0.002278746,0.001765347,0.00432413,0.002109505,0.004594598,0.004155281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008259498,"about_ca_system_score_gemma":0.001986853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001660491,"about_ca_topic_score_gemma":0.001870558,"domain_scores_codex":[0.997834,0.0006195275,0.0001133557,0.0003511335,0.0009458836,0.0001360455],"domain_scores_gemma":[0.9946294,0.002735862,0.0003443967,0.0009453119,0.001226409,0.0001186516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002077931,0.0001258831,0.000542895,0.0008924548,0.0001765482,0.0001255738,0.000223207,0.1239537,0.01107932,0.3977712,0.0191899,0.4457116],"study_design_scores_gemma":[0.00007150976,0.0001349297,0.0001947905,0.0001476668,0.00002771097,0.0002309511,0.00006331958,0.6020475,0.007177985,0.3667264,0.02311217,0.00006514814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005520771,0.0007815216,0.9972378,0.0001887543,0.0001146793,0.00002202571,0.000031398,0.0002252977,0.0008464269],"genre_scores_gemma":[0.02502508,0.00266325,0.9678525,0.0002680944,0.0004725321,0.00018666,0.0003277757,0.0002410305,0.00296297],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005167373,"threshold_uncertainty_score":0.01728654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02209570406689831,"score_gpt":0.3287137793896314,"score_spread":0.3066180753227331,"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."}}