A Family of Orthogonal Iteration Methods for Tracing the Nonlinear Equilibrium Path of Structures

Abstract

Nonlinear structural analysis serves as a fundamental tool for accurately predicting structural bearing capacity and ultimate strength. The incremental-iterative solution scheme represents the prevailing methodology for tracing nonlinear load–displacement responses and is implemented in most commercial finite element software. To enhance the robustness and computational efficiency of existing schemes, this paper first revisits the incremental-iterative framework, providing a detailed analysis that clarifies the distinct roles of the load increment factor in the predictor and corrector phases. Subsequently, a novel framework of updated orthogonal iterative schemes (UOIS) is established. Within this framework, the current generalized stiffness parameter (CGSP) and a cumulative indicator $S_i$ are introduced in the predictor phase to adaptively control the magnitude and sign of the load increment, respectively. In the corrector phase, four enhanced orthogonal iteration strategies are formulated. Furthermore, to improve computational efficiency, a novel acceleration strategy is proposed, which embeds a secant prediction operator in the predictor phase, thereby circumventing the costly assembly and inversion of the tangent stiffness matrix. The results demonstrate that: (1) compared to the conventional generalized stiffness parameter (GSP), the proposed CGSP exhibits superior stability in tracking stiffness variations, offering a more reliable indicator for adaptive step-size control; (2) the cumulative indicator $S_i$ reliably identifies load limit points and accurately distinguishes between loading and unloading regimes; (3) the UOIS framework demonstrates strong convergence in tracing complex equilibrium paths with multiple critical points and exhibits significantly superior robustness under large increment sizes compared to the generalized displacement control method (GDCM); and (4) the secant-prediction acceleration strategy achieves substantial improvements in computational efficiency without compromising solution accuracy.

1. Introduction

Building structures often exhibit nonlinear mechanical behavior under external actions during construction and service, primarily in the form of geometric and material nonlinearity. Geometric nonlinearity, resulting from significant shape changes such as large rotations of structural components, necessitates the introduction of a geometric stiffness matrix in analysis. Material nonlinearity stems from the material’s inherent nonlinear constitutive behavior, as seen in the elastic-plastic response of jointed pipelines [1] and the mechanical behavior of snow under compression [2]. Therefore, an accurate assessment of structural bearing capacity relies on a robust nonlinear analysis. Consequently, the development of efficient, stable, and accurate numerical techniques for solving structural nonlinear problems remains a central research objective [3,4,5,6]. Under loading, a structure may undergo stiffness softening or hardening, follow stable or unstable equilibrium paths, and transition between loading and unloading states. A characteristic feature of such complex behavior is the emergence of critical points, such as limit (load) points and snap-back (displacement) points on the load–displacement curve. This is particularly evident in buckling and post-buckling analysis, where equilibrium paths may contain multiple limit and snap-back points. Reliably tracing these paths, especially near critical points, poses a significant challenge and stringently tests the stability of any nonlinear solution algorithm.

The earliest approach for tracing nonlinear equilibrium paths is the pure incremental method [7], which embodies the fundamental concept of incremental analysis. It divides the loading process into a series of sufficiently small steps, linearizing the problem within each step. However, as the solution progresses, results from this method tend to drift from the true equilibrium path because equilibrium is not enforced within each step, allowing errors to accumulate. To ensure reliability, iterative corrections are performed within each load step until equilibrium is satisfied to a specified tolerance. This forms the basis of the now widely used incremental-iterative framework [7,8]. Early implementations within this framework are the load control and displacement control methods. Both exhibit clear limitations near critical points, as they control only the load or the displacement, respectively.

To overcome numerical divergence near critical points, Wempner [9] and Riks [10,11] independently proposed the arc-length method, which simultaneously controls load and displacement by constraining the iterative step to a constant arc length. This method is effective for tracing paths with multiple critical points. Subsequent research has yielded various improvements: Crisfield [12] developed a cylindrical arc-length method; Bouwer et al. [13] proposed automatic arc-length adjustment based on structural state optimization; Pretti et al. [14] devised a displacement-controlled arc-length method for structures with non-zero displacement constraints; and Gavin et al. [15] combined arc-length control with the material point method to analyse large-deformation softening materials. Although arc-length methods and their variants can trace most smooth nonlinear paths using small increments, they may still diverge in regions of high path curvature if the step size is excessive [16,17].

Other constraint strategies include the work control method [18] and the minimum residual area method [19,20], although these lack generality and have seen limited practical use. In the displacement space, Ahmad-Abad et al. [21] proposed a family of minimum residual displacement methods. Notably, Yang and Shieh [22] employed a generalized stiffness parameter (GSP) and an orthogonal iterative strategy to develop the generalized displacement control method (GDCM). Owing to its simplicity, robustness, and numerical stability in tracing complex equilibrium paths, the GDCM has been extensively employed in various structural analysis domains, including: (1) geometric nonlinear analysis of thin-walled and spatial structures [23,24]; (2) elastoplastic analysis of steel frame structures [25,26]; (3) topology and shape optimization of large-deformation mechanical metamaterials and hyperelastic multi-material systems [27,28]; and (4) the design and analysis of advanced systems [29]. Further improvements to the original GDCM have been reported, including a more accurate estimation of the initial load increment [30], enhanced iterations through the use of other guide vectors [31], and the incorporation of a secant predictor to improve computational efficiency [32].

Based on previous research, path-following techniques present several critical challenges, each meriting in-depth investigation: (1) determining an appropriate load increment size during the predictor phase is fundamental to maintaining computational efficiency; (2) establishing the correct sign of the load increment in the predictor phase is essential for advancing forward along the equilibrium path while simultaneously preventing backtracking; and (3) accurately computing the load increment factor during the corrector phase is crucial to ensuring the overall reliability and precision of the method. Building upon the incremental-iterative framework, this paper presents a detailed analysis of the role of the load increment factor in the predictor and corrector phases. In the predictor phase, a current generalized stiffness parameter (CGSP) is introduced for adaptive increment size control, and a cumulative index $S_i$ is proposed to determine the loading/unloading state. For the corrector phase, four updated orthogonal iterative strategies are formulated, collectively establishing a family of updated orthogonal iterative schemes (UOIS) for tracing nonlinear paths. Furthermore, to enhance computational efficiency, a secant prediction operator is embedded in the predictor phase. The robustness, accuracy, and efficiency of the proposed framework are demonstrated through numerical case studies of a two-member truss and a semi-circular arch. Although demonstrated here for geometric nonlinearity in an elastic structure, the proposed method is equally applicable to material nonlinearity problems. By introducing an elastoplastic constitutive model into the numerical framework, it can be used for analyses such as pipeline elastoplasticity [33] and tunnel deformation [34].

2. Incremental-Iterative Solution Procedure

2.1. Structural Incremental Equilibrium Equations

In structural nonlinear analysis, the equilibrium equation governing the structural response, accounting for nonlinear load-bearing behavior, is expressed as

$$\left[K\left\{U\right\}\right]\left\{U\right\}=\left\{P\right\},$$

(1)

where $\left\{U\right\}$ is the structural displacement vector, and $\left[K\left\{U\right\}\right]$ represents the structural stiffness matrix. Accounting for geometric and material nonlinearities, the stiffness matrix evolves with the displacement vector $\left\{U\right\}$, introducing nonlinear characteristics absent in linear analysis. The vector $\left\{P\right\}$ denotes the externally applied loads. Accurate determination of the structural load–displacement response requires solving Equation (1). However, unlike linear analysis, Equation (1) constitutes a system of nonlinear equations in $\left\{U\right\}$, precluding a direct solution. Numerical strategies employing an incremental-iterative approach are adopted to trace the load–displacement path. This methodology applies the external load $\left\{P\right\}$ in a sequence of sufficiently small increments. Within each increment, the solution is advanced using a linearized incremental equilibrium equation, while iterations are performed to ensure convergence to the true structural equilibrium. The cumulative results from all increments yield the complete load–displacement history.

