{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005910278,0.0007665765,0.0007787807,0.0006628942,0.0004925567,0.0007619162,0.0009807616,0.0008885358,0.00328369],"category_scores_gemma":[0.001635639,0.0003259426,0.0008241872,0.0007238928,0.0006661564,0.001331544,0.001101937,0.001267403,0.001276911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003662455,"about_ca_system_score_gemma":0.001131472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001147797,"about_ca_topic_score_gemma":0.001380612,"domain_scores_codex":[0.9994381,0.0001222851,0.00003093018,0.0000772845,0.0002959517,0.0000353947],"domain_scores_gemma":[0.9996071,0.00009973863,0.00003337018,0.0000559893,0.0001789134,0.00002493344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001616603,0.00009353461,0.0007120445,0.0006901847,0.0001643902,0.000386926,0.0004176249,0.2271905,0.06959785,0.3368541,0.007957189,0.3557739],"study_design_scores_gemma":[0.00003008218,0.00007964134,0.000129274,0.00003008597,0.00002074081,0.0003244394,0.00003086736,0.9500133,0.007562145,0.0275926,0.0141473,0.00003954416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001182411,0.0001210759,0.9968711,0.00004789959,0.00006390545,0.00001898623,0.0000091684,0.0001006004,0.001584917],"genre_scores_gemma":[0.06864341,0.0004447318,0.9251338,0.0001120279,0.0001159785,0.0001476178,0.00008192666,0.0001381551,0.005182363],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00328369,"threshold_uncertainty_score":0.01098502,"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."}}