{"id":"W1968250174","doi":"10.1137/040620047","title":"A Multipreconditioned Conjugate Gradient Algorithm","year":2006,"lang":"en","type":"article","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Preconditioner; Mathematics; Derivation of the conjugate gradient method; Conjugate residual method; Algorithm; Positive-definite matrix; Generalization; Matrix (chemical analysis); Nonlinear conjugate gradient method; Applied mathematics; Biconjugate gradient method; Linear system; Block (permutation group theory); Cholesky decomposition; Gradient method; Conjugate; Domain decomposition methods; Relation (database); Coefficient matrix; Gradient descent; Computer science; Iterative method; Combinatorics; Mathematical analysis; Eigenvalues and eigenvectors; Finite element method; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035067,0.000705038,0.001078412,0.0005978958,0.0004491131,0.0009240672,0.001744059,0.001370735,0.007382967],"category_scores_gemma":[0.001811196,0.0005908914,0.0006782389,0.0007016971,0.0006979151,0.001267325,0.001645596,0.001515192,0.003183894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004628482,"about_ca_system_score_gemma":0.001547366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001958551,"about_ca_topic_score_gemma":0.002571405,"domain_scores_codex":[0.9993598,0.000172021,0.000035408,0.0001105602,0.000266236,0.00005605194],"domain_scores_gemma":[0.9992982,0.0001755643,0.00004454419,0.0001545264,0.0002681109,0.00005894155],"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":[0.0002159135,0.0001504298,0.0005985412,0.0001898706,0.00009411306,0.0002428747,0.0001153863,0.5225598,0.02076042,0.08305053,0.01269495,0.3593271],"study_design_scores_gemma":[0.00002895474,0.00002738354,0.00005594158,0.000006935868,0.000006287141,0.00004613339,0.000004732676,0.9841858,0.003063847,0.007982844,0.004580189,0.00001092128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001578866,0.00005014488,0.9966741,0.00006382449,0.00005309195,0.00003898942,0.00003130412,0.0003713835,0.001138413],"genre_scores_gemma":[0.03949752,0.0001020351,0.9540662,0.0001241749,0.00005669552,0.0001764046,0.0001604512,0.0001845713,0.005631927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007382967,"threshold_uncertainty_score":0.02469844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005290628705126683,"score_gpt":0.2455948881573417,"score_spread":0.240304259452215,"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."}}