Wang-Elia Algorithm Overview

• Wang-Elia algorithm is a term that designates distinct procedures across fields, including residue-to-binary conversion, distributed consensus optimization, and Fourier-based Jacobi-form analysis.
• In residue number systems, it reformulates the classical Chinese Remainder Theorem using mixed-radix approaches and clarifies prior methodologies through Wang’s New CRT I.
• In distributed optimization, the algorithm employs decoupled state updates and Lyapunov-based stability to achieve linear convergence and robust input-to-state stability.

Searching arXiv for the cited papers and related usages of “Wang-Elia Algorithm.” The term Wang-Elia algorithm is used in more than one technical literature, and its meaning depends on context. In residue number systems, it denotes a residue-to-binary conversion method based on Wang’s New Chinese Remainder Theorem I, a formulation later analyzed as a restatement of an earlier CRT-based approach rather than a fundamentally new algorithm (0707.3732). In distributed optimization, it denotes an algorithm proposed in 2010 by J. Wang and N. Elia for distributed consensus optimization, in which each agent maintains a primal estimate and an auxiliary state; a Lyapunov-based analysis established input-to-state stability, linear convergence in the unperturbed case, and explicit links with Gradient Tracking and distributed integral control (Bin et al., 2022). A further usage appears in the literature on Weyl invariant $E_8$ Jacobi forms, where a “Wang-Elia Algorithm” is identified as a Fourier-expansion and Weyl-orbit method that is explicitly contrasted with a later purely algebraic construction (Sakai, 2022).

1. Terminological scope

The name does not designate a single universally fixed procedure across mathematics, signal processing, and control. Instead, the label attaches to distinct algorithmic objects associated with work by authors named Wang and Elia, and the surrounding literature treats these objects independently.

In the residue number system literature, the expression refers to the converter derived from Wang’s New CRT I formula for reconstructing an integer $X$ from residues modulo pairwise coprime moduli $\{P_1,\ldots,P_n\}$ (0707.3732). In distributed optimization, the same expression refers to a discrete-time networked algorithm for minimizing a sum of private convex costs over a shared decision variable, with communication over a connected, undirected graph (Bin et al., 2022). In the Jacobi-form literature, the term denotes yet another method, one based on Fourier expansion and analysis of Weyl orbits, and is used mainly as a point of comparison for a newer algebraic alternative (Sakai, 2022).

A central interpretive point is therefore lexical rather than mathematical: the phrase Wang-Elia algorithm is domain-specific. Any technical discussion requires immediate disambiguation by field.

2. Residue-to-binary conversion and Wang’s New CRT I

In residue number systems, an integer $X$ is represented by its residues $x_i$ modulo pairwise coprime moduli $P_i$, with $M=\prod_{j=1}^n P_j$. The underlying computational problem is efficient residue-to-binary conversion. The classical CRT reconstruction is written as

$$X = \left(\sum_{i=1}^n s_i \cdot \left(\left(\frac{1}{s_i}\right)_{P_i} x_i \right) \right) \bmod M,$$

where $s_i=M/P_i$ and $\left(\frac{1}{s_i}\right)_{P_i}$ is the inverse of $X$0 modulo $X$1 (0707.3732).

Wang’s New CRT I introduces the alternative expression

$X$2

with

$X$3

The so-called Wang-Elia algorithm for residue-to-binary conversion is based on this formula (0707.3732).

The relevant historical background includes Huang’s algorithm and the work of Hitz and Kaltofen. Huang proposed computing the CRT formula without modulo-$X$4 operations by representing terms

$X$5

in a mixed radix system through precomputed tables, at the cost of substantial storage and precomputation. Hitz and Kaltofen observed that, instead of large tables, one can precompute the mixed-radix representation of the constants $X$6 or $X$7, compute $X$8 modulo $X$9, and then evaluate the sum in mixed radix form using the precomputed digits. They also emphasized the “second form” of CRT,

$\{P_1,\ldots,P_n\}$0

This second form is the key comparator for later analysis of Wang’s formula (0707.3732).

3. Origin, equivalence, and originality claims in the RNS literature

Beuchat’s analysis establishes that Wang’s New CRT I is not a fundamentally new reconstruction principle. The paper shows that the formula is a rewriting of the second CRT form above and that the constants $\{P_1,\ldots,P_n\}$1 are merely the mixed radix digits of numbers congruent to $\{P_1,\ldots,P_n\}$2 modulo $\{P_1,\ldots,P_n\}$3 (0707.3732). On that basis, the Wang-Elia residue-to-binary method is characterized as a restatement, with minor technical differences, of an algorithmic interpretation already sketched by Hitz and Kaltofen.

The paper also corrects a specific claim by Ananda Mohan. Mohan had argued that Wang’s approach is the same as Huang’s and derivable from the constructive proof of the classical CRT. Beuchat states that this proof is erroneous. The correction is precise: Wang’s method does not use the mixed-radix conversion of the $\{P_1,\ldots,P_n\}$4 terms as Huang’s does; rather, it is a reformulation of the CRT-based approach connected to Hitz and Kaltofen’s second-form viewpoint (0707.3732).

