SA-06-04 Chapter 06 · Matrix Methods of Structural Analysis

Flexibility-Stiffness Duality & Bandwidth Optimization

In this chapter (4 topics)
On this page

1. Introduction & Executive Overview

Matrix Structural Analysis is governed by two complementary and mathematically dual formulations: the Flexibility (Force) Method and the Stiffness (Displacement) Method. While the flexibility method formulates equations of geometric compatibility in terms of redundant forces (DsD_s), the stiffness method formulates equations of static equilibrium in terms of joint displacements (DkD_k). On any kinematically stable, unconstrained elastic structure with identically defined coordinates, these two formulations are exact mathematical inverses:

[K]=[F]−1and[F]=[K]−1[K] = [F]^{-1} \quad \text{and} \quad [F] = [K]^{-1}

In practical computational implementations—such as in ETABS, SAP2000, ANSYS, and OpenSees—the stiffness formulation is universally adopted. However, as civil infrastructure models grow to hundreds of thousands of degrees of freedom, storing and solving full matrices becomes computationally intractable (O(N3)\mathcal{O}(N^3) complexity). Realizing the efficiency of the finite element method depends fundamentally on Matrix Sparsity, Bandwidth Optimization, and the Reverse Cuthill-McKee (RCM) Algorithm, which compresses the structural stiffness matrix into a narrow diagonal band, reducing computational cost from O(N3)\mathcal{O}(N^3) to O(N⋅B2)\mathcal{O}(N \cdot B^2) and storage by over 99%99\%.

                       THE DUALITY & OPTIMIZATION PIPELINE
   ┌────────────────────────────────────────────────────────────────────────┐
   │ 1. Structural Modeling & Discretization (Topology, Graph Adjacency)   │
   │ 2. Bandwidth Minimization: RCM Node Renumbering (Dmax → Minimum)      │
   │ 3. Element Formulation & Contragredience: [k_g] = [T]ᵀ [k_L] [T]       │
   │ 4. Sparse Assembly: Banded / Skyline Profile Global Matrix [K]        │
   │ 5. Matrix Conditioning Inspection: Condition Number κ(K) = λmax/λmin   │
   │ 6. Cholesky Factorization (LLᵀ) along Skyline: Solves [K]{Δ} = {P}    │
   │ 7. Force Inversion Duality: Direct Verification via [F] = [K]⁻¹        │
   └────────────────────────────────────────────────────────────────────────┘

Key Technical Deliverables in This Topic:

  1. Mathematical Proof of Flexibility-Stiffness Duality: Formal derivation proving that [K]=[F]−1[K] = [F]^{-1} using virtual work and identical coordinate bases.
  2. The Principle of Contragredience: Proving the duality of force and displacement transformations ({P}=[A]T{p}\{P\} = [A]^T \{p\} when {d}=[A]{Δ}\{d\} = [A] \{\Delta\}) based on virtual work invariance.
  3. Condition Number κ(K)\kappa(K) & Numerical Stability: Analyzing eigenvalue spreads (λmax⁡/λmin⁡\lambda_{\max}/\lambda_{\min}), ill-conditioning traps, and error amplification bounds (∥δΔ∥∥Δ∥≤κ(K)∥δP∥∥P∥\frac{\|\delta \Delta\|}{\|\Delta\|} \le \kappa(K) \frac{\|\delta P\|}{\|P\|}).
  4. Computational Graph Theory & Bandwidth Optimization: Formulating the half-bandwidth B=(Dmax⁡+1)×DOFB = (D_{\max} + 1) \times \text{DOF}, profile skyline storage, and the step-by-step Reverse Cuthill-McKee (RCM) algorithm.

2. Fundamentals & Physical Mechanics

2.1 The Concept of Duality in Structural Mechanics

In classical mechanics, physical variables occur in conjugate pairs whose product represents work or energy:

  • Kinematic Variables: Displacements, rotations, strains (Δ,θ,ϵ\Delta, \theta, \epsilon).
  • Static Variables: Forces, moments, stresses (P,M,σP, M, \sigma).

This conjugacy establishes the fundamental duality between the Force and Displacement methods:

Feature Flexibility (Force) Method Stiffness (Displacement) Method
Primary Unknowns Redundant forces / moments {R}\{R\} Joint displacements / rotations {Δ}\{\Delta\}
Governing Physical Law Geometric Compatibility of deformations Static Equilibrium of forces and moments
Base / Primary System Statically Determinate Released Base Kinematically Clamped Locked Base
Governing Equation [F]{R}+{DL}={Δs}[F] \{R\} + \{D_L\} = \{\Delta_s\} [K]{Δ}={P}−{PF}[K] \{\Delta\} = \{P\} - \{P_F\}
System Operator Flexibility Matrix [F][F] (compliance) Stiffness Matrix [K][K] (rigidity)
Energy Principle Principle of Minimum Complementary Energy (Π∗\Pi^*) Principle of Minimum Potential Energy (Π\Pi)
Constraint Conditions Natural boundary conditions (forces) Essential boundary conditions (displacements)

2.2 Mathematical Definition of Duality: [K]=[F]−1[K] = [F]^{-1}

Consider an elastic structure supported against rigid-body motion with nn assigned degrees of freedom {D}=[D1,D2,…,Dn]T\{D\} = [D_1, D_2, \dots, D_n]^T and corresponding conjugate forces {P}=[P1,P2,…,Pn]T\{P\} = [P_1, P_2, \dots, P_n]^T.

  1. Flexibility Formulation: Apply forces {P}\{P\}. By linear elasticity and superposition: {D}=[F]{P}\{D\} = [F] \{P\}
  2. Stiffness Formulation: Impose displacements {D}\{D\}. The forces required to maintain these displacements are: {P}=[K]{D}\{P\} = [K] \{D\}

Substituting the displacement expression into the force relation:

{P}=[K]([F]{P})=([K][F]){P}\{P\} = [K] \left( [F] \{P\} \right) = \left( [K] [F] \right) \{P\}

Since this relation must hold for any arbitrary, non-trivial load vector {P}\{P\}:

[K][F]=[I]  ⟹  [K]=[F]−1and[F]=[K]−1[K] [F] = [I] \implies [K] = [F]^{-1} \quad \text{and} \quad [F] = [K]^{-1}

[!IMPORTANT] The inverse relationship [K]=[F]−1[K] = [F]^{-1} is strictly valid if and only if the coordinate numbering, directions, and boundary restraints are identically defined in both formulations. If [F][F] is formulated for redundant forces on a released base while [K][K] is formulated for free joint displacements, [K][K] is NOT the direct inverse of that particular [F][F] because their coordinate bases differ!


3. Mathematical Derivations & Theoretical Formulations

3.1 The Contragredience Principle

Let a structural system have global joint displacements {Δ}\{\Delta\} and corresponding global loads {P}\{P\}. Let internal element deformations be {d}\{d\} and corresponding internal element end forces be {p}\{p\}.

1. Displacement Kinematics:

By geometric compatibility, the internal deformations are related to global joint displacements by a kinematic transformation matrix [A][A]:

{d}=[A]{Δ}\{d\} = [A] \{\Delta\}
2. Virtual Work Invariance:

Consider an arbitrary virtual joint displacement {δΔ}\{\delta \Delta\}. The resulting internal virtual deformations are {δd}=[A]{δΔ}\{\delta d\} = [A] \{\delta \Delta\}. By the Principle of Virtual Work, the external virtual work must equal the internal virtual strain energy:

