Chebyshev Polynomial Approximation Research Articles

Hopf bifurcation control for the traffic flow model considering the tail light effect

The research on traffic congestion control has seen rapid development in recent years. Investigating the bifurcation characteristics of traffic flow and designing control schemes for unstable bifurcation points can offer new methods for alleviating traffic congestion. This paper focuses on studying the bifurcation characteristics and nonlinear control of traffic flow based on the continuous model and the taillight effect. Firstly, the traffic flow model is transformed into a stability model suitable for branching analysis through the use of the traveling wave transform. This transformation facilitates the analysis of stability that reflects unstable traffic characteristics such as congestion. Based on this stability model, the existence condition of Hopf bifurcation is proved and some bifurcation points of the traffic system are identified. Secondly, the congestion and stability mutation behaviors near equilibrium and branching points are studied to understand the formation mechanism of traffic congestion. Finally, control schemes are designed using Chebyshev polynomial approximation and stochastic feedback control to delay or eliminate unstable bifurcation points and relieve traffic congestion. This improved traffic flow model helps explain changes in system stability through bifurcation analysis and identify unstable bifurcation points. It can also effectively manage these points by designing a feedback controller. It is beneficial for controlling sudden changes in traffic system stability behavior and mitigating traffic congestion, with important theoretical significance and practical application value.

Cubic Spline Chebyshev Polynomial Approximation for Solving Boundary Value Problems

Cubic Spline Chebyshev Polynomial Approximation for Solving Boundary Value Problems

Bifurcation analysis and control study of improved full-speed differential model in connected vehicle environment

Abstract In recent years, the traffic congestion problem has become more and more serious, and the research on traffic system control has become a new hot spot. Studying the bifurcation characteristics of traffic flow systems and designing control schemes for unstable pivots can alleviate the traffic congestion problem from a new perspective. In this work, the full-speed differential model considering the vehicle network environment is improved in order to adjust the traffic flow from the perspective of bifurcation control, the existence conditions of Hopf bifurcation and saddle-node bifurcation in the model are proved theoretically, and the stability mutation point for the stability of the transportation system is found. For the unstable bifurcation point, a nonlinear system feedback controller is designed by using Chebyshev polynomial approximation and stochastic feedback control method. The advancement, postponement, and elimination of Hopf bifurcation are achieved without changing the system equilibrium point, and the mutation behavior of the transportation system is controlled so as to alleviate the traffic congestion. The changes in the stability of complex traffic systems are explained through the bifurcation analysis, which can better capture the characteristics of the traffic flow. By adjusting the control parameters in the feedback controllers, the influence of the boundary conditions on the stability of the traffic system is adequately described, and the effects of the unstable focuses and saddle points on the system are suppressed to slow down the traffic flow. In addition, the unstable bifurcation points can be eliminated and the Hopf bifurcation can be controlled to advance, delay, and disappear, so as to realize the control of the stability behavior of the traffic system, which can help to alleviate the traffic congestion and describe the actual traffic phenomena as well.

Bifurcation analysis and control of an improved continuous traffic model considering weather effect

PurposeHighway traffic systems are complex and variable, and studying the bifurcation characteristics of traffic flow systems and designing control schemes for unstable bifurcation points can alleviate traffic congestion from a new perspective. Bifurcation analysis is used to explain the changes in system stability, identify the unstable bifurcation points of the system, and design feedback controllers to realize the control of the unstable bifurcation points of the traffic system. It helps to control the sudden changes in the stable behavior of the traffic system and helps to alleviate traffic congestion, which is of great practical significance.Design/methodology/approachIn this paper, we improve the macroscopic traffic flow model by integrating severe weather factors such as rainfall, snowfall, and dust. We use traveling wave transform to convert it into a traffic flow stability model suitable for branching analysis, thus converting the traffic flow problem into a system stability analysis problem. First, this paper derives the existence conditions of the model Hopf bifurcation and saddle-node bifurcation for the improved macroscopic model, and finds the stability mutation point of the system. Secondly, the connection between the stability mutation points and bifurcation points of the traffic system is analyzed. Finally, for the unstable bifurcation point, a nonlinear system feedback controller is designed using Chebyshev polynomial approximation and stochastic feedback control method.FindingsThe Hopf bifurcation is delayed and completely eliminated without changing the equilibrium point of the system, thus controlling the abrupt behavior of the traffic system.Originality/valueCurrently there are fewer studies to explain the changes in the stability of the transportation system through bifurcation analysis, in this paper; we design a feedback controller for the unstable bifurcation point of the system to realize the control of the transportation system. It is a new research method that helps to control the sudden change of the stable behavior of the traffic system and helps to alleviate traffic congestion, which is of great practical significance.

