{"id":"W2137074890","doi":"10.1109/icppw.2000.869116","title":"Data distribution and communication schemes for IQMR method on massively distributed memory computers","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Massively parallel; Computer science; Distributed memory; Lanczos resampling; Parallel computing; Block (permutation group theory); Computation; Algorithm; Time complexity; Matrix (chemical analysis); Shared memory; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0006257521,0.0001215012,0.0001426762,0.00003112241,0.0002575812,0.0001688339,0.00128956,0.00005196347,0.00002164967],"category_scores_gemma":[0.0001093853,0.0001046773,0.00002931796,0.0001740343,0.00005354366,0.0005474573,0.0006356716,0.00009740977,0.00001331462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002480943,"about_ca_system_score_gemma":0.000007506036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005261232,"about_ca_topic_score_gemma":0.000001174225,"domain_scores_codex":[0.9989552,0.0001568862,0.0001833401,0.0003924664,0.0001285043,0.0001835287],"domain_scores_gemma":[0.9979007,0.000620678,0.00009015519,0.001252087,0.00005963209,0.00007675445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001279577,0.0001263353,0.0000115471,0.00002651513,0.00003150884,0.000001573627,0.00009107134,0.00005850681,0.00006947264,0.6156761,0.03361651,0.3502781],"study_design_scores_gemma":[0.0005050605,0.00006729271,0.0001308014,0.00001940038,0.000009660244,0.000008971559,0.00002668296,0.9193735,0.001223573,0.0082212,0.07025199,0.0001618725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003121497,0.0001340541,0.9943824,0.003699166,0.0001039057,0.000241457,0.0005587495,0.0001566155,0.0004114808],"genre_scores_gemma":[0.1255169,0.00008158056,0.8717037,0.0005302019,0.00006642751,0.00002792442,0.001632517,0.0000096306,0.0004310975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.919315,"threshold_uncertainty_score":0.4268617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05732449564394215,"score_gpt":0.3056527401806144,"score_spread":0.2483282445366722,"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."}}