δWext=δWint\delta W_{\text{ext}} = \delta W_{\text{int}} {δΔ}T{P}={δd}T{p}\{\delta \Delta\}^T \{P\} = \{\delta d\}^T \{p\}

Substituting {δd}=[A]{δΔ}\{\delta d\} = [A] \{\delta \Delta\}:

{δΔ}T{P}=([A]{δΔ})T{p}={δΔ}T[A]T{p}\{\delta \Delta\}^T \{P\} = \left( [A] \{\delta \Delta\} \right)^T \{p\} = \{\delta \Delta\}^T [A]^T \{p\}

Since {δΔ}\{\delta \Delta\} is completely arbitrary:

{P}=[A]T{p}\{P\} = [A]^T \{p\}

This fundamental theorem—that force transforms via the transpose of the displacement transformation matrix ([A]T[A]^T)—is known as the Contragredience Principle.

3. Derivation of Global Stiffness Matrix:

Internal element actions follow the local constitutive stiffness law:

{p}=[klocal]{d}=[klocal][A]{Δ}\{p\} = [k_{\text{local}}] \{d\} = [k_{\text{local}}] [A] \{\Delta\}

Pre-multiplying by [A]T[A]^T:

{P}=[A]T{p}=([A]T[klocal][A]){Δ}\{P\} = [A]^T \{p\} = \left( [A]^T [k_{\text{local}}] [A] \right) \{\Delta\}

Since {P}=[K]{Δ}\{P\} = [K] \{\Delta\}, the global stiffness matrix is:

[K]=[A]T[klocal][A][K] = [A]^T [k_{\text{local}}] [A]
4. Dual Flexibility Formulation:

Conversely, if internal forces are related to external redundants {R}\{R\} by static equilibrium {p}=[B]{R}\{p\} = [B] \{R\}, then by contragredience, external displacements are {D}=[B]T{d}\{D\} = [B]^T \{d\}, leading directly to:

[F]=[B]T[flocal][B][F] = [B]^T [f_{\text{local}}] [B]

3.2 Matrix Conditioning & The Condition Number κ(K)\kappa(K)

In computational structural mechanics, the equilibrium system [K]{Δ}={P}[K] \{\Delta\} = \{P\} is solved numerically using finite-precision floating-point arithmetic. The Condition Number κ(K)\kappa(K) measures the sensitivity of the displacement solution to small perturbations or round-off errors in the applied load vector or matrix coefficients:

κ(K)=∥K∥⋅∥K−1∥=λmax⁡(K)λmin⁡(K)\kappa(K) = \|K\| \cdot \|K^{-1}\| = \frac{\lambda_{\max}(K)}{\lambda_{\min}(K)}

where λmax⁡\lambda_{\max} and λmin⁡\lambda_{\min} are the maximum and minimum eigenvalues of the symmetric positive-definite matrix [K][K].

The Error Amplification Bound:

If the load vector is perturbed by a small error {δP}\{\delta P\} (due to round-off or measurement uncertainty), the resulting relative error in the computed displacements {δΔ}\{\delta \Delta\} is bounded by:

∥δΔ∥∥Δ∥≤κ(K)⋅∥δP∥∥P∥\frac{\|\delta \Delta\|}{\|\Delta\|} \le \kappa(K) \cdot \frac{\|\delta P\|}{\|P\|}
Loss of Precision Rule:

In double-precision arithmetic (≈16\approx 16 decimal digits of precision), the number of significant digits lost during numerical Gaussian elimination or Cholesky factorization is approximately:

Digits Lost≈log⁡10(κ(K))\text{Digits Lost} \approx \log_{10}(\kappa(K))
  • Well-Conditioned System: κ(K)≤103  ⟹  \kappa(K) \le 10^3 \implies Loss of ≤3\le 3 digits (13+13+ reliable digits).
  • Moderately Conditioned: 104≤κ(K)≤107  ⟹  10^4 \le \kappa(K) \le 10^7 \implies Standard for complex frames with shear walls.
  • Ill-Conditioned System: κ(K)≥108  ⟹  \kappa(K) \ge 10^8 \implies Loss of 8+8+ digits; extreme vulnerability to numerical singularity and divergence.
Physical Sources of Ill-Conditioning in Civil Structures:
  1. Extreme Stiffness Contrasts: Connecting very stiff elements (e.g., thick concrete core shear walls with 12EIL3∼108 kN/m\frac{12EI}{L^3} \sim 10^8\text{ kN/m}) directly to flexible steel beams (12EIL3∼103 kN/m\frac{12EI}{L^3} \sim 10^3\text{ kN/m}).
  2. Nearly Unstable Geometry: Shallow trusses or flat arches nearing snap-through instability (λmin⁡→0\lambda_{\min} \rightarrow 0).
  3. Penalty Numbers: Using excessively large artificial spring stiffnesses (101610^{16}) to model rigid boundary supports.

3.3 Computational Graph Theory & Matrix Bandwidth

A framed structure or finite element mesh is topological graph G=(V,E)G = (V, E), where vertices VV represent joints/nodes and edges EE represent structural members. When two nodes ii and jj are connected by a member, the element stiffness matrix deposits non-zero terms into the global submatrices KijK_{ij} and KjiK_{ji}.

1. Maximum Nodal Difference (Dmax⁡D_{\max}):
Dmax⁡=max⁡(i,j)∈E∣i−j∣D_{\max} = \max_{(i, j) \in E} |i - j|

where (i,j)(i, j) represents any pair of nodes connected by an element.

2. Half-Bandwidth (BB):

The half-bandwidth of the global stiffness matrix (including the diagonal) is:

B=(Dmax⁡+1)×DOFper nodeB = (D_{\max} + 1) \times \text{DOF}_{\text{per node}}

All non-zero terms in row ii satisfy ∣i−j∣<B|i - j| < B. Outside this band, all entries are identically zero (Kij≡0K_{ij} \equiv 0 for ∣i−j∣≥B|i - j| \ge B).

3. Skyline / Profile Storage:

In real civil engineering frames, non-zero terms do not fill the entire bandwidth uniformly. The Skyline (Envelope) Scheme stores only the active column height hih_i above the main diagonal for each column ii:

hi=i−mih_i = i - m_i

where mim_i is the row index of the first non-zero entry in column ii. Total storage is ∑i=1Nhi\sum_{i=1}^{N} h_i, which is significantly smaller than the full banded rectangle N×BN \times B.

4. Computational Complexity Scaling:

For a structure with NN total degrees of freedom and half-bandwidth BB:

  • Full Matrix Direct Inversion / Gauss: Storage = O(N2)\mathcal{O}(N^2), Operations (Flops) = 13N3\frac{1}{3} N^3.
  • Banded Cholesky Factorization (LLTLL^T): Storage = O(N⋅B)\mathcal{O}(N \cdot B), Operations (Flops) = O(N⋅B2)\mathcal{O}(N \cdot B^2).
   COMPUTATIONAL EFFICIENCY GAIN:
   Speedup Factor ≈ (1/3 N³) / (N · B²) = 1/3 (N / B)²
   Storage Saving ≈ 1 - (N · B) / N² = 1 - B / N

For N=10,000N = 10,000 and B=50B = 50:

Speedup Factor≈13(10,00050)2=13(200)2=13,333× faster!\text{Speedup Factor} \approx \frac{1}{3} \left(\frac{10,000}{50}\right)^2 = \frac{1}{3} (200)^2 = 13,333\times \text{ faster!} Storage Reduction=1−5010,000=99.5% reduction!\text{Storage Reduction} = 1 - \frac{50}{10,000} = 99.5\% \text{ reduction!}

