简介：TheresultsofplaneturbulentwakegivenbyChouPeiyuanareconsideredasthefirstorderap-proximationandputintotheequationsofturbulentfluctuation.Theequationsaresolvednumericallywithintherangeofmicro-scalebymeansofspectrummethod.Thedouble,tripleandquadruplefluctuatingvelocitycorrelationsareobtainedbycomputation.Theyareingoodagreementwithexperimentalresults.

简介：

简介：

简介：在现在的纸，在粘弹性的基础上在一根僵硬横梁上管理的一个震动的微分方程被调查了。在这个颤动的系统上管理的非线性的微分方程被一条简单、创新的途径解决，它被称为Akbari-Ganjis方法(AGM)。AGM是一个很合适的计算过程并且为解决各种各样的非线性的微分方程是可用的。而且，用哪个的AGM解决一套代数学的方程，没有任何数学操作，复杂非线性的方程能容易被解决。另外，为三个周期每周期失去的抑制比率和精力被调查了。而且，比较被数字方法(Runk45)和AGM在获得的结果之间做了。结果显示出AGM的高精确性。结果也证明由增加颤动(A)的起始的振幅的数量，抑制比率的价值将被增加，并且精力由增加周期的数字每周期减少输了。AGM是为解决微分方程的一条可靠、精确的途径，这被结束。在另一方面，说AGM能处于大多数状况直接解决线性、非线性的微分方程更好。这意味着没有任何无尺寸的过程，最后的答案能被获得。因此，AGM能在非线性的科学被看作重要进步。

简介：

简介：这篇论文使NP难的最大两断问题的答案担心。NCPfunctions被采用把最大两断问题变换成连续非线性的编程问题。解决结果连续非线性的编程问题产生在最大两断问题的最佳的值上给上面的界限的一个解决方案。从答案，贪婪策略被用来产生max-bisectionproblem的一个令人满意的近似答案。没有线搜索的一个可行方向方法被建议解决结果到产生问题的KKT点的算法的连续非线性的编程，和集中被证明。著名测试问题，并且在随机产生的测试问题上的数字实验和比较证明建议方法柔韧、很有效。

简介：

简介：Aregularsplittingandpotentialreductionmethodispresentedforsolvingaquadraticprogrammingproblemwithboxconstraints(QPB)inthispaper.AgeneralalgorithmisdesignedtosolvetheQPBproblemandgenerateasequenceofiterativepoints.Weshowthatthenumberofiterationstogenerateane-minimumsolutionorane-KKTsolutionbythealgorithmisboundedbyO(+nlog(1+)),andthetotalrunningtimeisboundedbyO(n2(n+logn+log1/ε)(n/εlog1/ε+logn))arithmeticoperations.

简介：

简介：Inthispaper,howtocomputetheeigenfrequenciesofthestructurescomposedofaseriesofinclinedcablesisshown.Thephysicsofaninclinedcablecanbecomplicated,sosolvingthedifferentialequationsevenapproximatelyisdifficult.However,ratherthansolvingthesystemof4first-orderequationsgoverningthedynamicsofeachcable,thegoverningequationsareinsteadconvertedtoasetofequationsthattheexteriormatrixsatisfies.Therefore,theexteriormatrixmethod(EMM)isusedwithoutsolvingtheoriginalgoverningequations.Eventhoughthisproducesasystemof6first-orderequations,thesimpleasymptotictechniquestofindthefirstthreetermsoftheperturbativesolutioncanbeused.Thesolutionscanthenbeassembledtoproducea6×6exteriormatrixforacablesection.Thematricesforeachcableinthestructurearemultipliedtogether,alongwiththeexteriormatricesforeachjoint.Therootsoftheproductgiveustheeigenfrequenciesofthesystem.

简介：

