{"id":"W2083836337","doi":"10.1016/s0096-3003(01)00098-4","title":"Highly efficient parallel algorithm for finite difference solution to Navier–Stoke's equation on a hypercube","year":2002,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Tridiagonal matrix; Tridiagonal matrix algorithm; Hypercube; Discretization; Generalization; Computation; Mathematics; Matrix (chemical analysis); Algorithm; Band matrix; Finite difference method; Reduction (mathematics); Finite difference; Applied mathematics; Parallel computing; Computer science; Mathematical analysis; Discrete mathematics; Symmetric matrix; Geometry; Square matrix; Physics; Eigenvalues and eigenvectors","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002765273,0.0001711813,0.0001996751,0.000113646,0.0002343571,0.0001696892,0.0002591685,0.00005807146,0.000003698013],"category_scores_gemma":[0.00002525864,0.0001557645,0.00004274316,0.0002205109,0.00002116988,0.00006246243,0.0001092789,0.00007032789,0.00006890887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003346247,"about_ca_system_score_gemma":0.00000725974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001347806,"about_ca_topic_score_gemma":1.961007e-7,"domain_scores_codex":[0.9988736,0.00001486319,0.0002784464,0.0003495053,0.0002564832,0.0002271385],"domain_scores_gemma":[0.9991004,0.0003737012,0.000121653,0.0002430274,0.00006686464,0.00009433269],"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.000005385928,0.000218634,1.162617e-7,0.0000425112,0.00001277839,8.713066e-7,0.001829572,0.01502486,0.000506867,0.3089319,0.0001200545,0.6733064],"study_design_scores_gemma":[0.0004306638,0.0001615062,0.00001582558,0.00002952679,0.0000141737,0.000004080656,0.00003570791,0.9092414,0.0003008076,0.08949687,0.00009004988,0.0001793425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0102137,0.0000248827,0.9877081,0.0005045093,0.0001324164,0.0007068743,0.000007701407,0.0001182011,0.0005836439],"genre_scores_gemma":[0.2918804,0.000008398442,0.7075818,0.0002433609,0.00004859302,0.0001491997,0.00001141917,0.00001079512,0.00006603613],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8942166,"threshold_uncertainty_score":0.635189,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03372380291306331,"score_gpt":0.2482052198847875,"score_spread":0.2144814169717242,"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."}}