3.4 The Reverse Cuthill-McKee (RCM) Algorithm

The Reverse Cuthill-McKee (RCM) algorithm is the industry-standard heuristic algorithm for renumbering structural nodes to minimize the profile envelope and half-bandwidth.

Step-by-Step RCM Procedure:
  1. Find a Pseudo-Peripheral Root Node:
    • Compute the degree deg(v)\text{deg}(v) (number of connected members) for all nodes.
    • Select a starting node rr of minimum degree located at an extreme end of the structure.
  2. Breadth-First Search (BFS) Level Sets:
    • Place root node rr in Level 0: L0={r}L_0 = \{r\}.
    • Generate subsequent levels L1,L2,…,LkL_1, L_2, \dots, L_k containing all unvisited neighbors of nodes in the preceding level.
  3. Cuthill-McKee (CM) Ordering:
    • Within each level LmL_m, order the nodes by increasing node degree deg(v)\text{deg}(v).
    • Break ties by ordering according to the order of their parent nodes in Level Lm−1L_{m-1}.
    • This produces the standard Cuthill-McKee sequence: pCM=[v1,v2,…,vn]p_{\text{CM}} = [v_1, v_2, \dots, v_n].
  4. Reversal to Form RCM:
    • Reverse the entire permutation sequence: pRCM(i)=pCM(n−i+1)for i=1,2,…,np_{\text{RCM}}(i) = p_{\text{CM}}(n - i + 1) \quad \text{for } i = 1, 2, \dots, n
    • Assign new node numbers according to this reversed list.

[!TIP] Why Reverse? Alan George (1971) mathematically proved that while CM and RCM have identical maximum bandwidth BB, the Reverse Cuthill-McKee ordering dramatically reduces the profile envelope (∑hi\sum h_i), eliminating fill-in zeros during Cholesky factorization and outperforming plain CM in almost all structural meshes!


4. Engineering Diagrams & Visual Explanations

Figure 1: Flexibility-Stiffness Duality & Contragredience Architecture

The following diagram illustrates the complete duality mapping between force and displacement methods, the contragredience triangle relating external to internal actions, and the condition number stability spectrum.

Flexibility Stiffness Duality and Contragredience
Analytical Breakdown of Figure 1:
  1. Duality Columns: Highlights the symmetry of the formulations. Force methods start from released bases and solve geometric compatibility; displacement methods start from locked bases and solve static equilibrium.
  2. Contragredience Triangle: Demonstrates how the kinematic matrix [A][A] and equilibrium matrix [A]T[A]^T bridge external forces {P}\{P\} and displacements {Δ}\{\Delta\} with internal member actions {p}\{p\} and deformations {d}\{d\}, preserving total work invariance Wext=WintW_{\text{ext}} = W_{\text{int}}.
  3. Conditioning Spectrum: Visualizes the condition number ranges from ideal (κ<103\kappa < 10^3) to ill-conditioned (κ>108\kappa > 10^8), linking eigenvalue spread to floating-point precision loss.

Figure 2: Bandwidth Optimization & Reverse Cuthill-McKee (RCM)

The diagram below details the structural mesh renumbering process, comparing a poorly ordered perimeter mesh against an optimized wavefront mesh, along with the skyline profile storage matrix.

Bandwidth Optimization and RCM Algorithm
Analytical Breakdown of Figure 2:
  1. Mesh Renumbering: In the initial numbering, connected nodes 1 and 8 have difference Dmax⁡=7D_{\max} = 7, creating an excessively wide band. After RCM renumbering, nodes are ordered along concentric wavefronts, collapsing Dmax⁡D_{\max} from 77 down to 22 (a 62.5%62.5\% reduction in half-bandwidth).
  2. Matrix Sparsity Profile: Compares full square storage against banded storage and skyline envelope storage, showing how zero entries outside the active profile are eliminated from computer memory.
  3. 4-Stage Workflow: Summarizes the algorithmic pipeline: Root selection, BFS level set generation, degree sorting, and sequence reversal.

5. Practical Engineering Applications & Software Implementations

  1. Commercial Finite Element Solvers (ETABS, SAP2000, STAAD.Pro):
    • When a civil engineer clicks "Run Analysis" in ETABS, the very first pre-processing step executed by the computational solver engine (e.g., SAPFire Solver) is Automatic Node Renumbering via RCM or Approximate Minimum Degree (AMD).
    • For a 60-story high-rise building with 250,000250,000 active DOFs, raw user node numbering would require over 500 Gigabytes500\text{ Gigabytes} of RAM and days of compute time. RCM renumbering reduces the active bandwidth to under 300300 DOFs, allowing the entire structural system to be solved in under 45 seconds45\text{ seconds} in 8 GB8\text{ GB} of RAM!
  2. Substructuring & Superelements (Static Condensation):
    • When modeling large structures (e.g., an offshore platform or stadium roof), repetitive substructures are condensed: [[Kii][Kib][Kbi][Kbb]][{Δi}{Δb}]=[{Pi}{Pb}]\begin{bmatrix} [K_{ii}] & [K_{ib}] \\ [K_{bi}] & [K_{bb}] \end{bmatrix} \begin{bmatrix} \{\Delta_i\} \\ \{\Delta_b\} \end{bmatrix} = \begin{bmatrix} \{P_i\} \\ \{P_b\} \end{bmatrix} Internal DOFs {Δi}\{\Delta_i\} are eliminated: {Δi}=[Kii]−1({Pi}−[Kib]{Δb})\{\Delta_i\} = [K_{ii}]^{-1} \left( \{P_i\} - [K_{ib}] \{\Delta_b\} \right) [Kcondensed]=[Kbb]−[Kbi][Kii]−1[Kib][K_{\text{condensed}}] = [K_{bb}] - [K_{bi}] [K_{ii}]^{-1} [K_{ib}] This preserves exact flexibility-stiffness duality while shrinking matrix dimensions before global assembly.
  3. Iterative Solvers vs Direct Solvers:
    • Direct Solvers (Cholesky, Sparse LDLT): Optimal for 1D and 2D banded civil frames where BB is small.
    • Iterative Solvers (Preconditioned Conjugate Gradient - PCG): Used for massive 3D solid continuum models (e.g., arch dams, geotechnical soil-structure interaction) where condition number is optimized using Incomplete Cholesky pre-conditioners (M≈K−1M \approx K^{-1}).

6. Comparative Analysis Table

Characteristic / Parameter Full Square Matrix Banded Storage Skyline (Profile) Storage Sparse Matrix (Compressed Row - CSR)
Storage Requirement N2N^2 floating-point words N×BN \times B words ∑i=1Nhi\sum_{i=1}^{N} h_i words 2×NNZ+N+12 \times \text{NNZ} + N + 1 words
Zeros Stored Stores all zero entries (>99%>99\%) Stores zeros within band Stores zeros within profile Stores ZERO zero entries
Solver Algorithm Standard Gaussian / Cholesky Banded Cholesky (LLTLL^T) Active Column Skyline Solver Sparse Multifrontal / PCG
Flop Complexity 13N3\frac{1}{3} N^3 operations O(N⋅B2)\mathcal{O}(N \cdot B^2) operations O(∑hi2)\mathcal{O}\left(\sum h_i^2\right) operations O(N1.5)\mathcal{O}(N^{1.5}) to O(N2)\mathcal{O}(N^2)
Sensitivity to Node Numbering Completely insensitive Extremely sensitive to Dmax⁡D_{\max} Extremely sensitive to Dmax⁡D_{\max} Moderately sensitive (fill-in paths)
Best Civil Application Small academic frames (N<50N < 50) Regular planar frames & beams Medium civil frames & trusses Massive 3D shells & solids (N>105N > 10^5)

