{"id":"W2165984696","doi":"10.1109/padsw.2000.884679","title":"Estimating the parallel performance of IQMR method for unsymmetric large and sparse linear systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Hypercube; Computer science; Network topology; Parallel algorithm; Intel iPSC; Algorithm; Routing (electronic design automation); Computation; Stability (learning theory); Sparse matrix; Binary tree; Parallel computing; Topology (electrical circuits); Mathematics","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.001516906,0.0004939364,0.0004433526,0.0004701573,0.0002966919,0.0002893776,0.0007243431,0.0004826355,0.001109701],"category_scores_gemma":[0.006880366,0.0002148445,0.0002283255,0.0006799427,0.0005321651,0.0009027562,0.0003880289,0.0004551105,0.0003246274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003048913,"about_ca_system_score_gemma":0.0005386319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002203206,"about_ca_topic_score_gemma":0.001698539,"domain_scores_codex":[0.999501,0.0002094026,0.00002190768,0.00005901831,0.0001569188,0.00005171623],"domain_scores_gemma":[0.9970487,0.001772917,0.0001955446,0.0004797572,0.0004485492,0.00005461093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009184417,0.0001710952,0.006196231,0.0002777709,0.00007923954,0.0001864497,0.0001946689,0.8404238,0.04338289,0.01152304,0.001342939,0.09530338],"study_design_scores_gemma":[0.00001720585,0.00006972689,0.000542434,0.000001724948,0.000004037344,0.00002122215,0.00001062788,0.9925041,0.00592939,0.0007432349,0.0001513647,0.000004980911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4502633,0.0004314868,0.5438325,0.0002080397,0.000042405,0.00008043103,0.0001183407,0.001624461,0.003398945],"genre_scores_gemma":[0.6997021,0.0001644318,0.2988474,0.00002200266,0.00002471222,0.00007263742,0.0002376258,0.0001120206,0.000817037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002203206,"threshold_uncertainty_score":0.008022249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03120271677974931,"score_gpt":0.2757062467510211,"score_spread":0.2445035299712718,"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."}}