For notational clarity, superscripts denote the increment number and subscripts denote the iteration count within an increment. The linearized incremental equilibrium equation for the j-th iteration of the i-th increment is

$$\left[K_{j-1}^i\right]\left\{\Delta U_j^i\right\}=\Delta {\lambda }_j^i\left\{\widehat{P}\right\}+\left\{R_{j-1}^i\right\}.$$

(2)

Here, $\left[K_{j-1}^i\right]$ is the stiffness matrix evaluated at the current known state, typically the tangent stiffness (comprising elastic/elastoplastic and geometric contributions); $\left\{\Delta U_j^i\right\}$ is the incremental displacement vector; $\Delta {\lambda }_j^i$ is the load increment factor; $\left\{\widehat{P}\right\}$ is a prescribed reference load vector; and $\left\{R_{j-1}^i\right\}$ signifies the unbalanced force vector, representing the residual between the external loads and internal forces after the previous iteration. The solution of Equation (2) can be conveniently decomposed into two parts:

$$\left[K_{j-1}^i\right]\left\{\Delta {\widehat{U}}_j^i\right\}=\left\{\widehat{P}\right\},$$

(3)

$$\left[K_{j-1}^i\right]\left\{\Delta {\bar{U}}_j^i\right\}=\left\{R_{j-1}^i\right\},$$

(4)

where $\left\{\Delta {\widehat{U}}_j^i\right\}$ is the displacement increment due to the reference load $\left\{\widehat{P}\right\}$, and $\left\{\Delta {\bar{U}}_j^i\right\}$ is the displacement increment corresponding to the unbalanced force $\left\{R_{j-1}^i\right\}$. Substituting Equations (3) and (4) into Equation (2) yields the total displacement increment for the current iteration

$$\left\{\Delta U_j^i\right\}=\Delta {\lambda }_j^i\left\{\Delta {\widehat{U}}_j^i\right\}+\left\{\Delta {\bar{U}}_j^i\right\}.$$

(5)

The corresponding external load increment is

$$\left\{\Delta P_j^i\right\}=\Delta {\lambda }_j^i\left\{\widehat{P}\right\}.$$

(6)

Consequently, after the j-th iteration of the i-th increment, the accumulated total displacement $\left\{U_j^i\right\}$ and total external load $\left\{P_j^i\right\}$ are updated as

$$\left\{U_j^i\right\}=\left\{U_{j-1}^i\right\}+\left\{\Delta U_j^i\right\},$$

(7)

$$\left\{P_j^i\right\}=\left\{P_{j-1}^i\right\}+\Delta {\lambda }_j^i\left\{\widehat{P}\right\}.$$

(8)

If convergence criteria, typically requiring the norm of the unbalanced force $\left\{R_j^i\right\}$ to fall below a specified tolerance, are satisfied at the end of the j-th iteration, the i-th increment is completed and the analysis proceeds to the next increment. Otherwise, subsequent iterations (j + 1, …) within the i-th increment are performed until convergence is achieved. The complete load–displacement path is then reconstructed from the converged equilibrium states of all increments, thereby fully characterizing the structural nonlinear response.

2.2. Significance of the Load Increment Factor

As described in Section 2.1, tracing the load–displacement path relies on computing the displacement increment (Equation (5)) and the load increment (Equation (6)) in each iteration. The central challenge lies in determining the load increment factor $\Delta {\lambda }_j^i$. Equation (5) contains N + 1 unknowns—the N components of the displacement vector and the scalar $\Delta {\lambda }_j^i$—but only N equations. Consequently, an additional constraint equation for $\Delta {\lambda }_j^i$ must be introduced to make the system determinate. Following the principles of incremental-iterative methods [21], the computational sequence within a typical increment (the i-th increment) comprises two distinct phases:

• Predictor phase (j = 1): This single calculation step begins from a converged equilibrium state at the end of increment (i − 1), where the unbalanced force $\left\{R_0^i\right\}$ is zero. A load increment $\Delta {\lambda }_1^i\left\{\widehat{P}\right\}$ is applied, perturbing the equilibrium. The resulting displacement increment $\left\{\Delta U_1^i\right\}$ is estimated via a linear solution using the tangent stiffness $\left[K_0^i\right]$ according to Equation (2). The magnitude of $\Delta {\lambda }_1^i$ governs the size of the load step, while its sign determines the loading direction (i.e., loading or un-loading).
• Corrector phase (j $\ge$ 2): This phase may involve multiple iterations, starting from a state where the unbalanced force $\left\{R_{j-1}^i\right\}$ is nonzero. Its objective is to iteratively reduce this residual force, which originates from the linearization in the predictor phase, thereby restoring equilibrium for the i-th increment. Within this phase, the specific iterative algorithm (e.g., Newton-Raphson, Arc-length) provides the constraint that determines the value of $\Delta {\lambda }_j^i$. The displacement increment $\left\{\Delta U_j^i\right\}$ is then computed by solving the linear system in Equation (2), which includes the load increment $\Delta {\lambda }_j^i\left\{\widehat{P}\right\}$ and the unbalanced force $\left\{R_{j-1}^i\right\}$, using the current tangent stiffness $\left[K_{j-1}^i\right]$
• This analysis underscores distinct considerations for each phase. The predictor phase requires careful selection of both the magnitude and sign of $\Delta {\lambda }_1^i$. The magnitude should be adaptively controlled according to the structural state to balance efficiency and accuracy, thereby directly controlling the step size. The sign must correctly identify the loading or unloading behavior to ensure the solution follows the correct equilibrium path. The corrector phase primarily addresses the stability and efficiency of the convergence path. The constraint equation governing $\Delta {\lambda }_j^i$ is critical for the robustness of the numerical scheme. Based on these considerations, the following sections present an orthogonal iterative framework, detailing its formulation separately for the predictor and corrector phases.

3. Predictor Phase

3.1. Increment Size Control

The load increment factor $\Delta {\lambda }_1^i$ in the predictor phase governs the load step size. An excessively large value introduces significant unbalanced forces due to linearization, potentially requiring many iterations for convergence or even leading to divergence. Conversely, an overly small step reduces computational efficiency. An effective adaptive incremental-iterative method should therefore automatically determine the appropriate increment size based on the current structural state. In nonlinear structural analysis, the evolution of the structural stiffness provides the most direct indication of the load-bearing condition. For practical multi-degree-of-freedom systems, the structural stiffness at the predictor phase of the i-th increment can be characterized by the displacement increment under a fixed reference load:

$$\left\{\Delta {\widehat{U}}_1^i\right\}={\left[K_0^i\right]}^{-1}\left\{\widehat{P}\right\}.$$

(9)

Here, $\left[K_0^i\right]$ is the structural tangent stiffness at the start of the i-th increment, $\left\{\widehat{P}\right\}$ is the prescribed reference load vector, and $\left\{\Delta {\widehat{U}}_1^i\right\}$ is the corresponding displacement increment, which encapsulates the current stiffness information. Since increment size should correlate with changes in structural stiffness, it is typically adjusted by comparing the current stiffness with the initial stiffness. The initial stiffness can be represented analogously using the displacement increment from the first increment:

$$\left\{\Delta {\widehat{U}}_1^1\right\}={\left[K_0^1\right]}^{-1}\left\{\widehat{P}\right\},$$

(10)

where $\left[K_0^1\right]$ denotes the initial tangent stiffness of the structure. This leads to the definition of a parameter that quantifies the change in structural stiffness—the current generalized stiffness parameter (CGSP):