简介：Athreedimensionalbounce-averagedFokker-Planck(FP)numericalcodehasbeennewlydevelopedbasedonfullyimplicititerativesolvingmethod,andrelativisticeffectisalsoincludedinthecode.Thecodehasbeentestedagainstvariousbenchmarkcases:OhmicconductivityinthepresenceofweakOhmicelectricfield,runawaylossesofelectronsinthepresenceofstrongOhmicelectricfield,lowerhybridcurrentdriveandelectroncyclotroncurrentdriveviatwo-orthree-dimensionalsimulation.Allthetestcasesrunfastandcorrectlyduringcalculations.Asaresult,thecodeprovidesasetofpowerfultoolsforstudyingradiofrequencywaveheatingandcurrentdriveintokamakplasmas.

简介：Inthispaper,basedontheresulspresentedinpartIofthispaper[18],wepresentanumericalcrabedingalgorithmforsolingthenonlinearcomplementarityproblem,andproveitsconvergencecarefully.Numericalexperimentsshowthatthealgorithmissuccessful.

简介：Weusetheincrementalunknownsmethodinconjunctionwiththeiterativemethodstoapproximatethesolutionofthenonsymmetricandpositive-definitelinearsystemsgeneratedfromamultileveldiscretizationofthree-dimensionalconvection-diffusionequations.Theconditionnumbersofincrementalunknownsmatricesassociatedwiththeconvection-diffusionequationsandthenumberofiterationsneededtoattainanacceptableaccuracyareestimated.Numericalresultsarepresentedwithtwo-levelapproximations,whichdemonstratethattheincrementalunknownsmethodwhencombinedwithsomeiter-ativemethodsisveryeffcient.

简介：Thispapersolvesthenewlyconstructednonlinearmasterequationdρ/dt=κ[2f(N)aρ(1/f(N-1))a+-a+aρ-ρa+a],wheref(N)isanoperator-valuedfunctionofN=a+a,fordescribingamplitudedampingchannel,andderivestheinfiniteoperatorsumrepresentationofquasi-Krausoperatorsforthedensityoperator.Italsoshowsthatinthisnonlinearprocesstheinitialpurenumberstatedensityoperatorwillevolveintothebinomialfield(amixedstate)whenf(N)=1/(N+1)～(1/2).

简介：这笔记与Fbeing考虑答案到概括Sylvester矩阵方程AV+BW=VF一个任意的矩阵，在V和W是坚定的矩阵的地方。在Kronecker地图的帮助下，这个矩阵方程的一个明确的参量的答案被建立。建议答案拥有一种很简单、整洁的形式，并且允许矩阵F未经决定。

简介：Repetitioussimulationaftermodifyingparametersofmulti-domainphysicalsystembasedonModelicaoftenappearsinmodelexperimentandoptimizationdesign.Atpresent,thesolversbasedonModelicaneedcalculateallthecoupledblocksduringeverysimulationrunafterupdatingparameters.Basedondiscussingscaledecompositionmethodsofsimulationmodel,subdivisionsolvingstrategyandminimumsolvingstrategyareputforwardtoimprovetheefficiencyofrepetitioussimulation,bywhichthenumericalsolutionofthesimulationmodelcanbeachievedbyonlycalculatingthesolvingsequenceinfluencedbyalteredparameters.Asimplifiedmodelofaircraftisusedtodemonstratetheefficiencyofthestrategiespresented.

简介：

简介：

简介：Baum-Welchalgorithmmostlikelyresultsinunderflowinpractice.Insomeliteratures,suchas"Scaling"algorithmwasintroducedtosolvetheproblem.Inapplications,however,somemistakeswerefoundintheequationspresentedintheseliteratures.Thepracticalcalculationsshowthattheoriginalalgorithmoftenresultsinpoororevennoneconvergenceandratherhighererrorrateinspeechrecognition.Themistakesintheseliteraturesandbringsforwardthecorrectequationsareanalysed.Thespeechrecognitionsystemusingtherevisedalgorithmcanconvergewellandhaslowererrorrate.