{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000462683,0.0003395779,0.0004436751,0.0002270695,0.000678169,0.0004225121,0.0004671378,0.0001250509,0.000009767356],"category_scores_gemma":[0.00001703935,0.000313188,0.0001050312,0.0005704588,0.0001676128,0.0004043918,0.0002133132,0.0001697184,0.0000226853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004310961,"about_ca_system_score_gemma":0.00002612493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007598074,"about_ca_topic_score_gemma":0.000001098194,"domain_scores_codex":[0.9977848,0.00006591238,0.0005056223,0.000835713,0.0002526688,0.0005552722],"domain_scores_gemma":[0.9983951,0.0003614169,0.0002154575,0.0005270392,0.0001582342,0.0003427173],"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.000007661918,0.0003089668,0.0000442821,0.000118642,0.0001177741,0.000008213941,0.0003331719,0.0008749604,0.00009944654,0.4261859,0.0006239083,0.571277],"study_design_scores_gemma":[0.001332305,0.0001095771,0.0000983205,0.00002473677,0.00004781289,0.0001272966,0.0000492417,0.9423456,0.00001921816,0.01435233,0.04107183,0.0004217858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000516485,0.005674728,0.990887,0.0004448738,0.0001808177,0.001735198,0.0001498034,0.00013602,0.0002750525],"genre_scores_gemma":[0.04366392,0.002166298,0.9470012,0.000365592,0.00102601,0.003505553,0.00006532107,0.00006736762,0.002138796],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9414706,"threshold_uncertainty_score":0.999932,"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."}}