$$CGSP={\displaystyle \frac{{\left\{\Delta {\widehat{U}}_1^1\right\}}^T\left\{\Delta {\widehat{U}}_1^1\right\}}{{\left\{\Delta {\widehat{U}}_1^i\right\}}^T\left\{\Delta {\widehat{U}}_1^i\right\}}}.$$

(11)

The CGSP measures the ratio of the initial stiffness to the current stiffness, serving as an indicator of the evolving structural nonlinearity. Its principal characteristics are: (1) Defined as the ratio of the norm of the first increment displacement to that of the current increment displacement, CGSP effectively tracks structural stiffness evolution and can identify both stiffening and softening behavior. (2) CGSP varies continuously near displacement snap-back points without abrupt jumps, making it robust for increment size control. (3) CGSP remains bounded throughout the loading history, promoting numerical stability in step size control. The load increment factor $\Delta {\lambda }_1^i$, determined adaptively via CGSP, is given by

$$\Delta {\lambda }_1^i=\mathrm{sign}(\Delta {\lambda }_1^i)\Delta {\lambda }_1^1\sqrt{CGSP},$$

(12)

where $\Delta {\lambda }_1^1$ is a user-defined initial load increment factor, based on experience in practical structural analysis, it is recommended that the value of $\Delta {\lambda }_1^1\left\{\widehat{P}\right\}$ be set between 5% and 10% of the first critical load. Equation (12) enables efficient, adaptive step-size control by incorporating both the structural response and the user-defined initial factor.

For comparison, the generalized displacement control method (GDCM) [22] employs the generalized stiffness parameter (GSP) to reflect stiffness changes, defined as

$$GSP={\displaystyle \frac{{\left\{\Delta {\widehat{U}}_1^1\right\}}^T\left\{\Delta {\widehat{U}}_1^1\right\}}{{\left\{\Delta {\widehat{U}}_1^{i-1}\right\}}^T\left\{\Delta {\widehat{U}}_1^i\right\}}}.$$

(13)

The corresponding load increment factor $\Delta {\lambda }_1^i$ is determined by

$$\Delta {\lambda }_1^i=\mathrm{sign}(\Delta {\lambda }_1^i)\Delta {\lambda }_1^1\sqrt{\left|GSP\right|}.$$

(14)

Comparing Equations (11) and (13) shows that GSP incorporates the norms of both the current displacement increment $\left\{\Delta {\widehat{U}}_1^i\right\}$ and the previous displacement increment $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$ in the denominator, whereas CGSP which uses only the current increment $\left\{\Delta {\widehat{U}}_1^i\right\}$. Consequently, GSP does not solely reflect the most recent stiffness change, potentially leading to less responsive and efficient step-size control compared to CGSP. A detailed comparative analysis is presented in the case studies. It is noteworthy that Leon et al. [31] adopted the CGSP in place of the GSP within their modified generalized displacement control method to regulate the incremental step size.

3.2. Sign Determination of the Load Increment Factor

Determining the sign of $\Delta {\lambda }_1^i$, in addition to its magnitude from Equation (12), is crucial. Established methods for determining this sign include: (1) Using the current stiffness parameter (CSP) [35], which fails when the path exhibits snap-back behavior. (2) Relying on the sign of the determinant of the structural tangent stiffness matrix [36], which also fails near bifurcation or snap-back points. (3) Employing the generalized stiffness parameter (GSP) [22] or the projection direction of the predictor displacement increment [37], which require indirect comparison with the sign from the previous increment. (4) Applying a mathematically derived generalized criterion [38], which lacks physical insight and is computationally expensive.

This paper proposes a novel approach that uses a cumulative product indicator, denoted $S_i$, to determine the sign of $\Delta {\lambda }_1^i$. The indicator $S_i$ is defined as

$$S_i={\prod }_{n=1}^i{I}_n,$$

(15)

where the scalar component $I_n$ is the dot product of the displacement increments from the (n − 1)-th and n-th increments:

$$I_n={\displaystyle \frac{{\left\{\Delta {\widehat{U}}_1^{n-1}\right\}}^T\left\{\Delta {\widehat{U}}_1^n\right\}}{‖{\left\{\Delta {\widehat{U}}_1^{n-1}\right\}}^T\left\{\Delta {\widehat{U}}_1^n\right\}‖}}.$$

(16)

Note that in Equation (16), n ≥ 2 applies. For the initial case n = 1, $I_n$ is taken as 1.

As illustrated in Figure 1, for complex equilibrium paths with multiple critical points, the angle between consecutive displacement increments $\left\{\Delta {\widehat{U}}_1^{n-1}\right\}$ and $\left\{\Delta {\widehat{U}}_1^n\right\}$ is obtuse only when the n-th increment crosses a load limit point; it remains acute elsewhere, including near displacement limit points. Therefore, $I_n$ is negative exclusively when crossing a load limit point and positive otherwise, making $I_n$ a robust detector for load limit points. This behavior matches the required sign change in the load increment factor $\Delta {\lambda }_1^i$: it should be positive during loading and negative during unloading, with the sign change occurring precisely upon crossing a load limit point. This correspondence is captured by the sign of the cumulative product indicator $S_i$. Thus, the sign of the load increment factor $\Delta {\lambda }_1^i$ is identical to the sign of $S_i$ as follows:

$$\mathrm{sign}(\Delta {\lambda }_1^i)=\mathrm{sign}\left(S_i\right).$$

(17)

4. Corrector Phase: Four Updated Orthogonal Iteration Strategies

The corrector phase requires defining a convergence path for iterative computations. The chosen path critically governs both the permissible increment size and the numerical stability of the solution procedure. An efficient path enables convergence with larger load steps while maintaining robustness near critical points. For example, the arc-length method, which employs an arc-shaped constraint path, often requires severely reduced step sizes in regions of high path curvature to prevent numerical divergence [16,17].

Orthogonal iterative paths constitute a class of efficient and stable constraint strategies. The generalized displacement control method (GDCM) implements this concept by using the displacement increment $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$ from the predictor phase of the previous increment, as the fixed orthogonal reference vector throughout the corrector phase of the i-th increment. The corresponding constraint equation is

$${\left\{\Delta {\widehat{U}}_1^{i-1}\right\}}^T\left\{\Delta U_j^i\right\}=0,j\ge 2.$$

(18)

This stipulates that each iterative displacement correction $\left\{\Delta U_j^i\right\}$ must be orthogonal to the historical vector $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$. Substituting Equation (5) into Equation (18) yields the expression for the load increment factor:

$$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_1^{i-1}\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_1^{i-1}\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}},j\ge 2.$$

(19)

Although established, this approach possesses a potential limitation: the reference vector $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$ reflects the structural state from the previous increment. During the corrector phase of the i-th increment, a sequence of displacement increments $\left\{\Delta {\widehat{U}}_1^i\right\}$, $\left\{\Delta {\widehat{U}}_2^i\right\}$, …, $\left\{\Delta {\widehat{U}}_{j-1}^i\right\}$, $\left\{\Delta {\widehat{U}}_j^i\right\}$ associated with the reference load becomes available from Equation (3). These vectors inherently carry more current stiffness information than $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$. Consequently, using them as the orthogonal basis can lead to more efficient convergence paths. This rationale underpins the following updated orthogonal iterative strategies (UOIS).

UOIS-1 adopts the most immediate reference, $\left\{\Delta {\widehat{U}}_1^i\right\}$, as the orthogonal vector in the corrector phase:

$${\left\{\Delta {\widehat{U}}_1^i\right\}}^T\left\{\Delta U_j^i\right\}=0,j\ge 2.$$

(20)

Substituting Equation (5) gives the load increment factor:

$$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_1^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_1^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}},j\ge 2.$$

