{"id":"W2134676649","doi":"10.1080/00207160008804986","title":"A split-correct parallel algorithm for solving tridiagonal symmetric toeplitz systems","year":2000,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Tridiagonal matrix algorithm; Mathematics; Diagonally dominant matrix; Diagonal; Linear system; Algorithm; Applied mathematics; Levinson recursion; System of linear equations; Algebra over a field; Mathematical analysis; Pure mathematics; Eigenvalues and eigenvectors; Geometry; Invertible matrix","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.0007363219,0.0009582776,0.000701669,0.0007599537,0.0009224759,0.0007410305,0.001112449,0.000988643,0.005617942],"category_scores_gemma":[0.002457046,0.0005495007,0.0005263487,0.001035793,0.0007170619,0.001010843,0.001038715,0.001430221,0.00215329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004516814,"about_ca_system_score_gemma":0.001711422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005038107,"about_ca_topic_score_gemma":0.00689391,"domain_scores_codex":[0.999442,0.00008895376,0.00003003354,0.0000732011,0.0003062784,0.00005947871],"domain_scores_gemma":[0.9990729,0.0002312554,0.00005269937,0.0001567101,0.000440577,0.00004594277],"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.0005328158,0.0001783011,0.001028564,0.0002424153,0.0001066908,0.0003680674,0.0003335577,0.2430828,0.03334974,0.02872214,0.01069208,0.6813627],"study_design_scores_gemma":[0.00009567488,0.0001007832,0.0001600866,0.000009947262,0.0000171508,0.0001842577,0.00004227387,0.9685579,0.01433262,0.009503859,0.006973836,0.0000217263],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006496354,0.000101013,0.9908716,0.00009373128,0.00006571483,0.00005798296,0.00003267067,0.0009193817,0.001361491],"genre_scores_gemma":[0.060722,0.00009982332,0.9344549,0.00006722349,0.00003706473,0.0001565677,0.0001522195,0.0002068391,0.004103375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005617942,"threshold_uncertainty_score":0.01879388,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01633063061697472,"score_gpt":0.2645873229879092,"score_spread":0.2482566923709345,"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."}}