首页/文章/ 详情

波浪传播与波-结构相互作用CFD模拟的关键影响因素与最佳实践

4月前浏览347

Prediction of Wave Propagation and Wave‐Structure Interaction

摘要:

本文围绕波浪传播与波 — 结构相互作用的 CFD 模拟,系统分析影响计算精度的关键因素并给出最佳实践。文档指出,一阶时间离散会显著衰减波幅,必须采用二阶格式;网格分辨率与纵横比直接影响波形保真,陡波宜用纵横比 2,中等陡波可用 4。HRIC 格式角度因子、界面耗散、湍流模型及初始边界条件均显著影响结果,低 Re k-ε 模型配合特定初始化可抑制湍黏度异常增长。文末给出波生成、边界处理、阻尼与强制方案的标准化设置,为 STAR-CCM + 波浪仿真提供可靠参数与流程规范。


Introduction

•   Problems often encountered with waves

•   Factors that affect prediction of wave propagation

•  Wave damping

•   Forcing solution with waves

•  Turbulence and waves

•  Some good examples


Problems With Waves

•  Amplitude reduction;

•   Disturbances of free surface;

•   Reflection at boundaries, etc …



image.png

Waves Considered: Wave 1

Wave height: H = 0.14 m

Wavelength: λ = 3.5667 m;  Wave steepness:   H/ λ ≈ 0.04

Wave period: T = 1.5 s

Water depth: d = 5 m


Δx = 0.03125  m (ca. 114 cells per wavelength)

Δz =  0.0078125 m (ca. 18 cells per wave height) Aspect ratio:  Δx/Δz = 4

Time step: 0.005 s (300 time steps per wave period)

Under_relaxation parameters: 0.8 for velocities, 0.4 for pressure, 0.8 for volume fraction Outer iterations per time step: 10 (not optimized for efficiency, rather conservative)

Inviscid, laminar or turbulent flow Second_order time discretization

Second_order space discretization

Gradients: Hybrid Gauss_LSQ, unless otherwise stated

Initial conditions: Stokes 5th_order wave theory

Boundary conditions: Stokes 5th_order wave at inlet, damping at outlet over 2λ

Waves Considered: Wave 2

Wave height: H = 4 m

Wavelength: λ = 47.154 m;  Wave steepness:   H/ λ ≈ 0.085

Wave period: 5.304 s

Water depth: 77.2 m

Solution domain length: 285 m or 190 m


Δx = 0.5  m (94 cells per wavelength)

Δz =  0.25 m (16 cells per wave height) Aspect ratio:  Δx/Δz = 2

Time step: 0.01 s (530 time steps per wave period) Inviscid, laminar or turbulent flow

Second_order time discretization

Second_order space discretization

Gradients: Hybrid Gauss_LSQ, unless otherwise stated

Initial conditions: Stokes 5th_order wave theory

Boundary conditions: Stokes 5th_order wave at inlet, damping at outlet (long domain), or Stokes 5th_order wave at inlet and outlet with forcing over one wavelength

Waves Considered: Wave 3

Wave height: H = 0.06 m

Wavelength: λ = 0.8 m;  Wave steepness:   H/ λ = 0.075

Wave period: T = 0.7 s

Water depth: d = 5 m


Δx = 0.01  m (80 cells per wavelength)

Δz =  0.005 m (12 cells per wave height) Aspect ratio:  Δx/Δz = 2

Time step: 0.003 s (233 time steps per wave period)

Under_relaxation parameters: 0.8 for velocities, 0.4 for pressure, 0.8 for volume fraction Outer iterations per time step: 10 (not optimized for efficiency, rather conservative)

Inviscid, laminar or turbulent flow Second_order time discretization

Second_order space discretization Gradients: Hybrid Gauss_LSQ

Initial conditions: Stokes 5th_order wave theory

Boundary conditions: Stokes 5th_order wave at inlet, damping at outlet over 2λ

Factors Affecting Waves

•  Time discretization

•   Grid resolution

•   Grid aspect ratio

•  Angle factor in HRIC_scheme


•   Limiters