(21)

The iterative path defined by Equations (20) and (21) is illustrated in Figure 2.

In Figure 2, point a is the converged state from (i − 1) increment. The predictor phase of the i-th increment advances the solution to point b, where an unbalanced force $\left\{R_1^i\right\}$ exists. The iterative path of GDCM (b→g→h), constrained by the previous increment’s vector $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$, is compared with the UOIS-1 path (b→d→f), which uses the current vector $\left\{\Delta {\widehat{U}}_1^i\right\}$. UOIS-1 promotes faster convergence and this enhanced efficiency is particularly beneficial for maintaining stability with larger step sizes. For instance, when encountering a hypothetical equilibrium path (dashed line), UOIS-1 would likely converge successfully, whereas GDCM might diverge.

UOIS-2 dynamically updates the reference vector to the most recently computed displacement increment $\left\{\Delta {\widehat{U}}_{j-1}^i\right\}$ in each iteration:

$${\left\{\Delta {\widehat{U}}_{j-1}^i\right\}}^T\left\{\Delta U_j^i\right\}=0,j\ge 2.$$

(22)

Substituting Equation (5) gives the corresponding load increment factor:

$$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_{j-1}^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_{j-1}^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}},j\ge 2.$$

(23)

UOIS-2 generates the iterative path shown in Figure 3, where the orthogonal direction is continually updated throughout the iteration process.

In Figure 3, point b denotes the state after the predictor phase of the i-th increment, where an unbalanced force $\left\{R_1^i\right\}$ exists. In the first iteration of UOIS-2, vector $\left\{\Delta {\widehat{U}}_1^i\right\}$ is used as the orthogonal reference; in the second iteration, vector $\left\{\Delta {\widehat{U}}_2^i\right\}$ is used. This updating sequence continues until convergence. The resulting convergence path, illustrated as b→d→f in Figure 3, demonstrates superior iterative performance compared to GDCM.

UOIS-3 uses the displacement increment $\left\{\Delta {\widehat{U}}_j^i\right\}$ as the reference vector:

$${\left\{\Delta {\widehat{U}}_j^i\right\}}^T\left\{\Delta U_j^i\right\}=0,j\ge 2.$$

(24)

Substituting Equation (5) gives the corresponding load increment factor:

$$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_j^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_j^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}},j\ge 2.$$

(25)

The iterative path for UOIS-3, defined by Equations (24) and (25), is illustrated in Figure 4.

In Figure 4, during the first iteration of UOIS-3, the vector $\left\{\Delta {\widehat{U}}_2^i\right\}$ is used as the orthogonal reference; in the second iteration, $\left\{\Delta {\widehat{U}}_3^i\right\}$ serves as the reference. This updating sequence continues until convergence. The resulting convergence path, illustrated as b→d→f in Figure 4, demonstrates superior iterative performance compared to GDCM.

UOIS-4 employs the accumulated displacement increment up to the previous iteration, $\left\{\sum \Delta U_j^i\right\}$, as the reference vector:

$${\left\{\sum \Delta U_{j-1}^i\right\}}^T\left\{\Delta U_j^i\right\}=0,j\ge 2.$$

(26)

The accumulated displacement increment is defined as

$$\left\{\sum \Delta U_{j-1}^i\right\}=\left\{\Delta U_1^i\right\}+\left\{\Delta U_2^i\right\}+\cdots +\left\{\Delta U_{j-1}^i\right\}.$$

(27)

Substituting Equation (5) into Equation (26) gives the load increment factor:

$$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\sum \Delta U_{j-1}^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\sum \Delta U_{j-1}^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}},j\ge 2.$$

(28)

The convergence path for UOIS-4 is shown in Figure 5, illustrating its performance relative to GDCM.

In Figure 5, during the first iteration of UOIS-4, the vector $\left\{\Delta U_1^i\right\}={\lambda }_1^i\left\{\Delta {\widehat{U}}_1^i\right\}$ is used as the orthogonal reference. In the second iteration, the accumulated vector $\left\{\sum \Delta U_2^i\right\}=\left\{\Delta U_1^i\right\}+\left\{\Delta U_2^i\right\}$ serves as the reference vector. This updating sequence continues until convergence. The convergence path b→d→f likewise demonstrates superior performance compared to GDCM.

In summary, the UOIS consistently demonstrate superior iterative efficiency compared to the baseline GDCM, primarily because they utilize more contemporaneous stiffness information.

5. An Acceleration Strategy: Embedding a Secant Prediction Operator in the Predictor Phase

As described by Equations (9), (11) and (12), determining the load increment factor $\Delta {\lambda }_1^i$ conventionally requires: first, assembling the tangent stiffness matrix $\left[K_0^i\right]$ at the start of the i-th increment, which comprises both the elastic stiffness $\left[K_e^i\right]$ and the geometric stiffness $\left[K_g^i\right]$; second, solving for the displacement increment $\left\{\Delta {\widehat{U}}_1^i\right\}$; and finally, computing $\Delta {\lambda }_1^i$ based on the CGSP and the initial load factor $\Delta {\lambda }_1^1$. This conventional procedure inherently involves the assembly and inversion of the global structural stiffness matrix during the predictor phase. For complex structural systems comprising a large number of finite elements, these operations are computationally expensive, significantly impairing the efficiency of the solution algorithm. To circumvent this computational cost, Yang et al. [32] integrated the secant prediction operator into the predictor phase of the GDCM. Building upon this approach, the present work adopts the same secant prediction operator to estimate the predictor displacement increment $\left\{\Delta {\widehat{U}}_1^i\right\}$. This approach avoids the need to assemble and invert the global tangent stiffness matrix during the predictor phase.

The concept is illustrated schematically in Figure 6. Point m denotes the initial state of the (i − 1)-th increment, while point a represents its converged final state. This converged state (point a) also serves as the starting point for the subsequent i-th increment. At the beginning of the i-th increment, the complete solution history of the preceding (i − 1)-th increment is known. The nominal secant stiffness $\left[K_s^{i-1}\right]$ between states m and a can be defined, which relates the cumulative load and displacement increments from the (i − 1)-th increment:

$$\left[K_s^{i-1}\right]\left\{\Delta U^{i-1}\right\}=\left\{\Delta P^{i-1}\right\}.$$

(29)

Here, $\left\{\Delta U^{i-1}\right\}$ and $\left\{\Delta P^{i-1}\right\}$ denote the cumulative displacement and load increments, respectively, over the (i − 1)-th increment. These are defined as

$$\left\{\Delta U^{i-1}\right\}=\left\{U_0^i\right\}-\left\{U_0^{i-1}\right\}={\sum }_{j=1}^n\left\{\Delta U_j^{i-1}\right\},$$

(30)

$$\left\{\Delta P^{i-1}\right\}=\left\{P_0^i\right\}-\left\{P_0^{i-1}\right\}={\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}\left\{\widehat{P}\right\},$$

(31)

where n is the total number of iterations performed for convergence within the (i − 1)-th increment. Substituting Equation (31) into Equation (29) gives

$$\left[K_s^{i-1}\right]\left\{\Delta U^{i-1}\right\}={\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}\left\{\widehat{P}\right\}.$$

(32)

The displacement increment $\left\{\Delta {\widehat{U}}_1^i\right\}$ under the reference load $\left\{\widehat{P}\right\}$ in the predictor phase of the i-th increment, approximated using this nominal secant stiffness, is given by

$$\left\{\Delta {\widehat{U}}_1^i\right\}=[K_s^{i-1}{]}^{-1}\left\{\widehat{P}\right\}.$$

(33)

By leveraging the relationship in Equations (32) and (33) can be reformulated to obtain