Approximate analytical solutions of nonlinear vibration and bifurcation of dielectric elastomer balloon

Dielectric elastomers (DE), a novel class of actuators, are increasingly employed in fields such as soft robotics and vibration control. Most existing studies investigating the dynamic characteristics of DE structures neglect the viscoelasticity and strain-stiffening effects of materials, with only a few offering approximate analytical solutions. This paper establishes the governing equation for the dynamics of a DE balloon, utilizing the principle of virtual work and considering material viscoelasticity and strain-stiffening effects through linear damping and the Gent hyperelastic model, respectively. The nonlinear governing equations are simplified using the Chebyshev polynomial approximation. The multiple scales method is applied to derive approximate solutions for the structure's free vibration under static voltage excitation and parametrically excited vibration under harmonic voltage excitation. The accuracy of these approximate analytical solutions is validated by comparison with numerical solutions. Additionally, the paper analyzes stability and bifurcation phenomena through time-domain response curves, amplitude-frequency curves, and phase trajectories. Furthermore, the influence of the stretching limit, voltage, and damping on the nonlinear vibration of the balloon structure is studied, providing a valuable theoretical foundation for the future design and utilization of dielectric elastomers.

Bifurcation analysis and control of improved traffic flow model considering the effect of strong winds.

In recent years, the problem of traffic congestion has become increasingly serious, and research on traffic system control has become a new hotspot. Studying the bifurcation characteristics of traffic flow systems and designing control schemes for unstable support points can alleviate traffic congestion from a new perspective. This article improves the full speed differential model considering strong wind models from the perspective of bifurcation control to adjust traffic flow. This article theoretically proves the existence conditions of Hopf bifurcation and saddle node bifurcation in the model and finds the stability mutation point of the transportation system stability. A nonlinear system feedback controller was designed for unstable bifurcation points using Chebyshev polynomial approximation and random feedback control methods. Without changing the system equilibrium point, the advance, delay, and elimination of Hopf bifurcation were achieved, and the abrupt behavior of the transportation system was controlled, thereby alleviating traffic congestion. This article explains the changes in the stability of complex transportation systems from the perspective of bifurcation analysis, which can better capture the characteristics of traffic flow. By adjusting the control parameters in the feedback controller, the influence of boundary conditions on the stability of the transportation system is fully described, and the influence of unstable focal points and saddle points on the system is suppressed, thereby slowing down the traffic flow. In addition, unstable bifurcation points can be eliminated, and the Hopf bifurcation can be controlled to advance, delay, and disappear, thereby achieving control over the stable behavior of the transportation system. This helps alleviate traffic congestion and also helps describe actual traffic phenomena.

A fast correction approach to tensor robust principal component analysis

