Numerical Analysis and Testing of Efficient Ensemble Eddy Viscosity Algorithms for high-Reynolds-number Stochastic Flow Problems

preprint OA: closed
Full text JSON View at publisher
Full text 12,243 characters · extracted from preprint-html · click to expand
Numerical Analysis and Testing of Efficient Ensemble Eddy Viscosity Algorithms for high-Reynolds-number Stochastic Flow Problems | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Numerical Analysis and Testing of Efficient Ensemble Eddy Viscosity Algorithms for high-Reynolds-number Stochastic Flow Problems Brandiece N Berry, Md Mahmudul Islam, Muhammad Mohebujjaman, Neethu Suma Raveendran This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8437203/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract In this paper, we first propose a continuous Ensemble Eddy Viscosity (EEV) model for stochastic flow problems and then introduce a family of fully discrete, grad-div–regularized, efficient ensemble parameterized schemes for this model. The linearized Implicit-Explicit (IMEX) EEV generic algorithm shares a common coefficient matrix for each realization per time-step, but with different right-hand side vectors, which reduces the computational cost and memory requirements to the order of solving deterministic flow problems. Two family members of the proposed time-stepping algorithm are analyzed and proven to be stable. It is found that one is first-order and the other is second-order accurate in time for any stable finite element pairs. Avoiding the discrete inverse inequality, the optimal convergence of both schemes is proven rigorously for both 2D and 3D problems. For appropriately large grad-div parameters, both schemes are unconditionally stable and allow weakly divergence-free elements. The convergence rates are verified numerically using manufactured solutions with high expected Reynolds numbers E[Re]=103,104, 105 ,and 106. For various high E[Re], the schemes are implemented on benchmark problems and are found to perform well. These include a 2D channel flow over a unit step problem, a 2D channel flow past a cylinder problem, a 2D Regularized Lid-Driven Cavity (RLDC) problem examined using a non-intrusive Stochastic Collocation Method (SCM), and a 3D RLDC problem. High-Reynolds number uncertainty quantification fast ensemble calculation finite element method ensemble eddy viscosity stochastic flow problems Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8437203","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":569514627,"identity":"8e24f06d-b245-41f5-b5c0-27f9934dc608","order_by":0,"name":"Brandiece N Berry","email":"","orcid":"","institution":"University of Alabama at Birmingham","correspondingAuthor":false,"prefix":"","firstName":"Brandiece","middleName":"N","lastName":"Berry","suffix":""},{"id":569514628,"identity":"0657a6e2-9d3c-409d-a8c6-30ad4f4f7bb4","order_by":1,"name":"Md Mahmudul Islam","email":"","orcid":"","institution":"University of Alabama at Birmingham","correspondingAuthor":false,"prefix":"","firstName":"Md","middleName":"Mahmudul","lastName":"Islam","suffix":""},{"id":569514629,"identity":"f8ea919e-9b69-46cf-ad5c-c259a0f74059","order_by":2,"name":"Muhammad Mohebujjaman","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAtUlEQVRIiWNgGAWjYHACNgbGBgZmfhCDgYGZBC2SDaRqYTA4QKwW3WmHjz34uOMwu/GN5GcPGCqsExsIaTG7nZZuOPPMYWazG2nmBgxn0onRkmMmzdsG0pJgJsHYdphILX+BWoxnpH+TYPxHrBag4cwGEjlAWxqI0pKWJtl7Jp1Z4sybcoOEY+nGRGhJPibxc4d1Mn97+rYHH2qsZQlqgYFkMJlArHIQsCNF8SgYBaNgFIwwAADQbj8SLZp+ewAAAABJRU5ErkJggg==","orcid":"","institution":"University of Alabama at Birmingham","correspondingAuthor":true,"prefix":"","firstName":"Muhammad","middleName":"","lastName":"Mohebujjaman","suffix":""},{"id":569514630,"identity":"543c9e8f-6edf-4ff2-aa5e-670b106e5907","order_by":3,"name":"Neethu Suma Raveendran","email":"","orcid":"","institution":"University of Alabama at Birmingham","correspondingAuthor":false,"prefix":"","firstName":"Neethu","middleName":"Suma","lastName":"Raveendran","suffix":""}],"badges":[],"createdAt":"2025-12-23 21:38:28","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8437203/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8437203/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":99603938,"identity":"92383560-4680-4429-96f1-854e2acd5f0a","added_by":"auto","created_at":"2026-01-06 11:05:13","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":5466892,"visible":true,"origin":"","legend":"","description":"","filename":"Berry2025Numerical.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8437203/v1/738eebd83bc244c66b7d653e.pdf"},{"id":99603937,"identity":"56c0fe24-b46a-4359-9f22-88db1ecbab51","added_by":"auto","created_at":"2026-01-06 11:05:13","extension":"json","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":5844,"visible":true,"origin":"","legend":"","description":"","filename":"637690a1901d4ea19b9d76d0066d068f.json","url":"https://assets-eu.researchsquare.com/files/rs-8437203/v1/9611dc5117c979e4ac3b1eed.json"},{"id":108435974,"identity":"7a671094-f8dc-4093-afab-5b2bd259fc15","added_by":"auto","created_at":"2026-05-04 15:40:59","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":3036859,"visible":true,"origin":"","legend":"","description":"","filename":"NSEEEVFinal.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8437203/v1_covered_d651e3ef-83e9-442f-a804-25482218ce38.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Numerical Analysis and Testing of Efficient Ensemble Eddy Viscosity Algorithms for high-Reynolds-number Stochastic Flow Problems","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"High-Reynolds number, uncertainty quantification, fast ensemble calculation, finite element method, ensemble eddy viscosity, stochastic flow problems","lastPublishedDoi":"10.21203/rs.3.rs-8437203/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8437203/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"In this paper, we first propose a continuous Ensemble Eddy Viscosity (EEV) model for stochastic flow problems and then introduce a family of fully discrete, grad-div–regularized, efficient ensemble parameterized schemes for this model. The linearized Implicit-Explicit (IMEX) EEV generic algorithm shares a common coefficient matrix for each realization per time-step, but with different right-hand side vectors, which reduces the computational cost and memory requirements to the order of solving deterministic flow problems. Two family members of the proposed time-stepping algorithm are analyzed and proven to be stable. It is found that one is first-order and the other is second-order accurate in time for any stable finite element pairs. Avoiding the discrete inverse inequality, the optimal convergence of both schemes is proven rigorously for both 2D and 3D problems. For appropriately large grad-div parameters, both schemes are unconditionally stable and allow weakly divergence-free elements. The convergence rates are verified numerically using manufactured solutions with high expected Reynolds numbers E[Re]=103,104, 105 ,and 106. For various high E[Re], the schemes are implemented on benchmark problems and are found to perform well. These include a 2D channel flow over a unit step problem, a 2D channel flow past a cylinder problem, a 2D Regularized Lid-Driven Cavity (RLDC) problem examined using a non-intrusive Stochastic Collocation Method (SCM), and a 3D RLDC problem.","manuscriptTitle":"Numerical Analysis and Testing of Efficient Ensemble Eddy Viscosity Algorithms for high-Reynolds-number Stochastic Flow Problems","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-06 11:05:08","doi":"10.21203/rs.3.rs-8437203/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"3359435b-313a-4c02-9254-4d8d6bdb1928","owner":[],"postedDate":"January 6th, 2026","published":true,"recentEditorialEvents":[{"type":"decision","content":"Rejected","date":"2026-05-04T15:36:13+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-04-30T19:02:16+00:00","index":11,"fulltext":""}],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-05-04T15:40:30+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-06 11:05:08","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8437203","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8437203","identity":"rs-8437203","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00