Searcharxiv⌕ Search

arXiv subjects

He Jian

Publications and source records attributed to He Jian.

2 recordsLinked to original sources

FastAgent: A Physics-Aware FastFluent-to-Fluent Workflow for Rapid CFD Screening and Industrial Steam Dewaxing Design

Industrial computational fluid dynamics (CFD) becomes costly when complex geometries, long transients and coupled physics must be evaluated across large design spaces. We introduce FastAgent, a physics-aware campaign controller built around FastFluent, a lightweight numerical engine for rapid physical screening. FastFluent supplies stage-specific fields and diagnostics; FastAgent allocates physical models, numerical resolution and simulation horizons by the active quantities of interest (QoIs), while returned Fluent discrepancies update subsequent decisions. Across six public CFD benchmark campaigns, the framework reduces normalised worst-QoI error by 5.68-99.14% and accelerates decision-relevant computation by factors of 1.53-15.36 relative to a matched Generic Agent control. Applied to high-pressure steam dewaxing in investment casting, FastAgent identifies nonuniform condensation heating as the dominant startup mechanism and separates rapid risk-window localisation from high-fidelity melt-completion confirmation. The rapid route requires 81.39% fewer cell-time updates than a fine-grid, small-time-step reference. Structural analysis localises fracture at the observed blade edge. Screening 131,072 outlet layouts and selectively evaluating candidates with Fluent and Abaqus identifies Sparse-6, which reduces simulated crack opening by 96.0% and connected crack extent by 66.7% relative to the Original design. These results demonstrate how rapid numerical evidence and adaptive fidelity control connect large CFD search spaces to mechanism-guided industrial design.

cs.AI↗

Iterative Complexity and Its Applications of Linearized Generalized Alternating Direction Method of Multipliers with Multi-block Case

We consider a multi-block separable convex optimization problem with the linear constraints, where the objective function is the sum of m individual convex functions without overlapping variables. The linearized version of the generalized alternating direction method of multipliers (L-GADMM) is particularly efficient for the two-block separable convex programming problem and its convergence was proved when two blocks of variables are alternatively updated. However,the convergence and some practical applications of the extension (m>=3) of the L-GADMM is still in its infancy. In this paper, we extend this algorithm to the general case where the objective function consists of the sum of m-block convex functions. Theoretically, we prove global convergence of the new method and establish the worst-case convergence rate in the ergodic and nonergodic senses for the proposed algorithm. The efficiency of the new method is further demonstrated through numerical results on the calibration of the correlation matrices.

math.OC↗