•   Interface Momentum Dissipation model

•  Turbulence model

•   Initial and boundary conditions for turbulence

Effects of Time Discretization, I

•  First_order implicit Euler scheme damps wave amplitude severely and thus cannot be used to simulate wave propagation.

•  Second_order quadratic fully_implicit scheme provides a time_   accurate simulation of wave propagation, but imposes a limit on time_step size.

•  Free surface should not move more than 40% of cell size in any direction (fitting parabola causes under_ and overshoots).

•  This causes often problems if s mall cells are present within free_ surface zone …



image.png

Effects of Time Discretization, II

image.png

Effects of Time Discretization, III

image.png

Simulation of wave propagation over 10 wave periods, Wave 1, inviscid: same conditions, except for time discretization – 1st_order Euler (upper) vs. 2nd_order quadratic (lower)

Grid Effects, I

•  Insufficient number of cells per wavelength and wave height leads to reduced accuracy, as expected.

•  Cell aspect ratio has a surprisingly high influence on the solution …

•  The problem appears to be linked to the fact that the profile of volume fraction is differently “sharp” in different directions …

image.png

Grid Effects, II

•  The HRIC_scheme tries to sharpen the volume fraction transition in x_ direction and thus, for aspect ratio 1, leads to the formation of steps …


image.png

Solution after 38 wave periods, obtained on a grid with aspect ratio 1.  There are   236 cells per wavelength,  20 cells per wave height, 530 time steps per wave period (Wave 2 with slightly finer grid – Δz = 0.2 m instead of 0.25 m). The solution  domain is over 6 wavelengths long and damping is applied over last  2λ .

Grid Effects, III

•  For steep waves (H/λ > 0.04), aspect ratio of 2 gives best results.

•  For waves of s mall to moderate steepness, aspect ratio of 4 is also acceptable …

image.png

Grid Effects, IV


image.png

Effects of Angle Factor in HRIC_Scheme

•  The HRIC_scheme has one parameter called “Angle factor”, whose default   value is 0.05; it appears that higher values (0.15 to 0.2) are better for waves.

image.png

Wave 1, inviscid: Solution after 13.3 wave periods, obtained on a grid with aspect ratio 4

Limiter Effects

•  The limiter used in the discretization method also affects the solution...

image.png

Wave 1, inviscid: Solution after 13.3 wave periods, obtained using different limiters (all other parameters are the same).

Effects of Interface Momentum Dissipation

• The Interface Momentum Dissipation (IMD) model in VoF also affects the solution...

image.png

Wave 1, inviscid: Solution after 13.3 wave periods, obtained with and without IMD (all other parameters are the same).

Effects of Turbulence, I



•  The choice of both turbulence model and the initial and boundary conditions affects simulations of wave propagation.

•  Sylvain Lardeau showed that RANS_models normally lead to growth of turbulent viscosity over time (exponentially!) …

•  Only standard low_Re k-ε turbulence model has a built_in term which

will prevent that growth if the initial conditions are such that the ratio of turbulent kinetic energy production over dissipation is < 1.

•  However, it appears that this ratio is larger than 1 in the cells that are partially filled with liquid, no matter how turbulence variables are

initialized …

•  … which therefore eventually leads to the growth of turbulent viscosity; the initialization decides how long it will take for the effect to become  significant …

Effects of Turbulence, II

28ef2a00-3469-474c-951a-b49d4f8ea24b.png

Wave 2, turbulent, low_Re k-ε: Solution after 2.2 wave periods, obtained when starting  with default initialization for k and ε (0.001 and 0.1, respectively). Forcing over 1λ  applied at both ends, wave propagation from left to right.

Effects of Turbulence, III

image.png

Wave 2, turbulent, low_Re k-ε: Development of Pk/ε over time for one set of initial values

Effects of Turbulence, IV

image.png

Wave 2, turbulent, low_Re k-ε: Development of Pk/ε over time for one set of initial values

Effects of Turbulence, V

6f8c4053-169f-4484-96c7-1ca8884dea5f.png

