Chohong Min

Gangjoon Yoon, Chohong Min, Seick Kim

Fluid-solid interaction has been a challenging subject due to their strong nonlinearity and multidisciplinary nature. Many of the numerical methods for solving FSI problems have struggled with non-convergence and numerical instability. In spite of comprehensive studies, it has been still a challenge to develop a method that guarantees both convergence and stability. Our discussion in this work is restricted to the interaction of viscous incompressible fluid flow and a rigid body. We take the monolithic approach by Gibou and Min that results in an extended Hodge projection. The projection updates not only the fluid vector field but also the solid velocities. We derive the equivalence of the extended Hodge projection to the Poisson equation with non-local Robin boundary condition. We prove the existence, uniqueness, and regularity for the weak solution of the Poisson equation, through which the Hodge projection is shown to be unique and orthogonal. Also, we show the stability of the projection in a sense that the projection does not increase the total kinetic energy of fluid and solid. Also, we discusse a numerical method as a discrete analogue to the Hodge projection, then we show that the unique decomposition and orthogonality also hold in the discrete setting. As one of our main results, we prove that the numerical solution is convergent with at least the first order accuracy. We carry out numerical experiments in two and three dimensions, which validate our analysis and arguments.

Donghwan Rho, Sieun Seo, Hyewon Sung et al.

As users increasingly interact with large language models (LLMs) using private information, secure and encrypted communication becomes essential. Homomorphic encryption (HE) provides a principled solution by enabling computation directly on encrypted data. Although prior work has explored aspects of running LLMs under HE, the challenge of text generation, particularly next-token prediction, has received limited attention and remains a key obstacle to practical encrypted interaction. In this work, we propose a TSP-based token reordering strategy to address the difficulties of encrypted text generation, together with a post-processing step that further reduces approximation error. Theoretical analysis and experimental results demonstrate that our method prevents collapse, improves coherence in generated text, and preserves data privacy throughout. Overall, our contributions advance the feasibility of practical and privacy-preserving LLM inference.