7. Worked Numerical Examples

Problem 1: Exact Mathematical Proof of Inversion Duality [K]=[F]−1[K] = [F]^{-1}

Statement: A cantilever beam ABAB has length L=6.0 mL = 6.0\text{ m} and constant flexural rigidity EIEI. Two identical degrees of freedom are established at the free tip BB:

  • Coordinate 1: Upward vertical translation vBv_B (conjugate to upward vertical force P1P_1).
  • Coordinate 2: Counter-clockwise rotation θB\theta_B (conjugate to counter-clockwise moment M2M_2). Using classical mechanics:
  1. Derive the 2×22 \times 2 flexibility matrix [F][F] by applying unit dummy forces and moments at BB.
  2. Invert the flexibility matrix mathematically to obtain [F]−1[F]^{-1}.
  3. Formulate the 2×22 \times 2 stiffness matrix [K][K] directly from Euler-Bernoulli beam theory at the exact same coordinates.
  4. Prove that [K]≡[F]−1[K] \equiv [F]^{-1} and that [K][F]=[I][K][F] = [I] term-by-term.
       ▒▒█                                       ▲ Coord 1 (v_B)
       ▒▒█                                       │
       ▒▒█═══════════════════════════════════════● Coord 2 (θ_B, CCW ↺)
       ▒▒█ (Fixed A)                             B (Free Tip)
       ├────────────────── L = 6.0 m ────────────┤

Solution:

Step 1: Formulate Flexibility Matrix [F][F]

Release the structure at BB (already a determinate cantilever):

  • Apply Unit Upward Force P1=1.0P_1 = 1.0 at Coordinate 1 (M2=0M_2 = 0): The bending moment at distance xx from fixed end AA is M(x)=+P1(L−x)=1.0(6.0−x)M(x) = +P_1 (L - x) = 1.0(6.0 - x) (sagging). Using the Unit Load Method:

    f11=∫0L[M(x)]2EIdx=1EI∫06(6−x)2dx=L33EI=633EI=216.03EI=72.0EI m/kNf_{11} = \int_{0}^{L} \frac{[M(x)]^2}{EI} dx = \frac{1}{EI} \int_{0}^{6} (6 - x)^2 dx = \frac{L^3}{3EI} = \frac{6^3}{3EI} = \frac{216.0}{3EI} = \frac{72.0}{EI}\text{ m/kN}

    Rotation at BB due to unit upward load P1=1.0P_1 = 1.0: The virtual moment for a unit CCW moment at BB is m(x)=+1.0m(x) = +1.0.

    f21=∫0LM(x)⋅m(x)EIdx=1EI∫06(6−x)(1)dx=L22EI=622EI=36.02EI=18.0EI rad/kNf_{21} = \int_{0}^{L} \frac{M(x) \cdot m(x)}{EI} dx = \frac{1}{EI} \int_{0}^{6} (6 - x)(1) dx = \frac{L^2}{2EI} = \frac{6^2}{2EI} = \frac{36.0}{2EI} = \frac{18.0}{EI}\text{ rad/kN}
  • Apply Unit CCW Moment M2=1.0M_2 = 1.0 at Coordinate 2 (P1=0P_1 = 0): The bending moment at all sections is M(x)=+1.0M(x) = +1.0. Deflection at BB:

    f12=∫0Lm(x)⋅(6−x)EIdx=L22EI=18.0EI m/(kN⋅m)f_{12} = \int_{0}^{L} \frac{m(x) \cdot (6 - x)}{EI} dx = \frac{L^2}{2EI} = \frac{18.0}{EI}\text{ m/(kN}\cdot\text{m)}

    (Note: f12=f21=18.0/EIf_{12} = f_{21} = 18.0/EI satisfies Maxwell-Betti reciprocity!)

    Rotation at BB:

    f22=∫0L[m(x)]2EIdx=1EI∫06(1)2dx=LEI=6.0EI rad/(kN⋅m)f_{22} = \int_{0}^{L} \frac{[m(x)]^2}{EI} dx = \frac{1}{EI} \int_{0}^{6} (1)^2 dx = \frac{L}{EI} = \frac{6.0}{EI}\text{ rad/(kN}\cdot\text{m)}

Flexibility Matrix:

[F]=1EI[72.018.018.06.0][F] = \frac{1}{EI} \begin{bmatrix} 72.0 & 18.0 \\ 18.0 & 6.0 \end{bmatrix}

Determinant of [F][F]:

det⁡[F]=1(EI)2[(72.0)(6.0)−(18.0)2]=1(EI)2[432.0−324.0]=108.0(EI)2\det[F] = \frac{1}{(EI)^2} \left[ (72.0)(6.0) - (18.0)^2 \right] = \frac{1}{(EI)^2} [432.0 - 324.0] = \frac{108.0}{(EI)^2}
Step 2: Mathematically Invert [F][F] to Obtain [F]−1[F]^{-1}

Using the standard 2×22 \times 2 matrix inversion formula:

[F]−1=1det⁡[F][f22−f12−f21f11]=(EI)2108.0⋅1EI[6.0−18.0−18.072.0][F]^{-1} = \frac{1}{\det[F]} \begin{bmatrix} f_{22} & -f_{12} \\ -f_{21} & f_{11} \end{bmatrix} = \frac{(EI)^2}{108.0} \cdot \frac{1}{EI} \begin{bmatrix} 6.0 & -18.0 \\ -18.0 & 72.0 \end{bmatrix} [F]−1=EI[6.0108.0−18.0108.0−18.0108.072.0108.0]=EI[118−16−1623]≈EI[0.055556−0.166667−0.1666670.666667][F]^{-1} = EI \begin{bmatrix} \frac{6.0}{108.0} & -\frac{18.0}{108.0} \\ -\frac{18.0}{108.0} & \frac{72.0}{108.0} \end{bmatrix} = EI \begin{bmatrix} \frac{1}{18} & -\frac{1}{6} \\ -\frac{1}{6} & \frac{2}{3} \end{bmatrix} \approx EI \begin{bmatrix} 0.055556 & -0.166667 \\ -0.166667 & 0.666667 \end{bmatrix}
Step 3: Formulate Stiffness Matrix [K][K] Directly

From Euler-Bernoulli beam mechanics, clamping support AA and applying unit kinematic displacements at tip BB:

  • Apply Unit Upward Displacement vB=1.0v_B = 1.0 at Coordinate 1 (θB=0\theta_B = 0): To displace tip BB upward by 1.01.0 while holding slope θB=0\theta_B = 0:

    • The restoring upward transverse force required at BB is: k11=12EIL3=12EI63=12EI216.0=118EIk_{11} = \frac{12EI}{L^3} = \frac{12EI}{6^3} = \frac{12EI}{216.0} = \frac{1}{18} EI
    • When BB moves upward, it naturally slopes counter-clockwise. To clamp the slope to zero (θB=0\theta_B = 0), a clockwise (negative) holding moment must be applied at BB: k21=−6EIL2=−6EI62=−6EI36.0=−16EIk_{21} = -\frac{6EI}{L^2} = -\frac{6EI}{6^2} = -\frac{6EI}{36.0} = -\frac{1}{6} EI
  • Apply Unit CCW Rotation θB=1.0\theta_B = 1.0 at Coordinate 2 (vB=0v_B = 0): To rotate tip BB counter-clockwise by 1.01.0 while holding vertical deflection vB=0v_B = 0:

    • The couple required at BB is: k22=4EIL=4EI6.0=23EIk_{22} = \frac{4EI}{L} = \frac{4EI}{6.0} = \frac{2}{3} EI
    • The transverse force required at BB to prevent translation is downward (negative Coordinate 1): k12=−6EIL2=−16EIk_{12} = -\frac{6EI}{L^2} = -\frac{1}{6} EI

