{"id":"W2795999852","doi":"10.1051/m2an/2018048","title":"Nonintrusive approximation of parametrized limits of matrix power algorithms – application to matrix inverses and log-determinants","year":2018,"lang":"en","type":"article","venue":"ESAIM Mathematical Modelling and Numerical Analysis","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Interpolation (computer graphics); Inverse; Logarithm; Matrix (chemical analysis); Approximation error; Spouge's approximation; Approximation algorithm; Work (physics)","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.002597108,0.0008120419,0.0006010174,0.0009796708,0.0003504189,0.001666771,0.001426079,0.0009727839,0.00269476],"category_scores_gemma":[0.02427119,0.0004159374,0.0004969993,0.0006458198,0.001826862,0.003153789,0.002304784,0.001966884,0.0006979406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005827456,"about_ca_system_score_gemma":0.0005620508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005205388,"about_ca_topic_score_gemma":0.0005342336,"domain_scores_codex":[0.9986864,0.0005989764,0.00005504413,0.0001503488,0.0004391618,0.00007013694],"domain_scores_gemma":[0.9894091,0.007324983,0.0008195799,0.001606563,0.0006440991,0.0001955933],"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.0001623261,0.0001285324,0.001667468,0.0002899497,0.00005417129,0.0004321112,0.0005188387,0.4794462,0.01234166,0.433929,0.001244957,0.06978473],"study_design_scores_gemma":[0.000003136628,0.00001896017,0.0000908724,0.00001607276,0.000003253115,0.00007363495,0.00001244017,0.9581068,0.002797612,0.03811359,0.000755259,0.00000848359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01771559,0.0002540042,0.9794064,0.00009154684,0.00002623351,0.00001970331,0.00001517413,0.0002585952,0.002212759],"genre_scores_gemma":[0.5739277,0.0006857272,0.4189947,0.0001257421,0.00009359042,0.0001283429,0.0001138486,0.0005731441,0.005357116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00269476,"threshold_uncertainty_score":0.013735,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01749563750013142,"score_gpt":0.2873245517198812,"score_spread":0.2698289142197498,"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."}}