{"id":"W2129466305","doi":"10.1162/neco_a_00549","title":"A Novel Iterative Method for Computing Generalized Inverse","year":2013,"lang":"en","type":"article","venue":"Neural Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Iterative method; Karush–Kuhn–Tucker conditions; Convergence (economics); Inverse; Mathematics; Acceleration; Algorithm; Generalized inverse; Mathematical optimization; Computer science; Computational complexity theory; Applied mathematics","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.0002672144,0.0001300319,0.0001541239,0.00008338705,0.0001890942,0.0003013055,0.0002902467,0.0000397869,0.00001068793],"category_scores_gemma":[0.00004179673,0.0001168092,0.00007865114,0.0002407937,0.00001680675,0.0007010904,0.0001047935,0.00008249525,0.00003254347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002258939,"about_ca_system_score_gemma":0.00001824471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004531948,"about_ca_topic_score_gemma":0.000001681514,"domain_scores_codex":[0.9989809,0.0001312376,0.0002259353,0.0003167128,0.0001331169,0.0002120794],"domain_scores_gemma":[0.9991053,0.0003700588,0.000124452,0.0001405257,0.0001905982,0.00006910231],"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.00002619642,0.0001414563,0.00003296687,0.0000720378,0.00004842512,0.000003764684,0.004240467,0.1841033,0.04944257,0.1772359,0.005990787,0.5786622],"study_design_scores_gemma":[0.0007246414,0.00008122709,0.0002065836,0.00000671828,0.000003977486,0.0000172515,0.00002070004,0.9737768,0.001857451,0.02291653,0.0002485864,0.0001396001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03218874,0.00000958665,0.9657278,0.0009008537,0.0003418963,0.000494504,0.000002675409,0.0001806782,0.0001532651],"genre_scores_gemma":[0.2029431,2.032202e-7,0.7956784,0.001084673,0.0001258211,0.00002665127,0.00001281593,0.000007580637,0.000120729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7896734,"threshold_uncertainty_score":0.4763341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03561027582205123,"score_gpt":0.3167459392857639,"score_spread":0.2811356634637127,"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."}}