Direct Assembled Stiffness Matrix:

[K]=EI[118−16−1623][K] = EI \begin{bmatrix} \frac{1}{18} & -\frac{1}{6} \\ -\frac{1}{6} & \frac{2}{3} \end{bmatrix}
Step 4: Verification of Duality [K]≡[F]−1[K] \equiv [F]^{-1} and Identity [K][F]=[I][K][F] = [I]

Comparing the direct stiffness matrix [K][K] with [F]−1[F]^{-1}:

[K]=EI[118−16−1623]≡[F]−1(100% Exact Analytical Match!)[K] = EI \begin{bmatrix} \frac{1}{18} & -\frac{1}{6} \\ -\frac{1}{6} & \frac{2}{3} \end{bmatrix} \equiv [F]^{-1} \quad \text{(100\% Exact Analytical Match!)}

Computing the product [K][F][K][F]:

[K][F]=(EI[118−16−1623])(1EI[72.018.018.06.0])[K] [F] = \left( EI \begin{bmatrix} \frac{1}{18} & -\frac{1}{6} \\ -\frac{1}{6} & \frac{2}{3} \end{bmatrix} \right) \left( \frac{1}{EI} \begin{bmatrix} 72.0 & 18.0 \\ 18.0 & 6.0 \end{bmatrix} \right) [K][F]=[7218−1861818−66−726+2(18)3−186+2(6)3]=[4.0−3.01.0−1.0−12.0+12.0−3.0+4.0]=[1.00.00.01.0]=[I][K] [F] = \begin{bmatrix} \frac{72}{18} - \frac{18}{6} & \frac{18}{18} - \frac{6}{6} \\ -\frac{72}{6} + \frac{2(18)}{3} & -\frac{18}{6} + \frac{2(6)}{3} \end{bmatrix} = \begin{bmatrix} 4.0 - 3.0 & 1.0 - 1.0 \\ -12.0 + 12.0 & -3.0 + 4.0 \end{bmatrix} = \begin{bmatrix} 1.0 & 0.0 \\ 0.0 & 1.0 \end{bmatrix} = [I]

The duality is proven with absolute mathematical certainty.


Problem 2: Bandwidth Optimization via Reverse Cuthill-McKee (RCM) Algorithm

Statement: An 8-node planar truss ladder structure consists of two parallel chords with vertical and horizontal members. The initial numbering followed an arbitrary perimeter loop:

  • Top Chord Nodes: 1,2,3,41, 2, 3, 4 (from left to right).
  • Bottom Chord Nodes: 8,7,6,58, 7, 6, 5 (from left to right). The 10 structural member connections (edges) are: (1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,8),(8,1),(2,7),(3,6)(1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 7), (7, 8), (8, 1), (2, 7), (3, 6). Assuming 2 translational degrees of freedom per node (u,vu, v, total DOFs N=16N = 16):
  1. Compute the initial maximum node difference Dmax⁡D_{\max} and initial half-bandwidth BinitialB_{\text{initial}}.
  2. Execute the complete Cuthill-McKee (CM) algorithm step-by-step starting from root node 1.
  3. Apply the Reverse Cuthill-McKee (RCM) ordering.
  4. Calculate the optimized maximum node difference Dmax⁡,RCMD_{\max,\text{RCM}}, optimized half-bandwidth BRCMB_{\text{RCM}}, and the exact percentage reduction in computer storage and equation-solving operations.
       Initial Numbering:
       (1) ═════════ (2) ═════════ (3) ═════════ (4)  ◄── Top Chord
        ║             ║             ║             ║
        ║             ║             ║             ║
       (8) ═════════ (7) ═════════ (6) ═════════ (5)  ◄── Bottom Chord

Solution:

Step 1: Initial Graph Characteristics & Bandwidth

Examine the 10 edges and compute nodal differences ∣i−j∣|i - j|:

  • (1,2)  ⟹  ∣1−2∣=1(1, 2) \implies |1 - 2| = 1
  • (2,3)  ⟹  ∣2−3∣=1(2, 3) \implies |2 - 3| = 1
  • (3,4)  ⟹  ∣3−4∣=1(3, 4) \implies |3 - 4| = 1
  • (4,5)  ⟹  ∣4−5∣=1(4, 5) \implies |4 - 5| = 1
  • (5,6)  ⟹  ∣5−6∣=1(5, 6) \implies |5 - 6| = 1
  • (6,7)  ⟹  ∣6−7∣=1(6, 7) \implies |6 - 7| = 1
  • (7,8)  ⟹  ∣7−8∣=1(7, 8) \implies |7 - 8| = 1
  • (8,1)  ⟹  ∣8−1∣=7(8, 1) \implies |8 - 1| = 7 (Maximum difference!)\quad (\text{Maximum difference!})
  • (2,7)  ⟹  ∣2−7∣=5(2, 7) \implies |2 - 7| = 5
  • (3,6)  ⟹  ∣3−6∣=3(3, 6) \implies |3 - 6| = 3

Initial Maximum Node Difference:

Dmax⁡,initial=7D_{\max,\text{initial}} = 7

Initial Half-Bandwidth (with 2 DOFs per node):

Binitial=(Dmax⁡,initial+1)×DOF=(7+1)×2=8×2=16B_{\text{initial}} = (D_{\max,\text{initial}} + 1) \times \text{DOF} = (7 + 1) \times 2 = 8 \times 2 = 16

Since total DOFs N=8×2=16N = 8 \times 2 = 16, the initial bandwidth spans the entire matrix (B=NB = N), meaning the matrix is completely unbanded!

  • Initial storage = N×B=16×16=256N \times B = 16 \times 16 = 256 words.
Step 2: Node Degrees & Connectivity Table

Count the number of connected members (degree) for each node:

  • Node 1: Connected to {2,8}  ⟹  deg(1)=2\{2, 8\} \implies \text{deg}(1) = 2
  • Node 2: Connected to {1,3,7}  ⟹  deg(2)=3\{1, 3, 7\} \implies \text{deg}(2) = 3
  • Node 3: Connected to {2,4,6}  ⟹  deg(3)=3\{2, 4, 6\} \implies \text{deg}(3) = 3
  • Node 4: Connected to {3,5}  ⟹  deg(4)=2\{3, 5\} \implies \text{deg}(4) = 2
  • Node 5: Connected to {4,6}  ⟹  deg(5)=2\{4, 6\} \implies \text{deg}(5) = 2
  • Node 6: Connected to {3,5,7}  ⟹  deg(6)=3\{3, 5, 7\} \implies \text{deg}(6) = 3
  • Node 7: Connected to {2,6,8}  ⟹  deg(7)=3\{2, 6, 8\} \implies \text{deg}(7) = 3
  • Node 8: Connected to {1,7}  ⟹  deg(8)=2\{1, 7\} \implies \text{deg}(8) = 2
Step 3: Cuthill-McKee (CM) Level Set Traversal

