{"id":"W2561160224","doi":"10.1016/j.cma.2016.12.023","title":"Approximation of constrained problems using the PGD method with application to pure Neumann problems","year":2016,"lang":"en","type":"article","venue":"Computer Methods in Applied Mechanics and Engineering","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; King Abdullah University of Science and Technology","keywords":"Constraint (computer-aided design); Mathematics; Mathematical optimization; Affine transformation; Applied mathematics; Von Neumann architecture; Theory of computation; Decomposition method (queueing theory); Decomposition; Computer science; Algorithm; Pure mathematics; Discrete mathematics; Geometry","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.001902105,0.0001752313,0.0002497443,0.0001525202,0.00005262932,0.00005346912,0.0004249169,0.00006542359,7.350773e-7],"category_scores_gemma":[0.00001159135,0.0001062916,0.00002544972,0.0004982597,0.00001232836,0.0001056605,0.0002275961,0.0001133967,3.907492e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002799599,"about_ca_system_score_gemma":0.00001981889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002454723,"about_ca_topic_score_gemma":5.513538e-7,"domain_scores_codex":[0.9988685,0.00008613957,0.0003029891,0.0003739528,0.0001373606,0.0002310746],"domain_scores_gemma":[0.9990948,0.000281464,0.0001137453,0.0004011257,0.00004137469,0.00006751312],"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.000003145171,0.00001148938,7.040945e-7,0.0000776677,0.00001033476,2.559877e-7,0.0004027312,0.08035426,0.1540962,0.523412,5.343529e-7,0.2416307],"study_design_scores_gemma":[0.0002956857,0.00004600397,0.000005365315,0.0001148039,0.00000697958,0.00001853554,0.00001292906,0.9450206,0.01730154,0.03674674,0.0002670515,0.0001638006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005720845,0.00003268229,0.9983276,0.0001522989,0.0001109149,0.0006906454,0.000001240459,0.0000805931,0.00003198373],"genre_scores_gemma":[0.0498505,0.00000671648,0.9499393,0.00003743702,0.00004300962,0.0001049901,4.74832e-7,0.00001533808,0.000002211589],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8646663,"threshold_uncertainty_score":0.4334444,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01676918746264881,"score_gpt":0.2716168675813608,"score_spread":0.254847680118712,"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."}}