Tensor robust principal component analysis (TRPCA) is a useful approach for obtaining low-rank data corrupted by noise or outliers. However, existing TRPCA methods face certain challenges when it comes to estimating the tensor rank and the sparsity accurately. The commonly used tensor nuclear norm (TNN) may lead to sub-optimal solutions due to the gap between TNN and the tensor rank. Additionally, the ℓ1-norm is not an ideal estimation of the ℓ0-norm, and solving TNN minimization can be computationally intensive because of the tensor singular value thresholding (t-SVT) scheme. To address these issues, a method called fast correction TNN (FC-TNN) is proposed for TRPCA. In contrast to existing methods, FC-TNN introduces a correction term to bridge the gap between TNN and the tensor rank. Furthermore, a new correction term is employed for the ℓ1-norm to achieve the desired solution. To improve computational efficiency, the Chebyshev polynomial approximation (CPA) technique is presented for computing t-SVT without requiring tensor singular value decomposition (t-SVD). The CPA technique is incorporated into the alternating direction method of multipliers (ADMM) algorithm to solve the proposed model effectively. Theoretical analysis demonstrates that FC-TNN offers a lower error bound compared to TNN under certain conditions. Extensive experiments conducted on various tensor-based datasets illustrate that the proposed method outperforms several state-of-the-art methods.

Chebyshev polynomial approximation in CNN for zero-knowledge encrypted data analysis

Integrating Deep Learning (DL) techniques in Convolutional Neural Networks (CNNs) with encrypted data analysis is an emerging field for enhancing data privacy and security. A significant challenge in this domain is the incompatibility of standard non-linear Activation Functions (AF) like Rectified Linear Unit (ReLU) and Hyperbolic Tangent (tanh) with Zero-Knowledge (ZK) encrypted data, which impacts computational efficiency and data privacy. Addressing this, our paper introduces the novel application of Chebyshev Polynomial Approximation (CPA) to adapt these AF to process encrypted data effectively. Utilizing the MNIST dataset, this paper conducted experiments with LeNet and various configurations of AlexNet, extending the range of the ReLU and tanH functions to optimize CPA. Our results reveal an optimal polynomial degree (α), with α = 10 for ReLU and between α = 10 and α = 15 for tanH, beyond which the benefits in accuracy plateau. This finding is crucial for ensuring the accuracy and efficiency of CNNs in processing encrypted data. This recommended study demonstrates that while the accuracy slightly decreases for plaintext data and more significantly for ciphertext data, the overall effectiveness of CPA in CNNs is maintained. This advancement enables CNNs to process encrypted data while preserving privacy and marks a significant step in developing privacy-preserving Machine Learning (ML) and encrypted data analysis.

Hopf bifurcation control of macroscopic traffic flow model considering vehicle braking effect.

Traffic congestion not only has a great impact on people's travel, but also increases energy consumption and air pollution. The control analysis of the macroscopic traffic flow model considering the vehicle braking effect is particularly important, reflecting the impact on the actual traffic flow density wave, so as to better solve the actual traffic problems. In this paper, based on a speed difference optimization speed model, the micro-macro-variables are transformed into a high-order continuous traffic flow model. Then, a random function considering the physical correlation of random components is added to the high-order continuous traffic flow model to establish a random traffic flow model that can reflect the uncertain behavior of traffic flow acceleration or deceleration. Based on this stochastic traffic model, the existence of Hopf bifurcation and bifurcation control of the traffic flow system model considering stochastic characteristics are derived by using Hopf bifurcation theorem. By Chebyshev polynomial approximation method, the stochastic problem of the system is transformed into the bifurcation control problem of its equivalent deterministic system. A feedback controller is designed to delay the occurrence of Hopf bifurcation and control the amplitude of the limit cycle. Without changing the equilibrium point of the system, the complete elimination of Hopf bifurcation can be achieved by controlling the amplitude of the limit cycle. That is, the feedback controller is used to modify the bifurcation characteristics of the system, such as the bifurcation appearing at the equilibrium point in the control system moves forward, moves backward or disappears, so as to achieve the effect of preventing or alleviating traffic congestion.

Response Analysis of the Three-Degree-of-Freedom Vibroimpact System with an Uncertain Parameter.

