{"id":"W1840032205","doi":"10.1002/nla.1823","title":"On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Kronecker product; Mathematics; Kronecker delta; Combinatorics; Moore–Penrose pseudoinverse; Inverse; Rank (graph theory); Linear least squares; Least-squares function approximation; Product (mathematics); Condition number; Applied mathematics; Upper and lower bounds; Matrix (chemical analysis); Linear model; Statistics; Mathematical analysis; Geometry","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.0002840122,0.0002096917,0.0001986498,0.00007839806,0.0003354203,0.00007380381,0.0003195212,0.00007583786,0.00002445081],"category_scores_gemma":[0.00005327534,0.0001706562,0.00004163766,0.0005284875,0.000135102,0.0005492612,0.00009370284,0.0001902481,0.0001709262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000342579,"about_ca_system_score_gemma":0.00005852814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008707094,"about_ca_topic_score_gemma":0.000001501451,"domain_scores_codex":[0.9985836,0.00005546886,0.0002399939,0.0004947847,0.0002232711,0.0004029274],"domain_scores_gemma":[0.9987534,0.0002086766,0.0001345878,0.0005004554,0.0001446651,0.0002582587],"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.00007128906,0.0006876302,0.001039896,0.0001468724,0.00005047938,0.000001024908,0.0009125687,0.0005707205,0.0006301033,0.9773323,0.001642078,0.01691501],"study_design_scores_gemma":[0.006366896,0.002467549,0.005364697,0.0003064541,0.000296179,0.0002236158,0.0007537159,0.455634,0.02330247,0.1455221,0.3562281,0.003534274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0136059,0.0001248629,0.9820059,0.00178997,0.00007014475,0.001598229,0.00003908225,0.0002164166,0.0005494903],"genre_scores_gemma":[0.5435082,0.000009274037,0.4537874,0.0006559793,0.0004604536,0.001122969,0.00009648554,0.00003407266,0.0003252162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8318102,"threshold_uncertainty_score":0.6959158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01265069169889564,"score_gpt":0.2548747174177887,"score_spread":0.242224025718893,"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."}}