$$\left\{\Delta {\widehat{U}}_1^i\right\}=[K_s^{i-1}{]}^{-1}\left\{\widehat{P}\right\}=\left\{\Delta U^{i-1}\right\}/{\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}.$$

(34)

A comparison between Equation (34) and Equation (9) reveals a key advantage: the proposed secant prediction operator utilizes readily available information from the converged preceding increment—namely, the cumulative displacement increment $\left\{\Delta U^{i-1}\right\}$ and the sum of the converged load factors ${\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}$—to estimate $\left\{\Delta {\widehat{U}}_1^i\right\}$. This approach effectively circumvents the need to assemble and invert the tangent stiffness matrix at the beginning of the new increment (point a). Consequently, the computational cost of the predictor phase is reduced. For large-scale structural models with a large number of elements, this strategy can substantially improve the overall computational efficiency.

6. Numerical Implementation

The updated orthogonal iterative framework described in the preceding sections can be efficiently implemented within a general-purpose finite element program to trace nonlinear equilibrium paths automatically, including those involving complex postbuckling responses. The computational sequence for a typical load increment is summarized below and illustrated in Figure 7. This process begins after the initialization of essential parameters, such as the reference load vector $\left\{\widehat{P}\right\}$ and the initial load increment factor $\Delta {\lambda }_1^1$.

• Step 1: Phase determination

The phase of the algorithm is determined by the iteration counter j. If j = 1, the calculation enters the predictor phase; if j $\ge$ 2, it proceeds to the corrector phase.

• Step 2a: Predictor phase (j = 1)

  (1)

  Assemble the structural tangent stiffness matrix $\left[K_0^i\right]$.

  (2)

  Solve for the reference displacement increment $\left\{\Delta {\widehat{U}}_1^i\right\}$, using Equation (3).

  (3)

  Evaluate the current generalized stiffness parameter (CGSP) using Equation (11).

  (4)

  Compute the scalar component $I_i$ using Equation (16), and then update the indicator $S_i$ by multiplying all the scalar components from the preceding incremental steps.

  (5)

  Compute the magnitude of the load increment factor, $\left|\Delta {\lambda }_1^i\right|$, via Equation (12).

  (6)

  Determine the signed value of the load increment factor $\Delta {\lambda }_1^i$, by applying the sign convention defined in Equation (17): If $S_i>0$, then $\Delta {\lambda }_1^i>0$; conversely, if $S_i<0$, then $\Delta {\lambda }_1^i<0$.

• Step 2b: Corrector phase (j$\ge$ 2)

  (1)

  Update the structural tangent stiffness matrix $\left[K_j^i\right]$ based on the current geometry and stress state.

  (2)

  Given the unbalanced force $\left\{R_{j-1}^i\right\}$, solve for the displacement increments $\left\{\Delta {\widehat{U}}_j^i\right\}$ and $\left\{\Delta {\bar{U}}_j^i\right\}$ using Equations (3) and (4), respectively.

  (3)

  Select one of the four updated orthogonal iteration strategies (UOIS) and compute the corresponding load increment factor $\Delta {\lambda }_j^i$, from its associated constraint equation.

• Step 3: State update

  (1)

  Using the determined load increment factor (either $\Delta {\lambda }_1^i$ from the predictor or $\Delta {\lambda }_j^i$ from the corrector), Compute the resulting structural displacement increment $\left\{\Delta U_j^i\right\}$, using Equation (5).

  (2)

  Update the total structural displacement $\left\{U_j^i\right\}$ and total external load $\left\{P_j^i\right\}$, using Equations (7) and (8), respectively.

• Step 4: Force recovery and equilibrium evaluation

  (1)

  Update all nodal coordinates and the structural geometry based on the displacement increment $\left\{\Delta U_j^i\right\}$.

  (2)

  Compute the nodal forces $\left\{f_j^i\right\}$ of the elements using the rigid body rule [30] in the updated configuration and assemble the global structural resisting force $\left\{F_j^i\right\}$.

  (3)

  Calculate the unbalanced force $\left\{R_j^i\right\}$, as the difference between the total external load $\left\{P_j^i\right\}$ and the internal resisting force $\left\{F_j^i\right\}$: $\left\{R_j^i\right\}=\left\{P_j^i\right\}-\left\{F_j^i\right\}$.

• Step 5: Convergence check

Check whether the unbalanced force $\left\{R_j^i\right\}$ satisfies the convergence criterion: $‖\left\{R_j^i\right\}‖<{\epsilon }_r‖\left\{∆P^i\right\}‖,{\epsilon }_r=0.0001$, where ${\epsilon }_r$ is a predefined tolerance.

If convergence is achieved, the current load increment is completed, and the analysis proceeds to the next incremental step. Otherwise, update the iteration counter (j → j + 1) and return to Step 2b for another corrector iteration. The numerical procedure terminates once the calculated result reaches the prescribed load or displacement level.

The acceleration strategy based on the secant prediction operator, introduced in Section 5, is incorporated into this flowchart as highlighted in red in Figure 7. To employ this strategy, the corresponding process blocks in the predictor phase (shown in blue in the standard algorithm) are replaced by the red-highlighted expressions.

7. Numerical Case Studies

This section presents two representative case studies to evaluate the performance and robustness of the proposed updated orthogonal iterative strategies (UOIS) and the acceleration strategy in tracing complex structural nonlinear equilibrium paths. While a linear elastic material model is assumed throughout this study, the proposed technique can be extended to problems involving material nonlinearity. This is achieved by integrating the rigid body rule with the plastic hinge concept, where the elastic stiffness matrix is replaced by its elastoplastic counterpart [25], thus facilitating post-buckling analysis with material nonlinearities. Although the selected structure is geometrically simple, its equilibrium path is a circular curve with multiple critical points, demanding considerable robustness and computational capability from the numerical algorithm. Results obtained from the generalized displacement control method (GDCM) under identical parameters are also presented here for a comprehensive comparison. The numerical schemes investigated in this study is systematically summarized in

Table 1. Summary of the numerical schemes implemented.

Schemes	Predictor Phase (j = 1)			$\mathbf{Corrector}\mathbf{Phase}(\mathit{j}\ge$ 2)
	$\left|\mathsf{\Delta }{\mathit{\lambda }}_1^{\mathit{i}}\right|$	Sign Determination	$\left\{\mathsf{\Delta }{\widehat{\mathit{U}}}_1^{\mathit{i}}\right\}$	$\mathsf{\Delta }{\mathit{\lambda }}_{\mathit{j}}^{\mathit{i}}$
GDCM	$\Delta {\lambda }_1^i=\Delta {\lambda }_1^1\sqrt{\left|GSP\right|}$	GSP	${\left[K_0^i\right]}^{-1}\left\{\widehat{P}\right\}$	$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_1^{i-1}\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_1^{i-1}\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}}$
GDCM-A			$\left\{\Delta U^{i-1}\right\}/{\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}$
UOIS-1	$\Delta {\lambda }_1^i=\Delta {\lambda }_1^1\sqrt{CGSP}$	$S_i$	${\left[K_0^i\right]}^{-1}\left\{\widehat{P}\right\}$	$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_1^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_1^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}}$
UOIS-1-A			$\left\{\Delta U^{i-1}\right\}/{\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}$
UOIS-2	$\Delta {\lambda }_1^i=\Delta {\lambda }_1^1\sqrt{CGSP}$	$S_i$	${\left[K_0^i\right]}^{-1}\left\{\widehat{P}\right\}$	$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_{j-1}^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_{j-1}^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}}$
UOIS-2-A			$\left\{\Delta U^{i-1}\right\}/{\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}$
UOIS-3	$\Delta {\lambda }_1^i=\Delta {\lambda }_1^1\sqrt{CGSP}$	$S_i$	${\left[K_0^i\right]}^{-1}\left\{\widehat{P}\right\}$	$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\Delta {\widehat{U}}_j^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\Delta {\widehat{U}}_j^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}}$
UOIS-3-A			$\left\{\Delta U^{i-1}\right\}/{\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}$
UOIS-4	$\Delta {\lambda }_1^i=\Delta {\lambda }_1^1\sqrt{CGSP}$	$S_i$	${\left[K_0^i\right]}^{-1}\left\{\widehat{P}\right\}$	$\Delta {\lambda }_j^i=-{\displaystyle \frac{{\left\{\sum \Delta U_{j-1}^i\right\}}^T\left\{\Delta {\bar{U}}_j^i\right\}}{{\left\{\sum \Delta U_{j-1}^i\right\}}^T\left\{\Delta {\widehat{U}}_j^i\right\}}}$
UOIS-4-A			$\left\{\Delta U^{i-1}\right\}/{\sum }_{j=1}^n\Delta {\lambda }_j^{i-1}$

