{"id":"W2075924802","doi":"10.1016/s0024-3795(02)00345-2","title":"Upper and lower bounds for ranks of matrix expressions using generalized inverses","year":2002,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur complement; Inverse; Matrix (chemical analysis); Complement (music); Combinatorics; Generalized inverse; Moore–Penrose pseudoinverse; Rank (graph theory); Upper and lower bounds; Expression (computer science); Pure mathematics; Mathematical analysis; Geometry; Eigenvalues and eigenvectors","routes":{"ca_aff":true,"ca_fund":true,"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.00009092621,0.00008641165,0.0001275413,0.00005785376,0.0002266428,0.000046364,0.0001826072,0.00005164442,0.00005156912],"category_scores_gemma":[0.00001653136,0.00007474665,0.00004068676,0.0001647637,0.00005417553,0.0001909848,0.0001277864,0.00004682569,0.000005100267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003490683,"about_ca_system_score_gemma":0.000009498359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002865581,"about_ca_topic_score_gemma":2.485413e-7,"domain_scores_codex":[0.9993935,0.00002037886,0.0001696081,0.0002202018,0.00007002775,0.0001262944],"domain_scores_gemma":[0.9994627,0.0001016072,0.000066439,0.0002361375,0.00005794355,0.00007515058],"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.000009256351,0.0001457042,0.00004428039,0.00008653832,0.00002881222,4.333791e-7,0.0006418558,0.00005982526,0.02839127,0.9564577,0.0006055411,0.01352883],"study_design_scores_gemma":[0.001120517,0.00007139938,0.00004645615,0.00003332231,0.00004836682,0.00002109244,0.00005109892,0.8587249,0.01360488,0.04464542,0.08133519,0.0002973814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1687235,0.00284958,0.8264238,0.0005970213,0.00009675032,0.0006738748,0.00005605055,0.00008054292,0.0004988597],"genre_scores_gemma":[0.7064714,0.0006492627,0.2898962,0.0003292602,0.0002724247,0.0002131104,0.000009669924,0.00002148705,0.002137115],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9118122,"threshold_uncertainty_score":0.304808,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02723798894730929,"score_gpt":0.2822941735064546,"score_spread":0.2550561845591453,"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."}}