The inherent non-smoothness of the vibroimpact system leads to complex behaviors and a strong sensitivity to parameter changes. Unfortunately, uncertainties and errors in system parameters are inevitable in mechanical engineering. Therefore, investigations of dynamical behaviors for vibroimpact systems with stochastic parameters are highly essential. The present study aims to analyze the dynamical characteristics of the three-degree-of-freedom vibroimpact system with an uncertain parameter by means of the Chebyshev polynomial approximation method. Specifically, the vibroimpact system model considered is one with unilateral constraint. Firstly, the three-degree-of-freedom vibroimpact system with an uncertain parameter is transformed into an equivalent deterministic form using the Chebyshev orthogonal approximation. Then, the ensemble means responses of the stochastic vibroimpact system are derived. Numerical simulations are performed to verify the effectiveness of the approximation method. Furthermore, the periodic and chaos motions under different system parameters are investigated, and the bifurcations of the vibroimpact system are analyzed with the Poincaré map. The results demonstrate that both the restitution coefficient and the random factor can induce the appearance of the periodic bifurcation. It is worth noting that the bifurcations fundamentally differ between the stochastic and deterministic systems. The former has a bifurcation interval, while the latter occurs at a critical point.

A parallel PageRank algorithm for undirected graph

As a measure of vertex importance according to the graph structure, PageRank has been widely applied in various fields. While many PageRank algorithms have been proposed in the past decades, few of them take into account whether the graph under investigation is directed or not. Thus, some important properties of undirected graph—symmetry on edges, for example—is ignored. In this paper, we propose a parallel PageRank algorithm specifically designed for undirected graphs that can fully leverage their symmetry. Formally, our algorithm extends the Chebyshev Polynomial approximation from the field of real function to the field of matrix function. Essentially, it reflects the symmetry on edges of undirected graph and the density of diagonalizable matrix. Theoretical analysis indicates that our algorithm has a higher convergence rate and requires less computation than the Power method, with a 50% higher convergence rate when the damping factor c=0.85. Experiments on six datasets illustrate that our algorithm with 38 parallelism can be up to 43 times faster than the single-thread Power method.

Learning High-Order Graph Convolutional Networks via Adaptive Layerwise Aggregation Combination.

Graph convolutional networks have attracted wide attention for their expressiveness and empirical success on graph-structured data. However, deeper graph convolutional networks with access to more information can often perform worse because their low-order Chebyshev polynomial approximation cannot learn adaptive and structure-aware representations. To solve this problem, many high-order graph convolution schemes have been proposed. In this article, we study the reason why high-order schemes have the ability to learn structure-aware representations. We first prove that these high-order schemes are generalized Weisfeiler-Lehman (WL) algorithm and conduct spectral analysis on these schemes to show that they correspond to polynomial filters in the graph spectral domain. Based on our analysis, we point out twofold limitations of existing high-order models: 1) lack mechanisms to generate individual feature combinations for each node and 2) fail to properly model the relationship between information from different distances. To enable a node-specific combination scheme and capture this interdistance relationship for each node efficiently, we propose a new adaptive feature combination method inspired by the squeeze-and-excitation module that can recalibrate features from different distances by explicitly modeling interdependencies between them. Theoretical analysis shows that models with our new approach can effectively learn structure-aware representations, and extensive experimental results show that our new approach can achieve significant performance gain compared with other high-order schemes.

Nonlinear Semianalytical Prediction of Debonding at the FRP–Generic Material Interface with Mechanical End Anchorages

The full-range debonding process of a fiber-reinforced polymer (FRP)–generic material substrate interface with mechanical end anchorages requires a better understanding. In this study, we developed a nonlinear semianalytical model based on a cohesive crack model to predict the full-range debonding process of such an interface in a single-shear mode, considering the relatively deformed region in the interface as a cohesive zone. Specifically, we produced a double exponential bond–slip constitutive model with residual bonding shear stress and boundary conditions of slip constraints at both anchoring ends. Implicit solutions for the relative slips, bonding shear stresses, and axial forces in the FRP along the bond length, as well as the load–slip responses at the loading end and effective bond length, were obtained using the Chebyshev polynomial approximation strategy. The accuracy of the proposed model was verified using experimental results available in the literature. Then, the evolution of full-range interfacial bonding behavior and load–slip responses for different bond lengths was discussed. Finally, a parametric study highlighting the effect of geometry and material properties on the load–slip response at the loading end was presented.