Select pseudo-peripheral root node of minimum degree: Start at Node 1 (deg=2\text{deg} = 2).

  • Level 0 (L0L_0):

    L0={1}L_0 = \{1\}

    Queue: [1]

  • Level 1 (L1L_1): Neighbors of Node 1: Neighbors are {2,8}\{2, 8\}. Check degrees: deg(8)=2,deg(2)=3\text{deg}(8) = 2, \text{deg}(2) = 3. Sort by increasing degree: 8, 2. Queue: [1, 8, 2]

  • Level 2 (L2L_2): Neighbors of Level 1 Nodes:

    • Unvisited neighbors of Node 8: {7}\{7\} (deg(7)=3\text{deg}(7) = 3).
    • Unvisited neighbors of Node 2: {3}\{3\} (deg(3)=3\text{deg}(3) = 3). (Node 7 is already added). Add in order: 7, 3. Queue: [1, 8, 2, 7, 3]
  • Level 3 (L3L_3): Neighbors of Level 2 Nodes:

    • Unvisited neighbors of Node 7: {6}\{6\} (deg(6)=3\text{deg}(6) = 3).
    • Unvisited neighbors of Node 3: {4}\{4\} (deg(4)=2\text{deg}(4) = 2). (Node 6 is shared). Sort by increasing degree: deg(4)=2<deg(6)=3  ⟹  ‘4,6‘\text{deg}(4) = 2 < \text{deg}(6) = 3 \implies `4, 6`. Queue: [1, 8, 2, 7, 3, 4, 6] (or [1, 8, 2, 7, 3, 6, 4]).
  • Level 4 (L4L_4): Neighbors of Level 3 Nodes:

    • Unvisited neighbor of Node 4/6: {5}\{5\} (deg(5)=2\text{deg}(5) = 2). Queue: [1, 8, 2, 7, 3, 6, 4, 5]

Cuthill-McKee Ordering:

pCM=[1,8,2,7,3,6,4,5]p_{\text{CM}} = [1, 8, 2, 7, 3, 6, 4, 5]
Step 4: Reverse Cuthill-McKee (RCM) Reversal

Reverse the CM permutation list:

pRCM=[5,4,6,3,7,2,8,1]p_{\text{RCM}} = [5, 4, 6, 3, 7, 2, 8, 1]

Assign new labels (1,2,…,81, 2, \dots, 8) according to this reversed list:

  • Old Node 5 →\rightarrow New Node 1
  • Old Node 4 →\rightarrow New Node 2
  • Old Node 6 →\rightarrow New Node 3
  • Old Node 3 →\rightarrow New Node 4
  • Old Node 7 →\rightarrow New Node 5
  • Old Node 2 →\rightarrow New Node 6
  • Old Node 8 →\rightarrow New Node 7
  • Old Node 1 →\rightarrow New Node 8
       RCM Optimized Renumbering:
       (8) ═════════ (6) ═════════ (4) ═════════ (2)  ◄── Top Chord
        ║             ║             ║             ║
        ║             ║             ║             ║
       (7) ═════════ (5) ═════════ (3) ═════════ (1)  ◄── Bottom Chord
Step 5: Evaluate RCM Bandwidth Reduction

Re-compute all member nodal differences with the new node numbers:

  • Old (1,2)→(1, 2) \rightarrow New (8,6)  ⟹  ∣8−6∣=2(8, 6) \implies |8 - 6| = 2
  • Old (2,3)→(2, 3) \rightarrow New (6,4)  ⟹  ∣6−4∣=2(6, 4) \implies |6 - 4| = 2
  • Old (3,4)→(3, 4) \rightarrow New (4,2)  ⟹  ∣4−2∣=2(4, 2) \implies |4 - 2| = 2
  • Old (4,5)→(4, 5) \rightarrow New (2,1)  ⟹  ∣2−1∣=1(2, 1) \implies |2 - 1| = 1
  • Old (5,6)→(5, 6) \rightarrow New (1,3)  ⟹  ∣1−3∣=2(1, 3) \implies |1 - 3| = 2
  • Old (6,7)→(6, 7) \rightarrow New (3,5)  ⟹  ∣3−5∣=2(3, 5) \implies |3 - 5| = 2
  • Old (7,8)→(7, 8) \rightarrow New (5,7)  ⟹  ∣5−7∣=2(5, 7) \implies |5 - 7| = 2
  • Old (8,1)→(8, 1) \rightarrow New (7,8)  ⟹  ∣7−8∣=1(7, 8) \implies |7 - 8| = 1
  • Old (2,7)→(2, 7) \rightarrow New (6,5)  ⟹  ∣6−5∣=1(6, 5) \implies |6 - 5| = 1
  • Old (3,6)→(3, 6) \rightarrow New (4,3)  ⟹  ∣4−3∣=1(4, 3) \implies |4 - 3| = 1

New Maximum Node Difference:

Dmax⁡,RCM=2(Reduced from 7!)D_{\max,\text{RCM}} = 2 \quad (\text{Reduced from } 7!)

New Half-Bandwidth:

BRCM=(Dmax⁡,RCM+1)×2=(2+1)×2=3×2=6B_{\text{RCM}} = (D_{\max,\text{RCM}} + 1) \times 2 = (2 + 1) \times 2 = 3 \times 2 = 6
Summary of Optimization Metrics:
  1. Half-Bandwidth Reduction: Reduction=16−616×100%=1016×100%=62.5% reduction\text{Reduction} = \frac{16 - 6}{16} \times 100\% = \frac{10}{16} \times 100\% = 62.5\% \text{ reduction}
  2. Matrix Storage Reduction:
    • Initial Banded Storage: 16×16=25616 \times 16 = 256 words.
    • RCM Banded Storage: 16×6=9616 \times 6 = 96 words.
    Storage Savings=256−96256×100%=62.5% memory saved!\text{Storage Savings} = \frac{256 - 96}{256} \times 100\% = 62.5\% \text{ memory saved!}
  3. Cholesky Solver Operations (O(N⋅B2)\mathcal{O}(N \cdot B^2)):
    • Initial Operations: 16×162=16×256=409616 \times 16^2 = 16 \times 256 = 4096 flops.
    • RCM Operations: 16×62=16×36=57616 \times 6^2 = 16 \times 36 = 576 flops.
    Computational Speedup=4096576≈7.11× faster (85.94% reduction in CPU time!)\text{Computational Speedup} = \frac{4096}{576} \approx 7.11\times \text{ faster (85.94\% reduction in CPU time!)}

Problem 3: Condition Number & Load Perturbation Error Sensitivity

Statement: A 2-DOF structural model has a stiffness matrix representing a stiff core element (k1=1000.0 kN/mk_1 = 1000.0\text{ kN/m}) coupled to a flexible frame element (k2=1.0 kN/mk_2 = 1.0\text{ kN/m}):

[K]=[k1+k2−k2−k2k2]=[1001.0−1.0−1.01.0] kN/m[K] = \begin{bmatrix} k_1 + k_2 & -k_2 \\ -k_2 & k_2 \end{bmatrix} = \begin{bmatrix} 1001.0 & -1.0 \\ -1.0 & 1.0 \end{bmatrix}\text{ kN/m}
  1. Calculate the exact eigenvalues λmax⁡,λmin⁡\lambda_{\max}, \lambda_{\min} and the condition number κ(K)\kappa(K).
  2. For a nominal applied load vector {P}=[1000.0,0.0]T kN\{P\} = [1000.0, 0.0]^T\text{ kN}, calculate the nominal displacement vector {Δ}\{\Delta\}.
  3. Introduce a tiny load perturbation {δP}=[0.0,1.0]T kN\{\delta P\} = [0.0, 1.0]^T\text{ kN} (representing a 0.1000%0.1000\% lateral error).
  4. Calculate the resulting perturbed displacement vector {Δ+δΔ}\{\Delta + \delta \Delta\} and determine the relative error amplification factor.

