{"id":"W134793575","doi":"10.1007/3-540-28438-9_7","title":"Computing Sparse Jacobian Matrices Optimally","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Row; Matrix (chemical analysis); Sparse matrix; Computation; A priori and a posteriori; Row and column spaces; Algorithm; Mathematics; Computer science; Mathematical optimization; 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.0004416687,0.001475152,0.001501053,0.001038053,0.0007103511,0.001700584,0.001244432,0.001125432,0.02192191],"category_scores_gemma":[0.004533114,0.0007945843,0.0007329275,0.00182098,0.0006596209,0.002549308,0.001673142,0.001509048,0.006922279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005265649,"about_ca_system_score_gemma":0.001203007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003530001,"about_ca_topic_score_gemma":0.01002035,"domain_scores_codex":[0.9994318,0.00008396401,0.00003190904,0.0001370462,0.000230654,0.00008462416],"domain_scores_gemma":[0.9989114,0.0004975327,0.00005701636,0.0002624011,0.0002105051,0.00006108155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003805689,0.0002180562,0.0008309614,0.000393151,0.00009099884,0.0003122076,0.0001916801,0.1785192,0.02558352,0.04800237,0.04313764,0.7023395],"study_design_scores_gemma":[0.0001225777,0.0001338263,0.0003955001,0.00002872347,0.00004092411,0.0002239551,0.0001344718,0.8878559,0.01554853,0.08242023,0.01306983,0.00002555917],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02010996,0.0002618984,0.9619767,0.0003236015,0.0001890314,0.00008528558,0.0003306812,0.004197934,0.01252487],"genre_scores_gemma":[0.1814952,0.0004378853,0.7967408,0.0002256759,0.0002753334,0.0001439086,0.001818333,0.001303598,0.01755917],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02192191,"threshold_uncertainty_score":0.07333606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008076137272474655,"score_gpt":0.2140298548552145,"score_spread":0.2059537175827398,"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."}}