Modelling Stage-discharge Relationships for Hydrological Stations in the Da River Basin using First-kind Chebyshev Polynomial Approximation

Observed discharge time series is essential data for hydrological analysis, streamflow forecasting, as well as water resources planning and management. Estimation of continuous discharge time series is generally based on the curves (or empirical models) that can properly simulate the relationships between water levels (stages) and concurrent water discharges observed at a particular hydrological station. For stations with complex hydraulic conditions, in addition to gauged stages at the discharge gauging section, another variable such as stage measured at an auxiliary station (to calculate the slope) or rate of change in stage is added to the estimation process. This paper presents the results of applying the first-kind Chebyshev polynomial approximation method in constructing rating curves for three hydrological stations in the Da river basin, each having different basin characteristics and various influencing factors. The analysis results using five evaluation indices (MAE, σ, Pbias, KGE, and MAPE) show that the Chebyshev polynomials are highly effective in modelling both simple and complex stage-discharge relationships. The Chebyshev polynomial approximation method is suggested to be used for establishing stage-discharge relationships in hydrometry.

Dynamic response analysis of a shaft-disk-drum rotor system with interval uncertainties

In this work, the dynamic responses of an uncertain flexible shaft-disk-drum rotor under elastic support and connection are investigated, where uncertain parameters are considered as unknown but bounded interval variables. The energy method is used to derive deterministic analytical model for the flexible shaft-disk-drum rotor, which is validated by modal tests. A non-intrusive interval method based on Chebyshev polynomial approximation is introduced to evaluate the uncertain dynamic response of the flexible shaft-disk-drum rotor system. Comparative studies of Monte Carlo simulation, scanning method and the interval method are conducted to illustrate the validity and accuracy of the approach proposed here.

On projection method for numerical solution of hypersingular integral equations of the first kind combined with quadrature methods

The Fredholm integral equations of the first kind with two regular and hypersingular kernels are considered on [−1, 1]. The hypersingular kernel is considered smooth enough with no additional conditions. A projection method based on second kind Chebyshev polynomials approximation, combined with quadrature integration method, is developed to obtain high accurate approximations. The proposed method reduces the underlying integral equation to a system of algebraic equations. Several illustrative examples are provided to show the efficiency of the method.

Undersampled MRI reconstruction based on spectral graph wavelet transform

Compressed sensing magnetic resonance imaging (CS-MRI) has exhibited great potential to accelerate magnetic resonance imaging if an image can be sparsely represented. How to sparsify the image significantly affects the reconstruction quality of images. In this paper, a spectral graph wavelet transform (SGWT) is introduced to sparsely represent magnetic resonance images in iterative image reconstructions. The SGWT is achieved by extending the traditional wavelets transform to the signal defined on the vertices of the weighted graph, i.e. the spectral graph domain. This SGWT uses only the connectivity information encoded in the edge weights, and does not rely on any other attributes of the vertices. Therefore, SGWT can be defined and calculated for any domain where the underlying relations between data locations can be represented by a weighted graph. Furthermore, we present a Chebyshev polynomial approximation algorithm for fast computing this SGWT transform. The l1 norm regularized CS-MRI reconstruction model is introduced and solved by the projected iterative soft-thresholding algorithm to verify its feasibility. Numerical experiment results demonstrate that our proposed method outperforms several state-of-the-art sparsify transforms in terms of suppressing artifacts and achieving lower reconstruction errors on the tested datasets.

Efficient inner-outer decoupling scheme for non-probabilistic model updating with high dimensional model representation and Chebyshev approximation