Solution:

Step 1: Eigenvalues & Condition Number κ(K)\kappa(K)

The characteristic equation det⁡([K]−λ[I])=0\det([K] - \lambda [I]) = 0 is:

det⁡[1001.0−λ−1.0−1.01.0−λ]=0\det \begin{bmatrix} 1001.0 - \lambda & -1.0 \\ -1.0 & 1.0 - \lambda \end{bmatrix} = 0 (1001.0−λ)(1.0−λ)−(−1.0)2=0  ⟹  λ2−1002.0λ+1001.0−1.0=0(1001.0 - \lambda)(1.0 - \lambda) - (-1.0)^2 = 0 \implies \lambda^2 - 1002.0 \lambda + 1001.0 - 1.0 = 0 λ2−1002.0λ+1000.0=0\lambda^2 - 1002.0 \lambda + 1000.0 = 0

Solving the quadratic equation:

λ=1002.0±(1002.0)2−4(1)(1000.0)2=1002.0±1,004,004.0−4000.02=1002.0±1,000,004.02\lambda = \frac{1002.0 \pm \sqrt{(1002.0)^2 - 4(1)(1000.0)}}{2} = \frac{1002.0 \pm \sqrt{1,004,004.0 - 4000.0}}{2} = \frac{1002.0 \pm \sqrt{1,000,004.0}}{2} 1,000,004.0≈1000.001999998\sqrt{1,000,004.0} \approx 1000.001999998 λmax⁡=1002.0+1000.00202=2002.00202=1001.0010 kN/m\lambda_{\max} = \frac{1002.0 + 1000.0020}{2} = \frac{2002.0020}{2} = 1001.0010\text{ kN/m} λmin⁡=1002.0−1000.00202=1.99802=0.9990 kN/m\lambda_{\min} = \frac{1002.0 - 1000.0020}{2} = \frac{1.9980}{2} = 0.9990\text{ kN/m}

Condition Number:

κ(K)=λmax⁡λmin⁡=1001.00100.9990≈1002.00\kappa(K) = \frac{\lambda_{\max}}{\lambda_{\min}} = \frac{1001.0010}{0.9990} \approx 1002.00
Step 2: Nominal Displacement Solution

The inverse of [K][K]:

det⁡[K]=(1001.0)(1.0)−(−1.0)2=1001.0−1.0=1000.0\det[K] = (1001.0)(1.0) - (-1.0)^2 = 1001.0 - 1.0 = 1000.0 [K]−1=11000.0[1.01.01.01001.0]=[0.00100.00100.00101.0010] m/kN[K]^{-1} = \frac{1}{1000.0} \begin{bmatrix} 1.0 & 1.0 \\ 1.0 & 1001.0 \end{bmatrix} = \begin{bmatrix} 0.0010 & 0.0010 \\ 0.0010 & 1.0010 \end{bmatrix}\text{ m/kN}

For nominal load {P}=[1000.0,0.0]T kN\{P\} = [1000.0, 0.0]^T\text{ kN}:

{Δ}=[K]−1{P}=[0.0010(1000.0)+0.0010(0)0.0010(1000.0)+1.0010(0)]=[1.00001.0000] m\{\Delta\} = [K]^{-1} \{P\} = \begin{bmatrix} 0.0010(1000.0) + 0.0010(0) \\ 0.0010(1000.0) + 1.0010(0) \end{bmatrix} = \begin{bmatrix} 1.0000 \\ 1.0000 \end{bmatrix}\text{ m}

Euclidean norm of nominal displacement:

∥Δ∥=1.02+1.02=2.0≈1.414214 m\|\Delta\| = \sqrt{1.0^2 + 1.0^2} = \sqrt{2.0} \approx 1.414214\text{ m}

Euclidean norm of nominal load:

∥P∥=1000.0 kN\|P\| = 1000.0\text{ kN}
Step 3: Perturbed Solution

The perturbed load is {P+δP}=[1000.0,1.0]T kN\{P + \delta P\} = [1000.0, 1.0]^T\text{ kN} with {δP}=[0.0,1.0]T kN\{\delta P\} = [0.0, 1.0]^T\text{ kN}. Relative load perturbation:

∥δP∥∥P∥=1.01000.0=0.0010=0.1000%\frac{\|\delta P\|}{\|P\|} = \frac{1.0}{1000.0} = 0.0010 = 0.1000\%

Computing the change in displacements {δΔ}=[K]−1{δP}\{\delta \Delta\} = [K]^{-1} \{\delta P\}:

{δΔ}=[0.00100.00100.00101.0010][0.01.0]=[0.00101.0010] m\{\delta \Delta\} = \begin{bmatrix} 0.0010 & 0.0010 \\ 0.0010 & 1.0010 \end{bmatrix} \begin{bmatrix} 0.0 \\ 1.0 \end{bmatrix} = \begin{bmatrix} 0.0010 \\ 1.0010 \end{bmatrix}\text{ m}

Total perturbed displacements:

{Δperturbed}=[1.0000+0.00101.0000+1.0010]=[1.00102.0010] m\{\Delta_{\text{perturbed}}\} = \begin{bmatrix} 1.0000 + 0.0010 \\ 1.0000 + 1.0010 \end{bmatrix} = \begin{bmatrix} 1.0010 \\ 2.0010 \end{bmatrix}\text{ m}
Step 4: Error Amplification Ratio

Norm of displacement error:

∥δΔ∥=(0.0010)2+(1.0010)2=0.000001+1.002001≈1.001000 m\|\delta \Delta\| = \sqrt{(0.0010)^2 + (1.0010)^2} = \sqrt{0.000001 + 1.002001} \approx 1.001000\text{ m}

Relative displacement error:

∥δΔ∥∥Δ∥=1.0010001.414214≈0.707814=70.7814%\frac{\|\delta \Delta\|}{\|\Delta\|} = \frac{1.001000}{1.414214} \approx 0.707814 = 70.7814\%

Error Amplification Factor:

Amplification=∥δΔ∥/∥Δ∥∥δP∥/∥P∥=0.7078140.001000≈707.81\text{Amplification} = \frac{\|\delta \Delta\| / \|\Delta\|}{\|\delta P\| / \|P\|} = \frac{0.707814}{0.001000} \approx 707.81

Notice that:

Amplification=707.81≤κ(K)=1002.00\text{Amplification} = 707.81 \le \kappa(K) = 1002.00

A tiny 0.1%0.1\% disturbance in the applied load vector produced a massive 70.78%70.78\% shift in structural deflections! This proves mathematically how ill-conditioned stiffness matrices amplify small numerical uncertainties into major structural calculation errors.


8. Exam-Oriented Traps, Common Errors & Misconceptions

[!CAUTION] Trap 1: Assuming Inversion Duality Holds for Unequal Coordinate Bases Students frequently write that the flexibility matrix formulated for member redundants (DsD_s) is the inverse of the global stiffness matrix formulated for joint translations (DkD_k). This is completely FALSE! [K]=[F]−1[K] = [F]^{-1} holds only when both matrices describe the exact same degrees of freedom on the exact same structure. If one matrix describes joint translations and the other describes member end moments, they are not direct inverses.

