Search arXivSearch

arXiv · 2204.00371

A Robin-Neumann Scheme with Quasi-Newton Acceleration for Partitioned Fluid-Structure Interaction

Abstract

The Dirichlet-Neumann scheme is the most common partitioned algorithm for fluid-structure interaction (FSI) and offers high flexibility concerning the solvers employed for the two subproblems. Nevertheless, it is not without shortcomings: to begin with, the inherent added-mass effect often destabilizes the numerical solution severely. Moreover, the Dirichlet-Neumann scheme cannot be applied to FSI problems in which an incompressible fluid is fully enclosed by Dirichlet boundaries, as it is incapable of satisfying the volume constraint. In the last decade, interface quasi-Newton methods have proven to control the added-mass effect and substantially speed up convergence by adding a Newton-like update step to the Dirichlet-Neumann coupling. They are, however, without effect on the incompressibility dilemma. As an alternative, the Robin-Neumann scheme generalizes the fluid's boundary condition to a Robin condition by including the Cauchy stresses. While this modification in fact successfully tackles both drawbacks of the Dirichlet-Neumann approach, the price to be paid is a strong dependency on the Robin weighting parameter, with very limited a priori knowledge about good choices. This work proposes a strategy to merge these two ideas and benefit from their combined strengths. The resulting quasi-Newton-accelerated Robin-Neumann scheme is compared to both Robin- and Dirichlet-Neumann variants. The numerical tests demonstrate that it does not only provide faster convergence, but also massively reduces the influence of the Robin parameter, mitigating the main drawback of the Robin-Neumann algorithm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Spenke, Michel Make, Norbert Hosters. 2022-11-14. A Robin-Neumann Scheme with Quasi-Newton Acceleration for Partitioned Fluid-Structure Interaction. https://doi.org/10.1002/nme.7151

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