{"id":"W2149504570","doi":"10.1108/02644400310502973","title":"Subdomain cluster generation for domain decomposition methods using graph partitioning optimization","year":2003,"lang":"en","type":"article","venue":"Engineering Computations","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Domain decomposition methods; Graph partition; Computer science; Parallel computing; Decomposition; Cluster (spacecraft); Heuristic; Decomposition method (queueing theory); Software; Graph; Load balancing (electrical power); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Finite element method; Chemistry; Engineering; Programming language","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003650655,0.0001617501,0.0001419842,0.0002370639,0.0001733138,0.00008341823,0.00005210415,0.00008853138,0.00001255221],"category_scores_gemma":[0.00005198023,0.0002003807,0.00007815298,0.0002984824,0.00001027602,0.0002297854,0.000005281765,0.00008974816,0.000001524646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001090982,"about_ca_system_score_gemma":0.00001274571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001466347,"about_ca_topic_score_gemma":8.20614e-7,"domain_scores_codex":[0.9992047,0.00006301022,0.0002735227,0.0001632436,0.00007690567,0.0002186459],"domain_scores_gemma":[0.9995632,0.0001577595,0.00003265358,0.000119507,0.00006817887,0.00005865631],"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":[7.219874e-7,0.000009399463,0.000006244393,0.00002996817,0.00002348968,3.101029e-7,0.0001233693,0.9554561,0.03802687,0.005817262,0.0002305488,0.0002756884],"study_design_scores_gemma":[0.0002454437,0.00001958053,0.00001214611,0.00002610082,0.00002536779,0.00001475184,0.00001601644,0.9792103,0.01790743,0.001763844,0.0005370601,0.0002219305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01353571,0.0001523518,0.984651,0.0000141618,0.0003508989,0.0003946326,0.000008813589,0.0007698774,0.0001225873],"genre_scores_gemma":[0.2748886,0.000006147418,0.7247658,0.0000165808,0.00008495458,0.00009596936,0.00009364298,0.00004451517,0.000003780624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2613529,"threshold_uncertainty_score":0.8171287,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02363652411567258,"score_gpt":0.3066194756582761,"score_spread":0.2829829515426036,"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."}}