{"id":"W4281666975","doi":"10.1007/s10107-022-01860-1","title":"Exact computation of an error bound for the balanced linear complementarity problem with unique solution","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Invertible matrix; Upper and lower bounds; Computation; Complementarity (molecular biology); Linear complementarity problem; Regular polygon; Diagonal; Inverse; Norm (philosophy); Combinatorics; Applied mathematics; Discrete mathematics; Algorithm; Pure mathematics; Nonlinear system; Mathematical analysis","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.003527228,0.001431838,0.001621219,0.001314374,0.0009405485,0.002401329,0.001655261,0.002563242,0.008079605],"category_scores_gemma":[0.01976705,0.000854252,0.0008449028,0.001123998,0.001778175,0.00287128,0.003890038,0.003201581,0.0009971068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00201125,"about_ca_system_score_gemma":0.002616054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003864446,"about_ca_topic_score_gemma":0.004386702,"domain_scores_codex":[0.9985405,0.0004296268,0.00004832717,0.0002261989,0.0005584244,0.0001969901],"domain_scores_gemma":[0.9918193,0.006254782,0.0003072859,0.0004579871,0.0009115546,0.0002491201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002552311,0.0001228728,0.0004964474,0.0003344133,0.00006645484,0.000100071,0.0001824702,0.739597,0.004668849,0.1893864,0.004567632,0.06022223],"study_design_scores_gemma":[0.00001009816,0.00001787595,0.00006357102,0.00002414688,0.000005323401,0.00001452786,0.00001925258,0.9673792,0.0007875111,0.03108608,0.0005829203,0.000009481937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0136378,0.0004095593,0.978933,0.0004606831,0.0001778107,0.00003122662,0.00005893024,0.0002318368,0.006059198],"genre_scores_gemma":[0.5069003,0.0004880117,0.4817375,0.0003943809,0.0001837895,0.0003026826,0.0002800972,0.0005963123,0.009116972],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008079605,"threshold_uncertainty_score":0.02702904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03566716938258509,"score_gpt":0.3066046922125326,"score_spread":0.2709375228299475,"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."}}