Search arXivSearch

arXiv · 1910.09315

A parallel dynamic overset grid framework for immersed boundary methods

Abstract

A parallel dynamic overset framework has been developed for the curvilinear immersed boundary (overset-CURVIB) method to enable tackling a wide range of challenging flow problems. The dynamic overset grids are used to locally increase the grid resolution near complex immersed bodies, which are handled using a sharp interface immersed boundary method, undergoing large movements as well as arbitrary relative motions. The new framework extends the previous overset-CURVIB method with fixed overset grids and a sequential grid assembly to moving overset grids with an efficient parallel grid assembly. In addition, a new method for the interpolation of variables at the grid boundaries is developed which can drastically decrease the execution time and increase the parallel efficiency of our framework compared to the previous strategy. The moving/rotating overset grids are solved in a non-inertial frame of reference to avoid recalculating the curvilinear metrics of transformation while the background/stationary grids are solved in the inertial frame. The new framework is verified and validated against experimental data, and analytical/benchmark solutions. In addition, the results of the overset grid are compared with results over a similar single grid. The method is shown to be 2nd order accurate, decrease the computational cost relative to a single grid, and good overall parallel speedup. The grid assembly takes less than 7% of the total CPU time even at the highest number of CPUs tested in this work. The capabilities of our method are demonstrated by simulating the flow past a school of self-propelled aquatic swimmers arranged initially in a diamond pattern.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammadali Hedayat, Iman Borazjani. 2019-10-13. A parallel dynamic overset grid framework for immersed boundary methods. https://arxiv.org/abs/1910.09315

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Cosm: Collective switched motion for sparse Ising optimization

We introduce Collective Switched Motion (Cosm), a heuristic optimization framework based on switched collective dynamics. Cosm compiles the objective into subobjectives that are activated sequentially, temporally separating competing local influences. The interplay of switching and local interactions among variables gives rise to collective search behavior, while a new correlated perturbation mechanism encourages coordinated cluster motion. Tests on tuned-hardness spin-glass benchmarks suggest more favorable algorithmic scaling than that reported for leading dynamical solvers. Cosm heuristically attains the certified optima of three of the largest Gset instances (G72, G77, G81), exceeding the previously reported heuristic solutions. On the large random-graph instances G61 and G70, a CPU implementation reliably attains the best-known solutions, reaching cuts of 5799 and 9595 with 99%-confidence times-to-target of 15 s and 2.4 s, respectively. On the heterogeneous-degree G64 instance, Cosm establishes a new best-known cut of 8753. Broadly, the results suggest an alternative approach to heuristic design in which local dynamics and orchestration mechanisms are carefully designed so that effective search emerges.

cs.CE

Decomposing Firm-Level Crisis Responses from Incomplete Market Signals: Evidence from China's IT Sector During COVID-19

Exogenous shocks generate heterogeneous behavioral responses across firms, yet event studies typically report only sector-level averages. This paper develops a multi-method approach combining causal identification (difference-in-differences with cluster-robust inference), unsupervised behavioral discovery (K-means trajectory clustering, Gaussian hidden Markov models), and cross-sectional resilience prediction (logistic regression with nested cross-validation) to decompose firm-level response heterogeneity from noisy market signals. We demonstrate the approach on 246 Chinese A-share IT firms (216 with complete data for all analyses) during the COVID-19 shock (January 2020), using 252 non-IT CSI 300 firms as controls. The return decline was market-wide, not IT-specific (DID p = 0.59); the IT-specific effect was elevated volatility (DID beta = 0.043, cluster-robust p < 0.001), with the effect surviving Benjamini-Hochberg correction in 13 of 30 alternative specifications. Unsupervised clustering produced three trajectory groups: fast recovery (36 companies, +29.7%), resilient/moderate (67 companies), and persistent drag (113 companies, -6.9%). Pre-crisis financial fundamentals showed only modest predictive power for resilience (nested CV AUC = 0.635, 95% CI: 0.558-0.711; permutation p = 0.016), consistent with the limited informativeness of publicly available signals for anticipating crisis outcomes. The combination of causal analysis, unsupervised learning, and prediction represents a reproducible framework which can be applied to crises in other market periods.

cs.CE

An Insurance Broker for Every Small Business: The Economics of Exceptional Care at Scale

Small-business owners need expert guidance on their own terms, across schedules, languages, and channels, but low premiums make exceptional, continuous human service uneconomic for much of the market. Combining public evidence, Kinro operational data, and an illustrative five-year service model, we show why traditional brokerage economics leave 35 million U.S. small businesses underserved. An AI-native brokerage can change those economics by performing and coordinating routine work continuously, while licensed professionals govern consequential exceptions and the brokerage remains accountable.

cs.CE