1. Introduction
Flexible multibody systems are widely used across various engineering fields to model mechanical systems, including aerospace, robotics, and automotive applications. As these systems become increasingly sophisticated and operate in diverse environments, it is essential to consider multiple factors to ensure accurate analysis and design. Among these factors, thermal expansion alters material stiffness and induces stress gradients, thereby modifying the dynamic response of flexible bodies. Thermal phenomena are common in many engineering applications, including brake disk systems [
1,
2], machine tool systems [
3,
4], and aircraft systems [
5,
6]. Consequently, thermomechanical coupling has become a growing area of research interest in recent years [
7,
8,
9,
10,
11].
For analyzing thermomechanical coupling systems, the finite element method (FEM) has long been the standard tool for modeling and predicting dynamic responses [
12,
13,
14,
15]. However, when the system involves significant rotational motion or kinematic joint constraints, the nonlinear inertial effects dramatically increase the computational cost. Furthermore, reducing element size to improve numerical accuracy increases the degrees of freedom (DOF), thereby exacerbating the computational burden.
To address these challenges, model order reduction (MOR) techniques have been developed as computational strategies to reduce system dimensionality while preserving essential dynamic characteristics [
16,
17]. The fundamental principle of MOR is to select optimal basis functions that span the solution spaces of deformation and temperature fields in thermomechanical systems. Through mathematical projection techniques such as the Galerkin method, these basis functions enable the construction of reduced-order dynamic models [
18,
19,
20]. Prominent MOR approaches include modal truncation [
21,
22], moment matching [
23,
24], and proper orthogonal decomposition (POD) [
25,
26,
27,
28]. In modal truncation, structural mode shapes obtained from eigenvalue analysis are employed to approximate the coupled deformation-temperature fields. Nevertheless, the inherent thermal coupling introduces nonsymmetric stiffness matrix components that violate the orthogonality condition required for conventional modal superposition [
29]. This limitation necessitates the inclusion of additional mode shapes to satisfy multiphysics boundary conditions, including mechanical constraints (joint forces or external loads) and thermal excitation conditions (heat sources). This inherent limitation of mode superposition methods motivates the use of data-driven alternatives. The POD-based approach constructs empirical basis functions by performing a singular value decomposition (SVD) of snapshot matrices obtained from numerical simulations or experimental measurements [
18,
30]. However, the Galerkin projection step that follows POD still requires operations on the full-order system matrices, which become computationally expensive for nonlinear problems, thereby diminishing the overall efficiency gains expected from model reduction. To address this issue, hyper-reduction techniques have been developed. Hyper-reduction methods can be broadly classified into two categories [
31]. Approximate-then-project methods (AP), such as the discrete empirical interpolation method (DEIM) and Gauss-Newton with approximate tensors (GNAT)—first approximate the nonlinear terms in the full order space using interpolation at strategically selected sampling points, and then project these approximations onto the reduced subspace [
32]. Project-then-approximate (PA) methods, such as the energy-conserving sampling and weighting (ECSW) and the empirical cubature method (ECM)—first project the governing equations onto the reduced subspace and then approximate the resulting projected integrals using reduced quadrature rules on a sample mesh [
33].
Despite their effectiveness, hyper-reduction methods face three fundamental limitations common to both categories [
31]. First, they impose high offline data requirements: beyond the state-variable snapshots needed for standard POD methods, AP methods require nonlinear force snapshots, while PA methods require element-level nonlinear forces, doubling the computational cost and storage requirements. Second, the singular values of the data used to construct the approximation bases often decay slowly for strongly nonlinear or multiphysics problems, necessitating a large number of sampling points to achieve acceptable accuracy. When the number of sampling points approaches the full-order model size, the efficiency gain vanishes, and AP methods such as DEIM can also suffer from numerical instability when the selected points yield an ill-conditioned interpolation matrix. Third, in both AP and PA methods, the sampling points are selected offline via deterministic algorithms and remain fixed throughout the online phase, offering no adaptability to evolving system dynamics—a critical shortcoming for thermomechanical coupling problems where the active regions of thermal and mechanical fields shift over time. These limitations motivate the development of alternative paradigms that circumvent the Galerkin projection framework, eliminate the need for nonlinear force snapshots, and offer greater flexibility in sampling.
To overcome these limitations, compressive sensing (CS) has emerged as a promising alternative for model reduction [
34,
35], enabling the recovery of sparse solutions from underdetermined systems without relying on offline-fixed subspaces [
36]. A preliminary version of this CS-based framework was developed in our previous work for purely flexible multibody systems using modal bases [
37]. However, the direct extension to thermomechanical coupling is nontrivial for two reasons. First, modal bases are derived from linearized eigenvalue analysis and lack the capacity to capture the evolving thermal subspace, making them unsuitable for problems with thermal effects. Second, the coupling between the thermal and mechanical fields introduces high coherence in the system matrix, undermining the stability of
l1 recovery.
In this article, we propose a fundamentally different paradigm for nonlinear model reduction. In contrast to both AP and PA hyper-reduction methods, which either approximate-then-project or project-then-approximate, the proposed framework completely bypasses Galerkin projection. Instead of approximating nonlinear terms at any stage, it directly samples the full-order governing equations online, including their nonlinear terms, and recovers the coefficients via compressed sensing, thereby avoiding explicit approximation of the nonlinearities. The key idea is to represent the solution using POD basis vectors, assuming the corresponding coefficients are sparse. It is worth noting that the framework itself is not restricted to POD and supports any basis that provides a sparse representation of the state variables, including overcomplete and traditional bases. This sparsity assumption enables the use of l1 norm optimization to reconstruct the entire dynamic response from a small number of sampled equations.
A key challenge in compressed sensing is the high coherence of the measurement matrix, which can significantly degrade the performance of the sparse recovery algorithm [
35,
36]. The underdetermined system of equations arising from the online sampling strategy is analogous to a compressed sensing measurement system, where the coefficient matrix also exhibits high coherence. This coherence is further exacerbated by the coupling between thermal and mechanical fields in thermomechanical systems, leading to an ill-conditioned recovery problem. To address this coherence issue, preconditioning is an effective strategy for reducing the coherence of underdetermined linear systems in sparse recovery [
38,
39,
40]. Recent advances have extended this idea by transforming the system matrix into an incoherent unit-norm tight frame (UNTF), a structure known to facilitate stable sparse recovery [
38,
39]. Inspired by these developments, we construct a UNTF-based preconditioner that reduces the coherence of the sampled thermomechanical system matrix without increasing its dimension. This preconditioning strategy stabilizes the
l1 solver, ensuring robust and accurate recovery for thermomechanical coupling problems.
The main contributions of this article are summarized as follows.
- (1)
A projection-free sparse-solving paradigm is proposed for nonlinear model reduction, where the full-order discretized equations are directly sampled online and the reduced coefficients are recovered via compressed sensing. The paradigm eliminates the need for Galerkin projection and nonlinear force snapshots, and is extended to thermomechanical coupling by adopting data-driven bases for sparse representation of both elastic and thermal fields.
- (2)
A UNTF-based preconditioning strategy is developed to address the high coherence of the underdetermined system matrix arising from the sampled thermomechanical equations, ensuring stable and accurate l1 solver convergence.
The remainder of this paper is organized as follows.
Section 2 introduces the background on thermomechanical dynamics, the POD method, and the
l1 norm optimization.
Section 3 derives the sparse POD coefficients
l1 norm problem constrained by a few thermomechanical coupling dynamic equations and presents the UNTF-based preconditioning procedure.
Section 4 validates the proposed method with numerical examples. Finally,
Section 5 concludes the paper with a summary of the key findings.
3. Sparse Model Reduction Method for Thermomechanical Dynamic Systems via l1 Norm Framework
In this section, a project-free sparse reduction framework for thermomechanical dynamic systems is proposed. The proposed method directly samples online the full-order governing equations and recovers the reduced coefficients via compressed sensing. The dynamic response is formulated as an l1 norm optimization problem subject to a few sampled equation constraints. An UNTF-based preconditioning strategy is developed to ensure stability. The implementation details are described in the following subsections.
3.1. l1 Norm Problem for Thermomechanical Dynamic Systems
3.1.1. Sparse Representation of Elastic and Thermal Coordinates by POD
In this article, the elastic coordinates and thermal coordinates are transformed to POD coefficients by full columns of
in Equation (10). Because only a few coefficients play a major role in approximating the elastic and thermal field, the coefficients are sparse or approximately sparse. Supposing there are
Nb flexible bodies in the system, the generalized coordinates can be expressed as:
where
,
and
are the rigid, flexible, and thermal coordinates of the whole system, respectively (
nr,
nf and
nT are the number of rigid, flexible, and thermal coordinates of the whole system).
and
represent the coefficients transformed by POD.
and
are the transformed matrices of the whole system, which can be expressed as:
where
and
are the elastic and thermal transformed matrices of the
ith flexible body (
and
are the number of the flexible and thermal coordinates of the
ith flexible body, respectively), which are calculated by Equation (10). Combining the Lagrange multipliers
, we can get that:
Since the sizes of the elastic and thermal coordinates are larger than the rigid coordinates and the Lagrange multipliers, the vector c can be viewed as the sparse coefficients if the pf and pT are sparse.
Remark 1.
The dimensions of the POD basis matrices
and
are not required to match the original full-order dimensions. In this work, they are set to the full-order sizes for generality. More generally,
and
can be chosen with reduced dimensions as long as the resulting coefficients
and
admit a sparse representation. This flexibility is a key feature of the proposed framework, as it allows the use of any basis that enables sparse representation of the state variables—including overcomplete bases or data-driven dictionaries—without being restricted to a fixed dimension.
3.1.2. Online Sampling of the Governing Equations
The full-order thermomechanical dynamic equations for the entire system are assembled from the contributions of each body and the constraints. Instead of projecting these equations onto a reduced subspace (as in hyper-reduction), we directly sample a small number of equations from the full-order system. The sampling is performed independently for each flexible body.
A more detailed expression for the
ith flexible body of the thermomechanical dynamic equations should be considered when designing the sampling matrix. The equations can be divided into three parts: the equations related to the rigid, elastic, and thermal coordinates. Since the elastic and thermal coordinates are transformed into sparse coefficients, the sampling matrix would be focused on the elastic and thermal equations. The sampling equations can be expressed as follows:
The identity matrix, denoted as
I, serves as the unit matrix in the above equations. The matrices
and
are used as sampling matrices corresponding to the elastic and thermal components, respectively. The matrix
represents the mass associated with the position and rotation of the flexible body, while
denotes the coupling between rigid motion and elastic deformation. Additionally,
corresponds to the mass matrix associated with elastic deformation. The force vector
accounts for external forces as well as quadratic velocity terms related to the rigid body coordinates. In this study, the matrices
and
are designed to selectively retain specific equations from Equation (18) concerning the flexible and thermal coordinates, while discarding the rest. Consequently, the sampling matrices can be defined as follows:
The vectors
and
represent the indices of the retained equations associated with the flexible and thermal coordinates, respectively. The notation
corresponds to the rows of the unit matrix selected based on these indices
. The specific indices
and
are determined using the Latin Hypercube sampling method in this article. Equation (18) can be reformulated as follows:
Supposing the
ith flexible body dimensions of flexible and thermal coordinates are
and
, respectively, the scale of dynamic Equation (18) is reduced by
, where
and
represent the sampling size with respect to the flexible and thermal parts. If
and
, the scale of dynamic equations would be reduced dramatically. After designing the sampling matrix for each flexible body, the whole set of dynamic equations can be simplified as follows:
where
represents the sampling matrix or vector. Since Equation (21) represents a nonlinear underdetermined dynamic system after sampling by
and
, it admits infinitely many solutions. To obtain an accurate solution, sparsity of the coefficients must be imposed.
Remark on the sampling strategy. According to compressed sensing theory, accurate recovery of a sparse vector from underdetermined measurements requires the measurement matrix to be incoherent with the sparse basis. Latin hypercube sampling is adopted here because it provides a stratified random design that ensures low cross-coherence between the sampling matrix and the POD basis. This satisfies the restricted isometry property (RIP) in a statistical sense. However, even with low cross-coherence, the self-coherence (mutual coherence) of the sampled system matrix may still be high due to the physical coupling between equations. The UNTF preconditioner developed in
Section 3.2 specifically reduces this self-coherence, thereby improving the numerical stability of the
l1 solver. Thus, the two strategies are complementary: Latin hypercube sampling ensures global recoverability, while UNTF preconditioning enhances local solver performance.
3.1.3. l1 Norm Problem with Sampling Constraints
Equation (21) gives the unconstrained sampled dynamic equations. By appending the constraint equations
, the complete constrained system is obtained as:
The constrained equations
include the motion constraints (such as joint constraints) and thermal constraints (such as the specified temperature of the boundary), which can be written as:
The first set of constraint equations represents the motion constraints, while the other set represents the thermal constraints. For solving the DAEs, time integration methods such as the backward differentiation formula (BDF) and the generalized method are used. In this paper, the first-order BDF is utilized. By substituting the BDF and Equation (15), the nonlinear equations at the
t time step can be obtained as follows:
where
h represents the time step. For simplicity, the above equations are denoted as
. Since Equation (24) represents an undetermined nonlinear equation, the coefficient
pt sparseness is considered for getting the solution of such equations. So, the coefficients
l1 norm problem can be written as:
where
and
represent the flexible and thermal coefficient vectors at the
t time step.
Sf and
sT represent the sparseness of the flexible and thermal coefficients, respectively. Supposing there are
N flexible bodies in the system,
sf and
sT can be expressed as:
By solving the
l1 norm problem at each time step, the dynamic characteristic can be obtained. The modified Greedy Gauss-Newton algorithm has been proposed to solve such
l1 norm problem [
46]. The above procedure demonstrates that the proposed method can directly sample the linear components (including the stiffness, damping matrix, and linear forces) and the nonlinear components (such as the mass matrix and nonlinear forces) without invoking any Galerkin-type projection framework. In addition, formulating the problem in an
l1-norm setting enables the simultaneous determination of the sparse basis vectors and the solution of underdetermined nonlinear DAEs.
3.2. Preconditioning of the Jacobian Matrix Based on UNTF
To obtain a stable solution to the l1 norm problem, the coherence of the Jacobian matrix for nonlinear equations should be small enough while solving the l1 norm problem is applied. However, the scale of the thermal coefficients is larger than that of the flexible ones. It makes convergence impossible during the iteration. In this section, UNTF-based preconditioning is applied to the thermal Jacobian matrix.
Firstly, the thermal dynamic equations after sampling and the first-order BDF method can be written as follows according to
Section 3.1.2:
By applying the precondition procedure to Equation (27), the following equations can be obtained:
where
represents the thermal precondition matrix of the
ith flexible body. The UNTF is approximated by the Grassmannian frame, which exhibits minimal coherence. UNTF-based preconditioning has been proposed for linear equations. Since the maximal coherence of the UNTF is related to the largest absolute value of the non-diagonal elements of the corresponding Gram matrix, it is necessary to restrict the range of these non-diagonal elements, as described in [
38]:
where
gij represents the non-diagonal elements of the Gram matrix in the
ith row and the
jth column. Then, the matrix
would be approximated to the UNTF. For each flexible body thermal part, the preconditioned matrix is obtained using the flowchart shown in
Figure 1. Specifically, it can be described as the following steps:
Step 1: The matrix is normalized to get a matrix , where k indicates the current iteration number.
Step 2: Construct the Gram matrix by . Then, the non-diagonal elements value of this matrix are restricted by formula (29). The matrix after restricting is marked as .
Step 3: To make the rank of the Gram matrix equal to m, the truncated SVD is applied to approximate , and obtains the approximated matrix . Then, calculate the matrix by utilizing the singular value matrix, which .
Step 4: Construct the matrix to approximate the UNTF by .
Step 5: To make the thermal matrix approximate the UNTF by a precondition matrix , the matrix minimization problem is constructed. By solving the problem, the precondition matrix can be obtained.
Step 6: If , then set and set back to Step 1. Otherwise, exit the constructor and output the preconditioned matrix .
For solving the matrix minimization problem in
Step 5, let
. Then, take the derivative of the norm with respect to
P to equal the zero matrix, which can be expressed as:
According to the matrix derivation law [
47], the following matrix equations can be obtained:
So, the solution of the matrix minimization problem in Step 5 can be obtained by Equation (31).
3.3. Summary of Sparse Model Order Reduction Method for Thermomechanical Dynamic System
The previous sections detailed the sparse model reduction method for the thermomechanical coupling dynamic system. The analysis flowchart is depicted in
Figure 2. The key contributions of this paper are highlighted in green areas. The flowchart outlines the proposed method for analyzing the thermomechanical coupling system, broken into five steps.
Step 1: Initial setup includes defining material parameters, such as Young’s modulus and specific heat, as well as simulation parameters, such as sampling size, sparseness, and duration. Subsequently, the POD basis is calculated from the collected data points using Equation (9). The mass, stiffness, and other constants are determined via inertia shape integration.
Step 2: The Latin Hypercube sampling technique is employed to establish the indices for the equations. Based on these indices, the necessary sampling matrices, including the mass, stiffness, and capacitance matrices, are calculated, eliminating the need to use the entire set.
Step 3: The preconditioning matrix for the thermal Jacobian of the flexible body is obtained using the procedures outlined in
Section 3.2.
Step 4: The POD coefficients l1 norm problem, constrained by the sampling Equation (25) at each time step, is constructed. By using the Greedy-Gauss-Newton method to solve the problem, the coefficients pt and the Lagrange multiplier at each time step are obtained. Then, the deformation, temperature, position, etc., can be collected.
Step 5: If the current time t is less than the simulation time T, go back to Step 2 for the next time step analysis. Otherwise, the simulation is finished.
The key mathematical difference between the proposed method and conventional projection-based reduced-order models (e.g., POD-Galerkin and hyper-reduction) lies in how the governing equations are treated. Conventional methods first project the full-order system onto a low-dimensional subspace via Galerkin projection, yielding a reduced system of dimension
(the number of retained POD modes):
where
is the residual of the full-order equations. The computational cost of this reduced system, however, remains dependent on the full-order dimension
when evaluating nonlinear terms.
In contrast, the proposed method does not perform Galerkin projection. Instead, it directly samples
equations from the full-order residual and solves for the sparse coefficients
via
l1 optimization:
where
is a sampling matrix selecting
rows of the residual. The reduction is achieved through sparsity: only a few components of
are active at each time step, and these are adaptively selected online. This avoids both the projection error of Galerkin methods and the offline-fixed interpolation points of hyper-reduction techniques such as DEIM.
In the POD-Galerkin method, the number of retained POD bases is determined by a fixed energy criterion during the offline stage, and all retained bases are used for projection. In contrast, in the proposed method, the basis size is chosen to ensure that the state variables can be sparsely represented on the selected basis; only a sparse subset of the retained bases is active online via the l1 optimization at each time step. The framework itself is not restricted to POD and can adopt any basis, including overcomplete ones, provided that a sparse representation exists for the given system.
5. Conclusions
This paper proposes a projection-free sparse model reduction framework for thermomechanical coupling dynamics of flexible multibody systems, where the full-order equations are directly sampled online, and the reduced coefficients are recovered via norm optimization without Galerkin projection. The framework extends the projection-free paradigm to thermomechanical coupling by replacing modal bases with data-driven POD bases to capture the time-varying thermal subspace and by introducing UNTF preconditioning to ensure stable recovery under thermal-mechanical coupling. These developments enable, for the first time, the application of the projection-free sparse model reduction paradigm to thermomechanical coupling problems.
The numerical results demonstrate the effectiveness of the proposed method across three representative examples. In the double pendulum case, the L1 method achieves the highest accuracy, with relative errors on the order of 10−7. For the slider-plate and brake disk systems, the L1 method maintains good accuracy, with stable error levels comparable to or slightly better than those of POD-Galerkin, while showing significantly greater robustness than DEIM. Computational efficiency is consistently improved, with total simulation time reduced by more than 40% across all three examples. The UNTF preconditioner is shown to be essential for numerical stability, as the un-preconditioned solver leads to rapidly growing errors.
Sensitivity studies on the sparsity parameters indicate that the required sparsity level depends on the POD basis ability to represent the system dynamics. For systems with dominant low-order dynamics (e.g., the double pendulum), moderate sparsity is sufficient to achieve high accuracy. For systems with strong localized features or complex nonlinearities (e.g., the slider-plate and brake disk), increasing the sparsity yields diminishing returns due to the inherent limitation of global POD bases in capturing localized phenomena. Computational time remains stable across all cases, confirming that efficiency is not sensitive to the choice of sparsity parameters. These findings suggest that the sparsity parameters should be chosen based on a problem-dependent threshold, above which accuracy saturates, rather than relying on a universal fixed value.
The theoretical foundation of the proposed method relies on the well-established restricted isometry property (RIP) in compressed sensing theory. While a new theoretical proof of RIP for the specific thermomechanical system is not provided in this paper, the numerical results across three representative—covering thermal radiation, frictional heat generation, and transient high-gradient heating—provide strong empirical evidence of the method reliability under various thermomechanical conditions.
Despite these advantages, the proposed method has certain limitations when applied to systems with discontinuous contact forces, potentially yielding low-precision dynamic results. This limitation arises not only from the difficulty of accurately capturing rapidly changing contact characteristics through random sampling of the dynamic equations, but also from the insufficient sparsity of the corresponding temperature or deformation fields under the chosen sparse bases. When the true field cannot be sparsely represented, the l1-based reconstruction becomes less effective. Future research should therefore focus on optimizing the sampling strategy and improving the sparse representation framework to better capture the dynamic characteristics in such cases.