, Schemes that embed the secant prediction operator (introduced in Section 5) are denoted by the suffix “-A”. All numerical simulations were conducted in MATLAB R2020a on a workstation equipped with an Intel^® Core™ i5-12400F processor, 32.0 GB of RAM, and the Windows 11 (64-bit) operating system.

7.1. Two-Members Truss

The two-member truss shown in Figure 8, though geometrically simple, serves as a demanding benchmark problem for assessing the reliability of path-tracking algorithms under various loading conditions. An analytical solution for this problem was presented by Pecknold et al. [39]. In the numerical model, the following material and geometric properties are adopted: elastic modulus E = 1.3 × 10³ kPa, cross-sectional area A = 6.45 cm², angle α = 63.4°, and height h = 65.651 cm. Each member is modeled using a two-dimensional truss element [16]. The analysis examines the structural response under three distinct loading scenarios.

First loading condition (ideal, defect-free): A vertical load $P_v$ is applied at the top vertex, while the horizontal load $P_u$ is set to zero. Due to structural symmetry and perfect load alignment, the equilibrium path exhibits a unique, single-branch response without bifurcation or adjacent equilibrium branches. The reference load is set to ${\widehat{P}}_v=10$ N. The size of the load increment is controlled by varying the initial load increment factor $\Delta {\lambda }_1^1$.

Figure 9a compares the evolution of the generalized stiffness parameter (GSP) and the current generalized stiffness parameter (CGSP) for two different initial increment sizes: a small value ($\Delta {\lambda }_1^1=1$) and a large value ($\Delta {\lambda }_1^1=100$). For a small increment size ($\Delta {\lambda }_1^1=1$), the GSP and CGSP curves are nearly identical. This occurs because small steps lead to minimal changes in the structural stiffness between successive increments, resulting in similar values for the stiffness parameters of consecutive increments (denoted as $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$ and $\left\{\Delta {\widehat{U}}_1^i\right\}$). In contrast, for a large increment size ($\Delta {\lambda }_1^1=100$), the CGSP curve remains consistent with its small-step counterpart, demonstrating its insensitivity to the step size and thus its superior numerical stability. The GSP curve, however, exhibits significant deviation: it increases in structural softening regions but decreases in hardening regions. This behavior arises from the more pronounced stiffness changes between adjacent increments under large step sizes—specifically, $\left\{\Delta {\widehat{U}}_1^{i-1}\right\}$ becomes significantly smaller than $\left\{\Delta {\widehat{U}}_1^i\right\}$ in softening regions and larger than $\left\{\Delta {\widehat{U}}_1^i\right\}$ in hardening regions. In nonlinear incremental-iterative analysis, it is generally advisable to reduce the step size in softening regions and increase it in hardening regions. The trend exhibited by GSP contradicts this requirement, making algorithms relying on it prone to numerical instability (e.g., solution oscillations or divergence) when large initial increments are used. In contrast, CGSP remains stable regardless of the increment size and therefore provides a more robust indicator for adaptive step-size control.

For a small increment size ($\Delta {\lambda }_1^1=1$), the equilibrium path traced by GDCM (using GSP) coincides exactly with that obtained by the UOIS methods (using CGSP). Taking UOIS-1 as an example, Figure 9b shows a comparison of the equilibrium paths obtained from the two approaches. When a large initial increment is used ($\Delta {\lambda }_1^1=100$), the UOIS methods continue to produce smooth equilibrium curves. In contrast, the GDCM solution exhibits noticeable numerical oscillations near the limit point, as shown in Figure 9c. This demonstrates that the UOIS framework can accommodate larger initial load increments than GDCM, enabling larger stable step sizes and yielding higher computational efficiency. To validate the proposed acceleration strategy, results from the UOIS method incorporating the secant prediction operator (e.g., UOIS-1-A) are compared with those from the baseline UOIS implementation (e.g., UOIS-1). The corresponding equilibrium paths are identical, confirming that the acceleration strategy does not alter the solution path. For instance, Figure 9d shows a comparison of the equilibrium paths obtained from the accelerated scheme UOIS-1-A and the standard scheme UOIS-1. These results confirm that the introduced acceleration strategy preserves the solution accuracy of the original method while significantly improving its computational performance.

Second loading condition: A vertical load $P_v$ is applied at the top vertex together with a horizontal load $P_u=0.05P_v$, introducing an initial loading imperfection. Under this condition, the equilibrium path exhibits a closed-loop response with adjacent equilibrium branches. The reference loads are set to ${\widehat{P}}_v=10$ N, ${\widehat{P}}_u=0.5$ N. Figure 10a compares the evolution of GSP and CGSP for two increment sizes: $\Delta {\lambda }_1^1=1$ (small step) and $\Delta {\lambda }_1^1=80$ (large step). For small increments ($\Delta {\lambda }_1^1=1$), the GSP and CGSP curves closely coincide. When a large increment is used ($\Delta {\lambda }_1^1=80$), the CGSP curve remains consistent with its small-step counterpart, whereas the GSP curve shows noticeable deviation. This result confirms that CGSP is numerically more stable than GSP and provides a more reliable indicator for adaptive increment-size control in the presence of path looping.

When the increment size is small ($\Delta {\lambda }_1^1=1$), the equilibrium paths obtained using GDCM and the UOIS methods are identical, as illustrated for UOIS-1 in Figure 10b. However, under a large initial increment ($\Delta {\lambda }_1^1=80$), the UOIS continue to trace smooth equilibrium curves, whereas the GDCM solution exhibits numerical oscillations, as seen in Figure 10c. This confirms the superior robustness of the UOIS framework in accommodating larger load increments. Furthermore, the equilibrium paths computed with the accelerated strategy (e.g., UOIS-3-A) are indistinguishable from those of the corresponding baseline methods (e.g., UOIS-3), as shown in Figure 10d. This demonstrates that incorporating the secant prediction operator preserves the solution accuracy of the original algorithm while improving computational efficiency.

Third loading condition: A horizontal load $P_u$ is applied at the top vertex, accompanied by a vertical disturbance load $P_v=0.05P_u$. This introduces a vertical imperfection, causing the structural equilibrium path to also form a closed loop. The reference loads are set to ${\widehat{P}}_u=10$ N, ${\widehat{P}}_v=0.5$ N. Figure 11a compares the GSP and CGSP curves for increment sizes $\Delta {\lambda }_1^1=1$ (small step) and $\Delta {\lambda }_1^1=26$ (large step). For small increments ($\Delta {\lambda }_1^1=1$), the two curves nearly coincide. When a large increment is used ($\Delta {\lambda }_1^1=26$), the CGSP curve remains consistent with the small-step result, while the GSP curve exhibits clear deviation. This result reaffirms that CGSP is more stable than GSP and provides a more reliable indicator for adaptive increment-size control in the presence of path looping.

