{"id":"W4255350394","doi":"10.1080/1063719021000042347","title":"A parallel divide and conquer algorithm for non symmetric tridiAgonal toeplitz systems using conjugate gradient","year":2002,"lang":"en","type":"article","venue":"Parallel algorithms and applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Tridiagonal matrix; Toeplitz matrix; Conjugate gradient method; Divide and conquer algorithms; Mathematics; Transpose; Diagonal; Tridiagonal matrix algorithm; Biconjugate gradient method; Band matrix; Matrix (chemical analysis); Positive-definite matrix; Algorithm; Complex conjugate; Symmetric matrix; Applied mathematics; Conjugate residual method; Computer science; Square matrix; Mathematical analysis; Pure mathematics; Gradient descent; Geometry; Eigenvalues and eigenvectors","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.0007114144,0.0009381893,0.001044045,0.0007554398,0.00104351,0.0008892793,0.001299102,0.001021247,0.005926797],"category_scores_gemma":[0.001381115,0.0004585683,0.0004159101,0.0009070954,0.0008429884,0.001089319,0.001081569,0.00109206,0.001285853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000773459,"about_ca_system_score_gemma":0.001562314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007089467,"about_ca_topic_score_gemma":0.01022347,"domain_scores_codex":[0.9996439,0.00007975511,0.00001848957,0.00007125772,0.000130264,0.00005633694],"domain_scores_gemma":[0.9994612,0.0002575041,0.00004571971,0.0000622864,0.0001337837,0.00003943924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006428808,0.0003211662,0.0008742636,0.0001756848,0.0001268089,0.000306245,0.0002885148,0.4119553,0.01752673,0.04160804,0.008959402,0.5172148],"study_design_scores_gemma":[0.00007502666,0.00003672195,0.00005001172,0.000002851015,0.000007051252,0.00003176211,0.00001957034,0.9898924,0.002458658,0.006159055,0.0012607,0.000006280659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01113517,0.0001173923,0.9860747,0.0001447937,0.00003531105,0.00006798041,0.00002004108,0.0009874655,0.001417109],"genre_scores_gemma":[0.09573749,0.00006801759,0.8999396,0.00007633492,0.00003953694,0.0001961173,0.00008103283,0.0001361077,0.003725868],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007089467,"threshold_uncertainty_score":0.01982707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02954920604552253,"score_gpt":0.2601528262754053,"score_spread":0.2306036202298828,"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."}}