This reassessment directly affects claims of originality. Wang had presented the method as substantially different from CRT and MRS approaches, but Beuchat argues that the proper historical placement is different: the formula is a different expression of a known technique rather than a new conversion algorithm. The practical implication given in the paper is that explicit computation of the $\{P_1,\ldots,P_n\}$5 constants is unnecessary, because the same result can be obtained through the CRT formulation together with available mixed-radix digit tables. The broader significance stated there is historiographic and engineering-oriented: clarifying the equivalence helps avoid redundant work and refines implementation choices in hardware residue-to-binary converters (0707.3732).

4. Distributed consensus optimization algorithm

In distributed optimization, the Wang-Elia algorithm addresses distributed consensus optimization with $\{P_1,\ldots,P_n\}$6 agents, each possessing a private convex function $\{P_1,\ldots,P_n\}$7. The collective objective is to minimize the sum of these costs over a shared decision variable $\{P_1,\ldots,P_n\}$8, using only local computation and communication over a connected, undirected graph (Bin et al., 2022).

Each agent $\{P_1,\ldots,P_n\}$9 maintains two scalar states: $X$0, the current estimate of the optimizer, and $X$1, an auxiliary variable. The perturbed update equations are

$X$2

where $X$3 denotes the neighbor set, $X$4 are symmetric weights, $X$5 is a stepsize, and $X$6 are additive perturbations modeling errors or uncertainty (Bin et al., 2022).

In aggregate form, with $X$7, $X$8, perturbations $X$9, Laplacian $x_i$0, and

$x_i$1

the dynamics become

$x_i$2

The functional interpretation given in the source is that the $x_i$3-update combines consensus forcing with local gradient descent, while the $x_i$4-update integrates disagreement among neighboring $x_i$5-variables so as to facilitate global consensus. A stated structural property is that no special initialization is required for either variable (Bin et al., 2022).

5. Stability, linear convergence, and relation to Gradient Tracking

The 2022 analysis of the distributed algorithm is Lyapunov-based and assumes that each $x_i$6 is smooth and that the aggregate objective $x_i$7 is strongly convex (Bin et al., 2022). The state is transformed into coordinates separating average and dispersion, and a composite Lyapunov function $x_i$8 is constructed to capture both the optimization error and the consensus error.

The main result is an input-to-state stability theorem relative to a closed invariant set of optimal equilibria. Specifically, for sufficiently small $x_i$9, there exist $P_i$0 such that every solution $P_i$1 of the perturbed system satisfies

$P_i$2

where $P_i$3 gives the linear decay rate and $P_i$4 quantify disturbance amplification (Bin et al., 2022). In the absence of perturbations, the result implies linear convergence of the local estimates and Lyapunov stability of the optimal steady state. Under bounded perturbations, the state remains bounded and close to the optimum, with a disturbance-dependent residual.

The same paper draws explicit comparisons with Gradient Tracking. A comparison update is written as

$P_i$5

with stochastic matrices $P_i$6 and $P_i$7, and this method requires $P_i$8 for convergence (Bin et al., 2022). The contrast emphasized there is structural: Wang-Elia’s $P_i$9-dynamics are described as “decoupled” and always filtered out in the $M=\prod_{j=1}^n P_j$0-update, making the method initialization-free and robust, whereas Gradient Tracking becomes fragile if the auxiliary variables are not carefully initialized. The paper further states that even small constant perturbations can cause divergence in Gradient Tracking, while Wang-Elia remains stable in the ISS sense. Both algorithms are also interpreted as forms of distributed PI control, with Wang-Elia implementing integral action distributively and robustly (Bin et al., 2022).

6. Other uses of the label and related algorithmic distinctions

A separate use of the expression appears in the theory of Weyl invariant $M=\prod_{j=1}^n P_j$1 Jacobi forms. In that literature, a later algebraic construction is explicitly said to be distinct from the Wang-Elia Algorithm, which is described as relying on Fourier expansion and analysis of Weyl orbits (Sakai, 2022). Sakai’s construction instead works inside the polynomial algebra

$M=\prod_{j=1}^n P_j$2

uses a necessary-and-sufficient algebraic criterion for holomorphicity, and does not require Fourier expansion. The paper states that a similar embedding of $M=\prod_{j=1}^n P_j$3 into a polynomial algebra had been considered in the earlier Wang-related work, but that its own theorem is stronger (Sakai, 2022).

This usage reinforces the broader terminological point that Wang-Elia algorithm is not a single cross-disciplinary object. In the RNS literature, the term is entangled with debates over CRT reformulation and originality; in distributed optimization, it names a two-state consensus algorithm with ISS and linear convergence guarantees; in the Jacobi-form literature, it denotes a Fourier/Weyl-orbit procedure that serves primarily as a benchmark for a newer algebraic method (0707.3732, Bin et al., 2022, Sakai, 2022).

A plausible implication is that citations of the term without field qualification are intrinsically ambiguous. For technical precision, the literature is best read as defining three context-bound referents: a residue-to-binary converter associated with Wang’s New CRT I, a distributed consensus optimization scheme due to J. Wang and N. Elia, and a Jacobi-form construction based on Fourier expansion and Weyl orbit analysis.