期刊文献+
共找到7篇文章
< 1 >
每页显示 20 50 100
Sensitivity Analysis of Structural Dynamic Behavior Based on the Sparse Polynomial Chaos Expansion and Material Point Method
1
作者 Wenpeng Li Zhenghe Liu +4 位作者 Yujing Ma Zhuxuan Meng Ji Ma Weisong Liu Vinh Phu Nguyen 《Computer Modeling in Engineering & Sciences》 2025年第2期1515-1543,共29页
This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-... This paper presents a framework for constructing surrogate models for sensitivity analysis of structural dynamics behavior.Physical models involving deformation,such as collisions,vibrations,and penetration,are devel-oped using the material point method.To reduce the computational cost of Monte Carlo simulations,response surface models are created as surrogate models for the material point system to approximate its dynamic behavior.An adaptive randomized greedy algorithm is employed to construct a sparse polynomial chaos expansion model with a fixed order,effectively balancing the accuracy and computational efficiency of the surrogate model.Based on the sparse polynomial chaos expansion,sensitivity analysis is conducted using the global finite difference and Sobol methods.Several examples of structural dynamics are provided to demonstrate the effectiveness of the proposed method in addressing structural dynamics problems. 展开更多
关键词 Structural dynamics DEFORMATION material point method sparse polynomial chaos expansion adaptive randomized greedy algorithm sensitivity analysis
在线阅读 下载PDF
Digital twin dynamic-polymorphic uncertainty surrogate model generation using a sparse polynomial chaos expansion with application in aviation hydraulic pump 被引量:1
2
作者 Dong LIU Shaoping WANG +1 位作者 Jian SHI Di LIU 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2024年第12期231-244,共14页
Full lifecycle high fidelity digital twin is a complex model set contains multiple functions with high dimensions and multiple variables.Quantifying uncertainty for such complex models often encounters time-consuming ... Full lifecycle high fidelity digital twin is a complex model set contains multiple functions with high dimensions and multiple variables.Quantifying uncertainty for such complex models often encounters time-consuming challenges,as the number of calculated terms increases exponentially with the dimensionality of the input.This paper based on the multi-stage model and high time consumption problem of digital twins,proposed a sparse polynomial chaos expansions method to generate the digital twin dynamic-polymorphic uncertainty surrogate model,striving to strike a balance between the accuracy and time consumption of models used for digital twin uncertainty quantification.Firstly,an analysis and clarification were conducted on the dynamic-polymorphic uncertainty of the full lifetime running digital twins.Secondly,a sparse polynomial chaos expansions model response was developed based on partial least squares technology with the effectively quantified and selected basis polynomials which sorted by significant influence.In the end,the accuracy of the proxy model is evaluated by leave-one-out cross-validation.The effectiveness of this method was verified through examples,and the results showed that it achieved a balance between maintaining model accuracy and complexity. 展开更多
关键词 Digital Twin Uncertainty surrogate model Dynamic-polymorphic uncertainty sparse polynomial chaos expansions Aviation hydraulic pump
原文传递
Three-dimensional pseudo-dynamic reliability analysis of seismic shield tunnel faces combined with sparse polynomial chaos expansion
3
作者 GUO Feng-qi LI Shi-wei ZOU Jin-Feng 《Journal of Central South University》 SCIE EI CAS CSCD 2024年第6期2087-2101,共15页
To address the seismic face stability challenges encountered in urban and subsea tunnel construction,an efficient probabilistic analysis framework for shield tunnel faces under seismic conditions is proposed.Based on ... To address the seismic face stability challenges encountered in urban and subsea tunnel construction,an efficient probabilistic analysis framework for shield tunnel faces under seismic conditions is proposed.Based on the upper-bound theory of limit analysis,an improved three-dimensional discrete deterministic mechanism,accounting for the heterogeneous nature of soil media,is formulated to evaluate seismic face stability.The metamodel of failure probabilistic assessments for seismic tunnel faces is constructed by integrating the sparse polynomial chaos expansion method(SPCE)with the modified pseudo-dynamic approach(MPD).The improved deterministic model is validated by comparing with published literature and numerical simulations results,and the SPCE-MPD metamodel is examined with the traditional MCS method.Based on the SPCE-MPD metamodels,the seismic effects on face failure probability and reliability index are presented and the global sensitivity analysis(GSA)is involved to reflect the influence order of seismic action parameters.Finally,the proposed approach is tested to be effective by a engineering case of the Chengdu outer ring tunnel.The results show that higher uncertainty of seismic response on face stability should be noticed in areas with intense earthquakes and variation of seismic wave velocity has the most profound influence on tunnel face stability. 展开更多
关键词 reliability analysis shield tunnel face sparse polynomial chaos expansion modified pseudo-dynamic approach seismic stability assessment
在线阅读 下载PDF
RECONSTRUCTION OF SPARSE POLYNOMIALS VIA QUASI-ORTHOGONAL MATCHING PURSUIT METHOD
4
作者 Renzhong Feng Aitong Huang +1 位作者 Ming-Jun Lai Zhaiming Shen 《Journal of Computational Mathematics》 SCIE CSCD 2023年第1期18-38,共21页
In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data ... In this paper,we propose a Quasi-Orthogonal Matching Pursuit(QOMP)algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials.For the two kinds of sampled data,data with noises and without noises,we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct s-sparse Legendre polynomials,Chebyshev polynomials and trigonometric polynomials in s step iterations.The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials.Finally,numerical experiments will be presented to verify the effectiveness of the QOMP method. 展开更多
关键词 Reconstruction of sparse polynomial Compressive sensing Mutual coherence Quasi-orthogonal matching pursuit algorithm
原文传递
Data-driven sparse polynomial chaos expansion for models with dependent inputs
5
作者 Zhanlin Liu Youngjun Choe 《Journal of Safety Science and Resilience》 EI CSCD 2023年第4期358-365,共8页
Polynomial chaos expansions(PCEs)have been used in many real-world engineering applications to quantify how the uncertainty of an output is propagated from inputs by decomposing the output in terms of polynomials of t... Polynomial chaos expansions(PCEs)have been used in many real-world engineering applications to quantify how the uncertainty of an output is propagated from inputs by decomposing the output in terms of polynomials of the inputs.PCEs for models with independent inputs have been extensively explored in the literature.Recently,different approaches have been proposed for models with dependent inputs to expand the use of PCEs to more real-world applications.Typical approaches include building PCEs based on the Gram–Schmidt algorithm or transforming the dependent inputs into independent inputs.However,the two approaches have their limitations regarding computational efficiency and additional assumptions about the input distributions,respectively.In this paper,we propose a data-driven approach to build sparse PCEs for models with dependent inputs without any distributional assumptions.The proposed algorithm recursively constructs orthonormal polynomials using a set of monomials based on their correlations with the output.The proposed algorithm on building sparse PCEs not only reduces the number of minimally required observations but also improves the numerical stability and computational efficiency.Four numerical examples are implemented to validate the proposed algorithm.The source code is made publicly available for reproducibility. 展开更多
关键词 Uncertainty quantification polynomial chaos expansion sparse polynomial chaos expansion Gram-Schmidt orthogonalization
原文传递
Efficient Probabilistic Load Flow Calculation Considering Vine Copula⁃Based Dependence Structure of Renewable Energy Generation 被引量:3
6
作者 MA Hongyan WANG Han +2 位作者 XU Xiaoyuan YAN Zheng MAO Guijiang 《Journal of Donghua University(English Edition)》 CAS 2021年第5期465-470,共6页
Correlations among random variables make significant impacts on probabilistic load flow(PLF)calculation results.In the existing studies,correlation coefficients or Gaussian copula are usually used to model the correla... Correlations among random variables make significant impacts on probabilistic load flow(PLF)calculation results.In the existing studies,correlation coefficients or Gaussian copula are usually used to model the correlations,while vine copula,which describes the complex dependence structure(DS)of random variables,is seldom discussed since it brings in much heavier computational burdens.To overcome this problem,this paper proposes an efficient PLF method considering input random variables with complex DS.Specifically,the Rosenblatt transformation(RT)is used to transform vine copula⁃based correlated variables into independent ones;and then the sparse polynomial chaos expansion(SPCE)evaluates output random variables of PLF calculation.The effectiveness of the proposed method is verified using the IEEE 123⁃bus system. 展开更多
关键词 probabilistic load flow(PLF) vine copula sparse polynomial chaos expansion(SPCE) Rosenblatt transformation(RT)
在线阅读 下载PDF
Sparse bivariate polynomial factorization
7
作者 WU WenYuan CHEN JingWei FENG Yong 《Science China Mathematics》 SCIE 2014年第10期2123-2142,共20页
Motivated by Sasaki's work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynom... Motivated by Sasaki's work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials. 展开更多
关键词 polynomial factorization sparse polynomial generalized Hensel lifting
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部