Wave 2, turbulent, low_Re k-ε: Development of Pk/ε over time.  For this set of initial values, the ratio of production to dissipation of turbulence does not grow over 5000; in particular, it does not increase substantially after 20 wave periods of simulation. However, turbulent  viscosity grows further even for the constant ratio when it is > 1.

Effects of Turbulence, VI

27eb2ff4-6fd5-41a8-ae33-e3c76d7d9004.png

Wave 2, turbulent, low_Re k-ε: Turbulent viscosity after 20 wave periods, obtained when starting with different initializations for k and ε . Best results are obtained for k = 1e_5 and ε = 1e_4.  Forcing over 1λ  applied at both ends, wave propagation from left to right.

Effects of Turbulence, VII

76a6d568-11c7-4691-b27c-97a49535f734.png

Wave 2, turbulent, low_Re k-ε: Development of turbulent viscosity over time for one set of initial values. Up to 20 wave periods, values are still s mall (up to 1 Pa s), but after another 20 wave periods, turbulent viscosity becomes too high (up to 800 Pa s) …

Effects of Turbulence, VIII

8710426e-1d0f-4c4a-825c-9b683013807f.png

Wave 2, turbulent, low_Re k-ε: Comparison of computed (blue) and theoretical (red) free surface profiles. Once turbulent viscosity becomes high, wave amplitude is reduced …


免责声明:


本页面/内容部分素材来源于互联网公 开 信 息,旨在传递更多信息,不代表本平台立场。

版权归原作者或机构所有,如涉及侵权,请通过平台联系我们,我们将在核实后第一时间处理。

本平台对转载内容的真实性、准确性不作任何保证,用户需自行判断并承担使用风险。

附件

免费I18-波浪传播与波-结构相互作用CFD模拟的关键影响因素与最佳实践(Prediction of Wave Propagation and Wave‐Structure Interaction).pdf
ACTStar-CCM+船舶
著作权归作者所有,欢迎分享,未经许可,不得转载
首次发布时间:2026-04-30
最近编辑:4月前
仿真支持爱好者
在仿真的路上越走越远
获赞 333粉丝 22文章 318课程 0
点赞
收藏
作者推荐

程序员专用 DSP 算法:数学原理与源码实现