For a small increment size ($\Delta {\lambda }_1^1=1$), the equilibrium paths obtained using GDCM and the UOIS family of methods are in full agreement, as illustrated for UOIS-1 in Figure 11b. However, when a larger increment is employed ($\Delta {\lambda }_1^1=26$), the UOIS methods continue to produce smooth equilibrium curves, whereas the GDCM solution displays noticeable numerical oscillations (Figure 11c). This further demonstrates the ability of the UOIS framework to accommodate larger increment steps compared to GDCM. Additionally, the equilibrium paths computed with the accelerated strategy (e.g., UOIS-4-A) are indistinguishable from those of the corresponding baseline schemes (e.g., UOIS-4), as shown in Figure 11d. This confirms that the inclusion of the secant prediction operator does not compromise solution accuracy, while it enhances computational efficiency.

In the numerical analysis, the force-based convergence criterion was adopted, with the convergence tolerance, ${\epsilon }_r$, set to ${10}^{-4}$. A sensitivity analysis was subsequently conducted on the UOIS-1 and UOIS-4 methods to evaluate the impact of various tolerances on computational efficiency and solution accuracy. Using the calculation of the snap-back point A (which exhibits large curvature) in Figure 11d as a benchmark, convergence tolerances ranging from ${10}^{-2}$ to ${10}^{-6}$ were tested. The error was quantified as the Euclidean (L₂) norm of the difference between the snap-back points computed with looser tolerances (${10}^{-2}$ to ${10}^{-5}$) and a reference solution obtained with the most stringent tolerance (${10}^{-6}$). The results are presented in

Table 2. Computational data for the two-member truss with a horizontal imperfection using UOIS-1 and UOIS-4.

Schemes	$\mathbf{Tolerance}{\mathit{\epsilon }}_{\mathit{r}}$	Incremental Steps	Avg. Iterations Per Step	CPU Time (s)	Relative Error (%)
UOIS-1	10−2	1728	1.0139	0.0620	0.0134
	10−3	1730	1.1145	0.0646	0.0025
	10−4	1730	1.5480	0.0848	0.0018
	10−5	1730	1.9994	0.0954	0.0012
	10−6	1730	2.0001	0.1036	(Reference)
UOIS-4	10−2	1728	1.0139	0.0654	0.0136
	10−3	1730	1.1145	0.0705	0.0024
	10−4	1730	1.5480	0.0854	0.0018
	10−5	1730	1.9994	0.0991	0.0012
	10−6	1730	2.0001	0.1047	(Reference)

. It is observed that a tolerance of ${10}^{-2}$ yields an acceptably low error, and further tightening of the tolerance produces diminishing returns in error reduction. Setting the tolerance within the range of ${10}^{-4}$ to ${10}^{-5}$ provides an optimal balance between computational efficiency (i.e., the average number of iterations) and solution accuracy (i.e., the relative error). Consequently, a convergence tolerance of ${10}^{-4}$ is generally sufficient for solving a wide range of highly nonlinear problems.

7.2. Hinged Semi-Circular Arch

Figure 12 depicts a hinged semi-circular arch, a structure known to exhibit a complex looping equilibrium path with multiple critical points under either central or eccentric loading. This structure serves as a classical and demanding benchmark for evaluating the robustness and path-tracing capability of nonlinear solution algorithms. The material and geometric parameters adopted in the analysis are as follows: arch span L = 100 cm, elastic modulus E = 2 kN/cm², cross-sectional area A = 1 cm², and second moment of area I = 1 cm⁴. To assess the computational acceleration achieved by the proposed strategy, the arch is discretized into 100 two-dimensional beam elements [16] in the numerical model.

First loading condition (central load): A concentrated vertical load is applied at the crown of the arch. The reference load is set to $\widehat{P}=0.01$ N. For a small initial load increment factor ($\Delta {\lambda }_1^1=5$), the equilibrium paths obtained with GDCM and the UOIS methods coincide, as shown for GDCM and UOIS-1 in Figure 13a. This indicates that both methods can accurately trace paths containing multiple critical points when the increment size is sufficiently small. Figure 13b compares the evolution of GSP and CGSP. Although the two curves generally agree, within the region marked by the red dashed box, the GSP value is notably higher than that of CGSP. This region corresponds to a segment of the equilibrium path with high curvature, where a smaller step size is required for stable progression. The more stable and representative behavior of CGSP in this region confirms its superior suitability as an indicator for adaptive step-size control.

When the initial load factor is increased to a larger value ($\Delta {\lambda }_1^1=18$), GDCM fails to converge near the critical point, as shown in Figure 13c. In contrast, all UOIS variants successfully trace the complete equilibrium path, demonstrating their superior robustness and adaptability to larger increments. This improvement stems from the use of CGSP for step-size control and the more effective orthogonal iteration constraints employed in the UOIS framework. Finally, the equilibrium paths obtained with the accelerated schemes (e.g., UOIS-2-A) are indistinguishable from those of the corresponding baseline methods (e.g., UOIS-2), as illustrated in Figure 13d. This confirms that embedding the secant prediction operator preserves the solution accuracy of the original algorithm.

A quantitative comparison of the computational efficiency of each scheme is provided in

Table 3. Computational performance for the semi-circular arch under central loading with $\Delta {\lambda }_1^1=5$.

Schemes	Incremental Steps	Total Number of Iterations	Avg. Iterations Per Step	CPU Time (s)	Acceleration Ratio
GDCM	10,202	20,845	2.0432	83.1547	47.02%
GDCM-A	10,196	20,637	2.0240	44.0523
UOIS-1	10,216	20,847	2.0406	82.9517	46.86%
UOIS-1-A	10,217	20,682	2.0243	44.0763
UOIS-2	10,217	20,878	2.0435	83.0698	46.97%
UOIS-2-A	10,217	20,681	2.0242	44.0523
UOIS-3	10,216	20,875	2.0434	83.1198	46.96%
UOIS-3-A	10,218	20,683	2.0242	44.0827
UOIS-4	10,216	20,875	2.0434	83.5359	46.80%
UOIS-4-A	10,217	20,681	2.0242	44.4436

and

Table 4. Computational performance for the semi-circular arch under central loading with $\Delta {\lambda }_1^1=18$.

Schemes	Incremental Steps	Total Number of Iterations	Avg. Iterations Per Step	CPU Time (s)	Acceleration Ratio
GDCM	/	/	/	/	/
GDCM-A	/	/	/	/
UOIS-1	2765	7383	2.6702	28.6917	41.13%
UOIS-1-A	2764	6849	2.4779	16.8916
UOIS-2	2765	7381	2.6694	29.0818	41.68%
UOIS-2-A	2764	6850	2.4783	16.9654
UOIS-3	2764	7398	2.6766	29.2143	41.49%
UOIS-3-A	2766	6855	2.4783	17.0897
UOIS-4	2765	7383	2.6702	29.2316	41.84%
UOIS-4-A	2764	6850	2.4783	17.0105

, corresponding to the small ($\Delta {\lambda }_1^1=5$) and large ($\Delta {\lambda }_1^1=18$) initial load factors, respectively. For the smaller increment size ($\Delta {\lambda }_1^1=5$, Table 3), the number of load steps, total iterations, and solution time required by GDCM and the UOIS methods are comparable. When the acceleration strategy is activated, the number of load steps remains essentially unchanged, the total iteration count decreases slightly, and the computational time is significantly reduced, achieving an acceleration ratio of approximately 47%. This demonstrates the effectiveness of the proposed acceleration strategy under moderate increment sizes.