Interval arithmetic offers a powerful tool for structural model updating when uncertain-but-bounded parameters are considered. However, the application of interval model updating for practical engineering structure is hindered due to model complexity and huge computational burden involved in the repeated evaluations of non-probabilistic constraints. In this light, an efficient inner-outer decoupling scheme is proposed for non-probabilistic model updating in this study. The mathematical operation of interval model updating is decomposed into two layers labelled as inner layer with the operation of uncertainty propagation and outer layer with the operation of interval optimization. In the inner uncertainty propagation, the High Dimensional Model Representation (HDMR) is utilized to enable the decomposition of the model outputs in terms of multivariate inputs into the sum of multiple single-variate functions, which is further approximated by Chebyshev polynomials so that the stationary points of each function can be derived. In the outer layer, a fast-running optimization strategy based on the stationary points of Chebyshev polynomial approximation is proposed to accelerate tracking the bounds of model parameters by avoiding time-consuming brute-force interval optimization. As a result, the original non-probabilistic updating process with two interacted layers can be completely decoupled into two independent operations of the inner uncertainty propagation and outer interval optimization so as to enhance the search efficiency and convergence rate significantly. Two numerical case studies illustrate capability of the proposed method in updating the structural parameters intervals efficiently with the model outputs intervals agreeing well with the testing outputs intervals. Two experimental cases of steel plates and the Canton Tower also demonstrate the efficiency and advantages of the method in interval model updating.

Asymptotic coefficients and errors for Chebyshev polynomial approximations with weak endpoint singularities: Effects of different bases

When one solves differential equations by a spectral method, it is often convenient to shift from Chebyshev polynomials Tn(x) with coefficients an to modified basis functions that incorporate the boundary conditions. For homogeneous Dirichlet boundary conditions, u(±1) = 0, popular choices include the “Chebyshev difference basis” ςn(x) ≡ Tn+2(x)−Tn(x) with coefficients here denoted by bn and the “quadratic factor basis” ϱn(x) ≡ (1 − x2)Tn(x) with coefficients cn. If u(x) is weakly singular at the boundary, then the coefficients an decrease proportionally to \({\cal O}\left( {A\left( n \right)/{n^\kappa }} \right)\) for some positive constant κ, where A(n) is a logarithm or a constant. We prove that the Chebyshev difference coefficients bn decrease more slowly by a factor of 1/n while the quadratic factor coefficients cn decrease more slowly still as \({\cal O}\left( {A\left( n \right)/{n^{\kappa - 2}}} \right)\). The error for the unconstrained Chebyshev series, truncated at degree n = N, is \({\cal O}\left( {\left| {A\left( N \right)} \right|/{N^\kappa }} \right)\) in the interior, but is worse by one power of N in narrow boundary layers near each of the endpoints. Despite having nearly identical error norms in interpolation, the error in the Chebyshev basis is concentrated in boundary layers near both endpoints, whereas the error in the quadratic factor and difference basis sets is nearly uniformly oscillating over the entire interval in x. Meanwhile, for Chebyshev polynomials, the values of their derivatives at the endpoints are \({\cal O}\left( {{N^2}} \right)\), but only \({\cal O}\left( N \right)\) for the difference basis. Furthermore, we give the asymptotic coefficients and rigorous error estimates of the approximations in these three bases, solved by the least squares method. We also find an interesting fact that on the face of it, the aliasing error is regarded as a bad thing; actually, the error norm associated with the downward curving spectral coefficients decreases even faster than the error norm of infinite truncation. But the premise is under the same basis, and when involving different bases, it may not be established yet.

Minimax Design of Computationally-Efficient FIR Graph Filters Using Semidefinite Programming

We propose a minimax design method for finite impulse response (FIR) graph filters in this brief. We first convert the graph filter design problem into a numerically stable equivalent problem using a shifted monomial basis. Then, we convert the minimax graph filter design problem into a semidefinite programming problem. Furthermore, we propose a computationally-efficient structure to implement the FIR graph filters designed using the proposed method. Design examples confirm that the proposed method can be used to design FIR graph filters having reasonably high orders, and the proposed implementation structure substantially saves additions required to process a graph signal compared to graph filters designed using a previously proposed Chebyshev polynomial approximation method.