程序员专用DSP算法:数学原理与源码实现((Dsp)AlgorithmsForProgrammers)摘要:《(Dsp)AlgorithmsForProgrammers》是一本面向程序员的DSP算法与数学原理实战手册,聚焦数字信号处理核心算法的数学原理与代码实现。全书系统讲解离散傅里叶变换、基2/基4/分裂基FFT、卷积、Z变换、哈特利变换、数论变换、沃尔什变换、哈尔变换等核心算法,给出递归与非递归实现、三角函数计算优化、内存访问改进及代码自动生成方法。同时涵盖位操作、排列、排序、组合算法、高精度运算等底层技术,提供可直接复用的伪代码与C++源码,兼顾理论推导与工程效率,适合DSP开发、算法实现与高性能计算参考。AlgorithmsforprogrammersideasandsourcecodeThisdocumentisworkinprogress:readthe”importantremarks”nearthebeginningJ¨orgArndtarndt@jjj.deThisdocument1wasLATEX’datSeptember26,2002Someimportantremarksaboutthisdocument.Thisdraftisintendedtoturnintoabookaboutselectedalgorithms.Theaudienceinmindarepro-grammerswhoareinterestedinthetreatedalgorithmsandactuallywanttohave/createworkingandreasonablyoptimizedcode.Theprintablefullversionwillalwaysstayonlineforfreedownload.ItisplannedtoalsomakepartsoftheTEXsources(plusthescriptsusedforautomation)available.RightnowafewfilesoftheTEXsourcesandallextractedpseudo-codesnippets1areonline.TheC++-sourcesareonlineaspartofFXTorhfloat(arithmeticalalgorithms).ThequalityandspeedofdevelopmentdoesdependonthefeedbackthatIreceivefromyou.Yourcriticismconcerninglanguage,style,correctness,omissions,technicalitiesandeventhegoalssethereisverywelcome.Thankstothose2whohelpedtoimprovethisdocumentsofar!Thanksalsotothepeoplewhosharetheirideas(orsourcecode)onthenet.Itrytogiveduereferencestooriginalsources/authorswhereverIcan.However,IaminnowayanexpertforhistoryofalgorithmsandIprettysurewillneverbeone.Soifyoufeelthatareferenceismissingsomewhere,letmeknow.Newchapters/sectionsappearassoonastheycontainanythinguseful,sometimesjustlistingsorremarksoutliningwhatistoappearthere.A”TBD:somethingtobedone”isaremindertomyselftofillinsomethingthatismissingorwouldbenicetohave.ThestylevariesfromchaptertochapterwhichIdonotconsiderbadperse:whilesometopics(e.g.FFTs)needaclearandexplicitintroductionothers(e.g.thebitwizardrychapter)seemtobebestpresentedbybasicallyshowingthecodewithjustafewcomments.Stillotherparts(e.g.sorting)arepresentedelsewhereextremelywellsoIwillintroducethebasicideasonlyveryshortlyandsupplysome(hopefully)usefulcode.Sprachewillpartlygoaway:using/includingtheactualcodefromFXTwillbebeneficialtoboththisdocumentandFXTitself.Thegoalistoautomaticallyincludethefunctionsreferenced.Clearly,thiswilldrasticallyreducethechanceoferrorsintheshowncode(andatthesametimedrasticallyreducetheworkloadforme).InitiallyIplannedtowriteaninterpreterforSprache,itjustneverhappened.AtthesametimeFXTwillbebetterdocumentedwhichitreallyneeds.AsaconsequenceSprachewillonlybeusedwhenthereisaclearadvantagetodoso,mainlywhenthecorrespondingC++doesnotappeartobeselfexplanatory.LargerpiecesofcodewillbepresentedinC++.AtinystarteraboutC++(somegoodreasonsinfavorofC++andsomeoftheverybasicsofclasses/overloading/templates)willbeincluded.Cprogrammersdonotneedtobeshockedbytheζ++’:onlyanratherminimalsetoftheC++featuresisused.Thetheorem-likeenvironmentforthecodesshallcompletelygoaway.Itleadstoduplicationofstate-ments,especiallywithnon-pseudocode(runningtext,descriptionintheenvironmentandcommentsatthebeginoftheactualcode).Enjoyreading!ListofimportantSymbols沦xrealpartofx$ximaginarypartofxx∗complexconjugateofxaasequence,e.g.{a0,a1,...,an−1},theindexalwaysstartswithzero.atransformed(e.g.Fouriertransformed)sequencememphasizethatthesequencestotheleftandrightarealloflengthm=F[a](=c)(discrete)Fouriertransform(FT)ofa,ck=Σx(n)0(1)axzxkwherez=e±2πi/nF−1[a]inverse(discrete)Fouriertransform(IFT)ofa,F−1[a]k=Σx(n)0(1)axz−xkSkaasequencecwithelementscx:=axe±k2πix/nH[a]discreteHartleytransform(HT)ofaasequencereversedaroundelementwithindexn/2aSthesymmetricpartofasequence:aS:=a+aaAtheantisymmetricpartofasequence:aA:=a−aZ[a]discretez-transform(ZT)ofaWv[a]discreteweightedtransformofa,weight(sequence)vW1[a]inversediscreteweightedtransformofa,weightva④bcyclic(orcircular)convolutionofsequenceawithsequenceba④acbacyclic(orlinear)convolutionofsequenceawithsequenceba④−bnegacyclic(orskewcircular)convolutionofsequenceawithsequenceba④{v}bweightedconvolutionofsequenceawithsequenceb,weightva④⊕bdyadicconvolutionofsequenceawithsequencebn\NndividesNn⊥mgcd(n,m)=1a(j%m)sequenceconsistingoftheelementsofawithindicesk:k≡jmodme.g.a(even),a(odd)a(0%2),a(1%2)a(j/m)sequenceconsistingoftheelementsofawithindicesk:j·n/m≤k&lt;(j+1)·n/me.g.a(left),a(right)a(0/2),a(1/2)Chapter1TheFouriertransform1.1ThediscreteFouriertransformThediscreteFouriertransform(DFTorsimplyFT)ofacomplexsequenceaoflengthnisdefinedaszisann-throotofunity:zn=1.Backtransform(orinversediscreteFouriertransformIDFTorsimplyIFT)isthenToseethis,considerelementyoftheIFToftheFTofa:AsΣk(z①__y)k=nforx=yandzeroelse(becausezisann-throotofunity).ThereforethewholeexpressionisequaltowhereHerewewillcalltheFTwiththeplusintheexponenttheforwardtransform.Thechoiceisactuallyarbitrary1.CHAPTER1.THEFOURIERTRANSFORMThenormalizationfactorinfrontoftheFTsumsissometimesreplacedbyasingleinfrontoftheinverseFTsumwhichisoftenconvenientincomputation.Then,ofcourse,Parseval’sequationhastobemodifiedaccordingly.AstraightforwardimplementationofthediscreteFouriertransform,i.e.thecomputationofnsumseachoflengthnrequires~n2operations:[FXT:slowftinslow/slowft.cc]ismustbe+1(forwardtransform)or__1(backwardtransform),SinCos(x)returnsaComplex(cos(x),sin(x)).AfastFouriertransform(FFT)algorithmisanalgorithmthatimprovestheoperationcounttopropor-tionalnΣk__1),wheren=p1p2···pmisafactorizationofn.Incaseofapowern=pmthevaluecomputeston(p__1)logp(n).Inthespecialcasep=2evenn/2log2(n)(complex)multiplicationssuffice.ThereareseveraldifferentFFTalgorithmswithmanyvariants.1.2SymmetriesoftheFouriertransformAbitofnotationturnsouttobeuseful:Letabethesequencea(lengthn)reversedaroundelementwithindexn/2:LetaS,aAbethesymmetric,antisymmetricpartofthesequencea,respectively(Theelementswithindices0andn/2ofaAarezero).Nowleta∈R(meaningthateachelementofais∈R),thenTheFTofarealsymmetricsequenceisrealandsymmetricandtheFTofarealantisymmetricsequenceispurelyimaginaryandantisymmetric.TherebytheFTofageneralrealsequenceisthecomplexconjugateofitsreversed:Similarly,forapurelyimaginarysequenceb∈iR:TheFTofacomplexsymmetric/antisymmetricsequenceissymmetric/antisymmetric,respectively.1.3Radix2FFTalgorithms1.3.1AlittlebitofnotationAlwaysassumeaisalength-nsequence(napoweroftwo)inwhatfollows:Leta(even),a(odd)denotethe(length-n/2)subsequencesofthoseelementsofathathaveevenoroddindices,respectively.Leta(left)denotethesubsequenceofthoseelementsofathathaveindices0...n/2__1.Similarly,a(right)forindicesn/2n__1.LetSkadenotethesequencewithelementsaxe§k2πix/nwherenisthelengthofthesequenceaandthesignisthatofthetransform.ThesymbolSshallsuggestashiftoperator.InthenexttwosectionsonlyS1/2willappear.S0istheidentityoperator.1.3.2Decimationintime(DIT)FFTThefollowingobservationisthekeytothedecimationintime(DIT)FFT2algorithm:Forneventhek-thelementoftheFouriertransformiswherez=e§i2π/nandk∈{0,1,,n__1}.Thelastidentitytellsushowtocomputethek-thelementofthelength-nFouriertransformfromthelength-n/2Fouriertransformsoftheevenandoddindexedsubsequences.Toactuallyrewritethelength-nFTintermsoflength-n/2FTsonehastodistinguishthecases0≤k&lt;n/2andn/2≤k&lt;n,thereforewerewritek∈{0,1,2,...,n__1}ask=j+δwherej∈{0,1,...,n/2__1},δ∈{0,1}.Notingthatz2isjusttherootofunitythatappearsinalength-n/2FTonecanrewritethelasttwoequationsastheIdea1.1(FFTradix2DITstep)Radix2decimationintimestepfortheFFT:(Hereitissilentlyassumedthat’+’or’__’betweentwosequencesdenoteselementwiseadditionorsubtraction.)Thelength-ntransformhasbeenreplacedbytwotransformsoflengthn/2.Ifnisapowerof2thisschemecanbeappliedrecursivelyuntillength-onetransforms(identityoperation)arereached.Therebytheoperationcountisimprovedtoproportionaln·log2(n):Therearelog2(n)splittingsteps,theworkineachstepisproportionalton.Code1.1(recursiveradix2DITFFT)Pseudocodeforarecursiveprocedureofthe(radix2)DITFFTalgorithm,ismustbe+1(forwardtransform)or-1(backwardtransform):Thedatalengthnmustbeapowerof2.Theresultisinx[].Notethatnormalization(i.e.multiplicationofeachelementofx[]by1/√n)isnotincludedhere.[FXT:recursivedit2fftinslow/recfft2.cc]TheprocedureusesthesubroutineCode1.2(Fouriershift)Foreachelementinc[0..n-1]replacec[k]byc[k]timesev2πik/n.UsedwithU=§1/2fortheFouriertransform.TherecursiveFFT-procedureinvolvesnlog2(n)functioncalls,whichcanbeavoidedbyrewritingitinanon-recursiveway.Onecanevendoalloperationsinplace,notemporaryworkspaceisneededatall.Thepriceisthenecessityofanadditionaldatareordering:Theprocedurerevbin_permute(a[],n)rearrangesthearraya[]inawaythateachelementaxisswappedwitha˜x,where˜xisobtainedfromxbyreversingitsbinarydigits.Thisisdiscussedinsection8.1.Code1.3(radix2DITFFT,localized)Pseudocodeforanon-recursiveprocedureofthe(radix2)DITalgorithm,ismustbe-1or+1:[FXT:dit2-fft-localizedinfft/fftdit2.cc]Thisversionofanon-recursiveFFTprocedurealreadyavoidsthecallingoverheadanditworksinplace.Itworksasgiven,butisabitwasteful.The(expensive!)computatione:=exp(is*2*PI*I*j/m)isdonen/2·log2(n)times.Toreducethenumberoftrigonometriccomputations,onecansimplyswapthetwoinnerloops,leadingtothefirstζrealworld’FFTprocedurepresentedhere:Code1.4(radix2DITFFT)Pseudocodeforanon-recursiveprocedureofthe(radix2)DITalgo-rithm,ismustbe-1or+1:procedurefft_dit2(a[],ldn,is)//complexa[0..2**ldn-1]input,resultSwappingthetwoinnerloopsreducesthenumberoftrigonometric(exp())computationstonbutleadstoafeaturethatmanyFFTimplementationsshare:Memoryaccessishighlynonlocal.Foreachrecursionstage(valueofldm)thearrayistraversedmhtimeswithn/maccessesinstridesofmh.Asmhisapowerof2thiscan(oncomputersthatusememorycache)haveaverynegativeperformanceimpactforlargevaluesofn.OnacomputerwheretheCPUclock(366MHz,AMDK6/2)is5.5timesfasterthanthememoryclock(66MHz,EDO-RAM)IfoundthatindeedforsmallnthelocalizedFFTisslowerbyafactorofabout0.66,butforlargenthesameratioisinfavouroftheζnaive’procedure!Itisagoodideatoextracttheldm==1stageoftheoutermostloop,thisavoidscomplexmultiplicationswiththetrivialfactors1+0i:Replace更多内容见附件免责声明:本页面/内容部分素材来源于互联网公开信息,旨在传递更多信息,不代表本平台立场。版权归原作者或机构所有,如涉及侵权,请通过平台联系我们,我们将在核实后第一时间处理。本平台对转载内容的真实性、准确性不作任何保证,用户需自行判断并承担使用风险

有附件
未登录
还没有评论
课程
培训
服务
行家
VIP会员 学习计划 福利任务
下载APP
联系我们
帮助与反馈