Selected work

Representative Papers

Parameter unbounded Uzawa and penalty-splitted accelerated algorithms for frictionless contact problems

Mar 12, 2026

This work addresses the slow convergence and high sensitivity to penalty or augmentation parameters that plague conventional splitting iterative methods for frictionless contact problems. To overcome these limitations, the authors propose a two-step displacement–contact force splitting strategy that integrates the Uzawa algorithm with penalty-operator splitting and incorporates Crossed-Secant fixed-point acceleration. The method requires only repeated solves with the standard stiffness matrix and, for the first time, achieves efficient convergence without bounds on algorithmic parameters—thereby eliminating the stringent parameter restrictions inherent in traditional approaches. Numerical experiments on both academic and industrial three-dimensional contact examples demonstrate significantly accelerated convergence, confirming the method’s efficiency and robustness.

0 citationsRead paper

Compression with Privacy-Preserving Random Access

Nov 18, 2025

This work addresses the joint design of lossless compression and privacy for binary i.i.d. sources, under the requirement that decoding any single bit must reveal no information about the remaining bits—termed *perfect-privacy random access*. We propose an information-theoretic random coding framework that constructs conditionally independent codebooks to simultaneously guarantee lossless reconstruction and strong privacy. We prove that, for any compression rate strictly above the source entropy rate, both lossless compression and perfect-privacy random access are achievable—establishing the entropy rate as the fundamental limit (i.e., the minimum achievable rate under the privacy constraint). This is the first rigorous information-theoretic characterization demonstrating that perfect-privacy random access is feasible at rates arbitrarily close to, yet above, the entropy rate, thereby achieving optimal trade-offs between compression efficiency and formal privacy guarantees.

0 citationsRead paper

Recent publications

Latest Papers

Parameter unbounded Uzawa and penalty-splitted accelerated algorithms for frictionless contact problems

Mar 12, 2026

This work addresses the slow convergence and high sensitivity to penalty or augmentation parameters that plague conventional splitting iterative methods for frictionless contact problems. To overcome these limitations, the authors propose a two-step displacement–contact force splitting strategy that integrates the Uzawa algorithm with penalty-operator splitting and incorporates Crossed-Secant fixed-point acceleration. The method requires only repeated solves with the standard stiffness matrix and, for the first time, achieves efficient convergence without bounds on algorithmic parameters—thereby eliminating the stringent parameter restrictions inherent in traditional approaches. Numerical experiments on both academic and industrial three-dimensional contact examples demonstrate significantly accelerated convergence, confirming the method’s efficiency and robustness.

0 citationsRead paper

Compression with Privacy-Preserving Random Access

Nov 18, 2025

This work addresses the joint design of lossless compression and privacy for binary i.i.d. sources, under the requirement that decoding any single bit must reveal no information about the remaining bits—termed *perfect-privacy random access*. We propose an information-theoretic random coding framework that constructs conditionally independent codebooks to simultaneously guarantee lossless reconstruction and strong privacy. We prove that, for any compression rate strictly above the source entropy rate, both lossless compression and perfect-privacy random access are achievable—establishing the entropy rate as the fundamental limit (i.e., the minimum achievable rate under the privacy constraint). This is the first rigorous information-theoretic characterization demonstrating that perfect-privacy random access is feasible at rates arbitrarily close to, yet above, the entropy rate, thereby achieving optimal trade-offs between compression efficiency and formal privacy guarantees.

0 citationsRead paper