{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000656306,0.0003030697,0.0002693742,0.0005691635,0.0002002827,0.0003749868,0.0007788941,0.000138254,0.000009270488],"category_scores_gemma":[0.00007902501,0.0002994521,0.00005002646,0.0004069433,0.0001574956,0.0003955981,0.0003393702,0.0003944025,0.00001133924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001243155,"about_ca_system_score_gemma":0.0001928124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001387012,"about_ca_topic_score_gemma":0.000003523464,"domain_scores_codex":[0.9980223,0.000007456046,0.0003177025,0.0006286696,0.0006412542,0.0003826309],"domain_scores_gemma":[0.9990034,0.000427791,0.0001142934,0.0002080454,0.0001405821,0.0001058839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.342474e-7,0.000004800014,0.0000107637,0.00003303606,0.000004148862,0.00003057859,0.00007840485,0.8437666,0.00004155904,0.1300016,0.00001426074,0.02601337],"study_design_scores_gemma":[0.0001140216,0.00002431458,0.0003573628,0.0001747863,0.000004469377,0.00006383405,3.985667e-7,0.9360324,0.00004256109,0.06133416,0.001479784,0.0003719061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005390566,0.0006829345,0.987636,0.00029004,0.0003620845,0.0001370559,0.000004360538,0.0001468459,0.01020162],"genre_scores_gemma":[0.5176363,0.00002844693,0.4810755,0.0002919791,0.0004270358,0.000003128966,0.00001471732,0.00003586649,0.0004869848],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5170972,"threshold_uncertainty_score":0.9999458,"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."}}