{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005332058,0.00007608536,0.000173705,0.0001282533,0.0003342897,0.0001110062,0.0007259956,0.00001894646,0.000006095123],"category_scores_gemma":[0.0004404888,0.00004928412,0.00007465783,0.001907394,0.0004147213,0.0006114311,0.00015772,0.00004883567,0.00001995267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002933236,"about_ca_system_score_gemma":0.000195281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006662264,"about_ca_topic_score_gemma":4.833636e-7,"domain_scores_codex":[0.9985542,0.00008671002,0.0002499388,0.0002637862,0.0006735421,0.0001718215],"domain_scores_gemma":[0.9988309,0.0004574195,0.0001504767,0.0001658346,0.0003407973,0.00005461296],"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.000005106492,0.00002217513,0.000006510077,0.0005987285,0.000008204898,9.588886e-7,0.0001904379,0.0001931699,0.0004781585,0.8577248,0.0006786336,0.1400931],"study_design_scores_gemma":[0.0008370599,0.00006579963,0.0005391268,0.001218616,0.00003375533,0.00003180697,0.00001696782,0.7938892,0.0009223523,0.1948036,0.007426275,0.0002153777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01234319,0.05000806,0.8922222,0.03544917,0.001425591,0.004312719,0.00008800181,0.0003769543,0.003774153],"genre_scores_gemma":[0.153688,0.1182497,0.7130834,0.01228136,0.0009619695,0.0006760169,0.00007303042,0.00004936965,0.0009371283],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.793696,"threshold_uncertainty_score":0.257112,"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."}}