When a larger increment is used ($\Delta {\lambda }_1^1=18$, Table 4), GDCM fails to converge due to numerical instability. In contrast, all UOIS variants successfully trace the full equilibrium path, exhibiting closely matched numbers of load steps, total iterations, and solution time. With the acceleration enabled, the load-step count remains nearly identical, the total iterations decrease slightly, and the computational time is reduced by approximately 41% compared to the non-accelerated UOIS baselines.

Second loading condition (eccentric load): An eccentric load is applied at an angular offset of π/50 from the crown of the arch. The magnitude of the reference load remains unchanged. For an initial load factor $\Delta {\lambda }_1^1=5$, the equilibrium paths obtained with GDCM and the UOIS methods coincide completely, as illustrated for GDCM and UOIS-3 in Figure 14a. This confirms that both approaches can reliably trace paths containing multiple critical points when the increment size is sufficiently small. A comparison of GSP and CGSP (Figure 14b) shows general agreement between the two curves; however, within the region highlighted by the red dashed box, the GSP value is markedly higher than that of CGSP. This region corresponds to a segment of high path curvature, where the more stable response of CGSP makes it a preferable indicator for step-size adaptation.

When the load factor is increased to $\Delta {\lambda }_1^1=25$, GDCM exhibits numerical divergence (Figure 14c), whereas all UOIS variants successfully trace the complete equilibrium path. This superior robustness stems from the use of CGSP for step-size control, combined with the more efficient orthogonal iteration paths employed in the UOIS framework. Finally, the paths obtained with the accelerated schemes (e.g., UOIS-3-A) are indistinguishable from those of the corresponding baseline methods (e.g., UOIS-3), as shown in Figure 14d. This again verifies that the secant-based acceleration preserves the accuracy of the original solution procedure.

The computational efficiency of each scheme is further compared in

Table 5. Computational performance for the semi-circular arch under eccentric loading with $\Delta {\lambda }_1^1=5$.

Schemes	Incremental Steps	Total Number of Iterations	Avg. Iterations Per Step	CPU Time (s)	Acceleration Ratio
GDCM	14,475	29,594	2.0445	117.7703	46.75%
GDCM-A	14,463	29,300	2.0259	62.7112
UOIS-1	14,486	29,621	2.0448	117.4469	46.48%
UOIS-1-A	14,489	29,357	2.0262	62.8573
UOIS-2	14,486	29,621	2.0448	117.5413	46.50%
UOIS-2-A	14,489	29,357	2.0262	62.8809
UOIS-3	14,487	29,623	2.0448	117.3786	46.53%
UOIS-3-A	14,489	29,353	2.0259	62.7554
UOIS-4	14,486	29,620	2.0447	117.2417	46.44%
UOIS-4-A	14,489	29,357	2.0262	62.7915

and

Table 6. Computational performance for the semi-circular arch under eccentric loading with $\Delta {\lambda }_1^1=25$.

Schemes	Incremental Steps	Total Number of Iterations	Avg. Iterations Per Step	CPU Time (s)	Acceleration Ratio
GDCM	/	/	/	/	/
GDCM-A	/	/	/	/
UOIS-1	2690	8028	2.9844	31.5303	33.65%
UOIS-1-A	2691	7807	2.9012	20.9207
UOIS-2	2690	8031	2.9855	31.5512	33.72%
UOIS-2-A	2691	7808	2.9015	20.9117
UOIS-3	2691	8032	2.9848	31.7869	34.16%
UOIS-3-A	2692	7803	2.8986	20.9273
UOIS-4	2691	8029	2.9836	31.8489	34.22%
UOIS-4-A	2691	7804	2.9000	20.9497

, corresponding to initial load factors $\Delta {\lambda }_1^1=5$ and $\Delta {\lambda }_1^1=25$, respectively. For the small increment $\Delta {\lambda }_1^1=5$ (Table 5), all schemes require a similar number of load steps and iterations. When the acceleration strategy is applied, the computational time decreases substantially, yielding an acceleration ratio of approximately 46%, while the step count and iteration numbers remain nearly unchanged. At the larger load factor $\Delta {\lambda }_1^1=25$ (Table 6), GDCM fails to converge, whereas the UOIS methods successfully trace the full equilibrium path. With acceleration enabled, the number of load steps is maintained, the total iterations are slightly reduced, and the computational time is lowered by approximately 34% relative to the non-accelerated UOIS baselines.

A sensitivity analysis was conducted on the UOIS-2 and UOIS-3 methods to evaluate the influence of the convergence tolerance on computational efficiency and solution accuracy. Using the large-curvature snap-back point B in Figure 14d as a benchmark, the results are presented in

Table 7. Computational data for the semi-circular arch under eccentric loading using UOIS-2 and UOIS-3.

Schemes	$\mathbf{Tolerance}{\mathit{\epsilon }}_{\mathit{r}}$	Incremental Steps	Avg. Iterations Per Step	CPU Time (s)	Relative Error (%)
UOIS-2	10−2	2691	2.0026	21.4261	0.0542
	10−3	2690	2.1900	23.2809	0.0076
	10−4	2690	2.9855	31.5512	0.0010
	10−5	2690	3.2297	34.0962	0.0009
	10−6	2690	3.7517	40.0398	(Reference)
UOIS-3	10−2	2691	2.0033	21.1897	0.0567
	10−3	2691	2.1847	23.2918	0.0087
	10−4	2691	2.9848	31.7869	0.0011
	10−5	2691	3.2319	34.7283	0.0009
	10−6	2691	3.7540	39.8698	(Reference)

. The data demonstrate that a tolerance ${\epsilon }_r$ of ${10}^{-3}$ yields an acceptably low error, and further reductions in ${\epsilon }_r$ produce diminishing improvements in accuracy. An optimal balance between computational efficiency and solution accuracy is achieved when the tolerance is set within the range of ${10}^{-4}$ to ${10}^{-5}$.

8. Conclusions

This study presents a comprehensive investigation within the incremental-iterative framework for tracing structural nonlinear equilibrium paths, with a detailed analysis of the role of the load increment factor in both the predictor and corrector phases. In the predictor phase, the current generalized stiffness parameter (CGSP) is introduced to enable adaptive control of the increment size, while a cumulative indicator $S_i$ is proposed to reliably identify loading and unloading transitions. In the corrector phase, four updated orthogonal iterative strategies (UOIS) are formulated, offering enhanced path-following robustness and efficiency. To enhance computational efficiency, a secant-based prediction operator is embedded in the predictor phase, circumventing the costly assembly and inversion of the global tangent stiffness matrix. The following principal conclusions are drawn from the numerical case studies:

(1)

Compared to the conventional generalized stiffness parameter (GSP), the proposed CGSP demonstrates superior numerical stability, particularly for large increments. Consequently, CGSP serves as a more effective and reliable indicator for adaptive increment-size control in nonlinear path-following analysis.

(2)

The cumulative indicator $S_i$ changes sign precisely as the equilibrium path traverses a limit point, providing a robust and reliable criterion for distinguishing between loading ($S_i$ > 0) and unloading ($S_i$ < 0) regimes.

(3)

The UOIS framework demonstrates strong robustness in tracing complex post-buckling equilibrium paths. Compared to the generalized displacement control method (GDCM), the UOIS maintains solution stability under significantly larger increment sizes and converges along more efficient iterative paths.

(4)

Embedding the secant prediction operator in the predictor phase effectively avoids the assembly and inversion of the global tangent stiffness matrix, with negligible impact on the total number of load steps or iterations. Consequently, this strategy achieves a substantial improvement in the computational efficiency of the incremental-iterative procedure.

The proposed numerical framework, incorporating both the updated orthogonal iterative strategies (UOIS) and the secant prediction operator, is not limited to geometric nonlinearity. It is readily applicable to other challenging problems, such as those involving material nonlinearities and complex path-tracking scenarios.