[!WARNING] Trap 2: Forgetting to Reverse the Cuthill-McKee Sequence Standard Cuthill-McKee (CM) minimizes the maximum bandwidth BB, but often leaves a broad profile envelope. The Reverse (RCM) step reverses the node list (pRCM(i)=pCM(N−i+1)p_{\text{RCM}}(i) = p_{\text{CM}}(N - i + 1)). Forgetting the reversal step will fail the profile optimization requirements in competitive examinations and FEA pre-processors!

[!NOTE] Misconception 3: "A Symmetric Matrix is Always Well-Conditioned" All elastic structural stiffness matrices are symmetric and positive definite (kij=kji,det⁡[K]>0k_{ij} = k_{ji}, \det[K] > 0). However, symmetry does NOT prevent ill-conditioning. A matrix can be perfectly symmetric but have λmax⁡/λmin⁡=1012\lambda_{\max} / \lambda_{\min} = 10^{12}, leading to total catastrophic loss of numerical precision!


9. Competitive Examination Key Points & Memory Triggers

  1. Matrix Duality Relationships:
    • Global: [K]=[F]−1[K] = [F]^{-1} and [F]=[K]−1[F] = [K]^{-1}
    • Contragredience: [K]=[A]T[k][A][K] = [A]^T [k] [A] and [F]=[B]T[f][B][F] = [B]^T [f] [B]
  2. Half-Bandwidth Formula: B=(Dmax⁡+1)×DOFB = (D_{\max} + 1) \times \text{DOF}
    • Dmax⁡=max⁡∣i−j∣D_{\max} = \max |i - j| across all interconnected nodes.
  3. RCM Selection Rules:
    • Always choose a starting root node rr with minimum degree located on the physical boundary/extremity of the mesh.
    • Within each level set, sort neighbors in ascending order of node degree.
  4. Cholesky Complexity Rule:
    • Solving a banded matrix scales as O(N⋅B2)\mathcal{O}(N \cdot B^2).
    • Reducing bandwidth by a factor of 2 accelerates matrix solution time by a factor of 22=4×2^2 = 4\times!

10. Previous Year & Model Examination Questions

Question 1 (GATE CE)

If the flexibility matrix of a two-degree-of-freedom structural system is given by [F]=[2111][F] = \begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}, then the stiffness matrix [K][K] of the system is:

  • (A) [1−1−12]\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}
  • (B) [2−1−11]\begin{bmatrix} 2 & -1 \\ -1 & 1 \end{bmatrix}
  • (C) [1112]\begin{bmatrix} 1 & 1 \\ 1 & 2 \end{bmatrix}
  • (D) [−122−1]\begin{bmatrix} -1 & 2 \\ 2 & -1 \end{bmatrix}

Answer: (A) Explanation: By duality, [K]=[F]−1[K] = [F]^{-1}.

det⁡[F]=(2)(1)−(1)(1)=2−1=1\det[F] = (2)(1) - (1)(1) = 2 - 1 = 1 [K]=1det⁡[F][f22−f12−f21f11]=11[1−1−12][K] = \frac{1}{\det[F]} \begin{bmatrix} f_{22} & -f_{12} \\ -f_{21} & f_{11} \end{bmatrix} = \frac{1}{1} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}

Question 2 (UPSC ESE)

In finite element structural analysis, the Reverse Cuthill-McKee (RCM) algorithm is primarily employed to:

  • (A) Invert the stiffness matrix directly without factorization
  • (B) Renumber nodes to minimize the matrix bandwidth and profile envelope
  • (C) Compute the fundamental natural frequency of vibration
  • (D) Eliminate non-linear geometric terms in large-deflection problems

Answer: (B) Explanation: RCM is a graph-theoretical heuristic node renumbering algorithm designed to reduce the maximum difference between connected nodes (Dmax⁡D_{\max}), thereby minimizing the matrix bandwidth BB and skyline profile envelope to optimize storage and solution time.


Question 3 (State AE / SSC JE)

If the maximum difference between connected node numbers in a plane truss with 2 DOFs per node is 4, the half-bandwidth (including the main diagonal) of the global stiffness matrix is:

  • (A) 5
  • (B) 8
  • (C) 10
  • (D) 12

Answer: (C) Explanation: B=(Dmax⁡+1)×DOF=(4+1)×2=5×2=10B = (D_{\max} + 1) \times \text{DOF} = (4 + 1) \times 2 = 5 \times 2 = 10.


11. Summary & Quick Revision Formula Sheet

Concept / Metric Mathematical Expression Physical Context & Remarks
Inversion Duality [K]=[F]−1,[F]=[K]−1[K] = [F]^{-1}, \quad [F] = [K]^{-1} Holds for identical coordinate definitions
Contragredience {P}=[A]T{p}  ⟺  {d}=[A]{Δ}\{P\} = [A]^T \{p\} \iff \{d\} = [A] \{\Delta\} Force transforms via transpose of displacement matrix
Global Stiffness Assembly [K]=[A]T[klocal][A][K] = [A]^T [k_{\text{local}}] [A] Virtual work energy conservation
Condition Number κ(K)=λmax⁡λmin⁡\kappa(K) = \frac{\lambda_{\max}}{\lambda_{\min}} Measures sensitivity to numerical perturbations
Error Bound ∥δΔ∥∥Δ∥≤κ(K)∥δP∥∥P∥\frac{\|\delta \Delta\|}{\|\Delta\|} \le \kappa(K) \frac{\|\delta P\|}{\|P\|} Upper bound on displacement solution error
Half-Bandwidth B=(Dmax⁡+1)×DOFB = (D_{\max} + 1) \times \text{DOF} Defines the active computational band
Banded Flop Count Flops≈O(N⋅B2)\text{Flops} \approx \mathcal{O}(N \cdot B^2) Banded Cholesky elimination complexity
RCM Permutation pRCM(i)=pCM(N−i+1)p_{\text{RCM}}(i) = p_{\text{CM}}(N - i + 1) Reversal step that minimizes profile envelope

12. References & Standard Code Provisions

  1. Cuthill, E., & McKee, J. (1969) — Reducing the Bandwidth of Sparse Symmetric Matrices, Proceedings of the 24th National Conference of the ACM.
  2. George, A. (1971) — Computer Implementation of the Finite Element Method, Stanford University Technical Report (Proving the mathematical superiority of RCM over CM).
  3. Gere, J. M., & Weaver, W. — Matrix Analysis of Framed Structures, 3rd Edition, Van Nostrand Reinhold.
  4. Bathe, K. J. — Finite Element Procedures, Prentice Hall (Detailed treatment of Skyline solver and Condition Number).
  5. Cook, R. D., Malkus, D. S., Plesha, M. E., & Witt, R. J. — Concepts and Applications of Finite Element Analysis, 4th Edition, John Wiley & Sons.
About this page’s source
Topic ID
SA-06-04 (from metadata/sync_topic.py MAPPINGS)
Source file
notes/structural_analysis/06_matrix_methods/04_flexibility_stiffness_duality_bandwidth.md
Presentation changes
  • Leading title heading and bold Key: value metadata lines shown in the page header instead of the body
  • Correction C-005 applied: An unescaped "%" starts a TeX comment, which silently discards the rest of the formula (including closing braces) and makes it fail to typeset.
  • Correction C-006 applied: An unescaped "%" starts a TeX comment, which silently discards the rest of the formula (including closing braces) and makes it fail to typeset.
  • Display-math fences normalised at render time (77 block(s); TeX unchanged)