简介:GyroscopicdynamicsystemcanbeintroducedtoHamiltoniansystem.BasedonanadjointsymplecticsubspaceiterationmethodofHamiltoniangyroscopicsystem,anadjointsymplecticsubspaceiterationmethodofindefiniteHamiltonianfunctiongy-roscopicsystemwasproposedtosolvetheeigenvalueproblemofindefiniteHamiltonianfunctiongyroscopicsystem.ThecharacterthattheeigenvaluesofHamiltoniangyroscopicsystemareonlypureimaginaryorzerowasused.TheeigenvaluesthatHamiltonianfunctionisnegativecanbeseparatedsothattheeigenvalueproblemofpositivedefiniteHamiltonianfunctionsystemwaspresented,andanadjointsymplecticsubspaceiterationmethodofpositivedefiniteHamiltonianfunctionsystemwasusedtosolvetheseparatedeigenvalueproblem.Therefore,theeigenvalueproblemofindefiniteHamiltonianfunctiongyroscopicsystemwassolved,andtwonumericalexamplesweregiventodemonstratethattheeigensolutionsconvergeexactly.
简介:InthispaperweprovideaprobabilisticapproachtothefollowingDirichletProblem{(∑x4(αijxj)+∑bixi+ξ)u=0,iDu=g,onD,withoutassumingthattheeigenvaluesoftheoperator∑xi(αijxj)+∑bixi+ξwithDirichletboundaryconditionsareallstrictlynegative.TheresultsofthispapergeneralizedthoseofMa.
简介:Accordingtotheclassicalelastictheory,thereisalwaysadiscontinuityofrotationangleontheinterfacebetweendifferentmaterials.Thisillogicresultcanbeovercomebythestraingradientplasticitytheory.Inthelightofthistheory,thereisagroupofboundarylayersolutionsnearthein-terface,whichhavemadeimportantadjustmentoftheclassicalresults.
简介:Censiderthesolutionsofthematrixinverseproblem,whicharesymmetricpositivesemidefiniteonasubspace.Necessaryandsufficientconditionsforthesolvability,aswellasthegeneralsolutionareobtained.Thebestapproximatesolutionbytheabovesolutionsetisgiven.Thustheopenproblemin[1]issolved.
简介:Amodifiedsequentiallinearprogrammingalgorithmispresented,whosesubproblemisalwayssolvable,fortheextendedlinearcomplementarityproblem(XLCP),theglobalconvergenceofthealgorithmunderassumptionofX-rowsufficiencyorX-columnmonotonicityisproved.Asaresult,asufficientconditionforexistenceandboundednessofsolutiontotheXLCPareobtained.
简介:Thekeyideabehindculturalalgorithmistoexplicitlyacquireproblem-solvingknowledgefromtheevolvingpopulationandinreturnapplythatknowledgetoguidethesearch.Inthisarticle,culturalalgorithm-simulatedannealingisproposedtosolvetheroutingproblemofmobileagent.Theoptimalindividualisacceptedtoimprovethebeliefspace’sevolutionofculturalalgorithmsbysimulatedannealing.Thestepsizeinsearchisusedassituationalknowledgetoguidethesearchofoptimalsolutioninthepopulationspace.Becauseofthisfeature,thesearchtimeisreduced.Experimentalresultsshowthatthealgorithmproposedinthisarticlecanensurethequalityofoptimalsolutions,andalsohasbetterconvergencespeed.Theoperationefficiencyofthesystemisconsiderablyimproved.
简介:Inthispaper,weconstructandanalyseamortarfinitevolumemethodforthediscretizationforthebiharmonicprobleminR2.Thismethodisbasedonthemortar-typeAdininonconformingfiniteelementspaces.TheoptimalorderH2-seminormerrorestimatebetweentheexactsolutionandthemortarAdinifinitevolumesolutionofthebiharmonicequationisestablished.
简介:AspecializedHungarianalgorithmwasdevelopedhereforthemaximumlikelihooddataassociationproblemwithtwoimplementationversionsduetopresenceoffalsealarmsandmisseddetections.Themaximumlikelihooddataassociationproblemisformulatedasabipartiteweightedmatchingproblem.Itsdualityandtheoptimalityconditionsaregiven.TheHungarianalgorithmwithitscomputationalsteps,datastructureandcomputationalcomplexityispresented.Thetwoimplementationversions,Hungarianforest(HF)algorithmandHungariantree(HT)algorithm,andtheircombinationwiththenaveauctioninitializationarediscussed.ThecomputationalresultsshowthatHTalgorithmisslightlyfasterthanHFalgorithmandtheyarebothsuperiortotheclassicMunkresalgorithm.
简介:分级的integro微分的方程的不可思议地使不安的边界价值问题被微分不平等方法广泛地学习了。然而,带这个方法在上不似乎可能到相应非线性的向量integro微分的方程。因此,为n维的向量integro微分的方程这个问题没充分被解决。这里,我们学习这个非线性的向量问题并且获得一些结果。在这份报纸的途径是把适当integro微分的方程转变成一正规或二个一阶的方程的diagonalized系统。关键词Integro微分的方程-单个不安-边界价值问题-diagonalization方法2000苏布杰克特先生分类45J-34B-34E
简介:Thispaperdealswiththespectralapproximationofanincompressibleviscous/inviscidcou-pledmodel.AnefficientUzawaalgorithmbasedonanewvariationalformulationisproposed.ThegeneralizationtothecouplingbetweentheNavier-StokesequationsandtheEulerequationsisdiscussed.
简介:BasedonArnoldi’smethod,aversionofgeneralizedArnoldialgorithmhasbeendevel-opedforthereductionofgyroscopiceigenvalueproblems.Byutilizingtheskewsymmetryofsystemmatrix,averysimplerecurrencescheme,namedgyroscopicArnoldireductionalgorithmhasbeenob-tained,whichisevensimplerthantheLanczosalgorithmforsymmetriceigenvalueproblems.Thecomplexnumbercomputationiscompletelyavoided.Arestarttechniqueisusedtoenablethereductionalgorithmtohaveiterativecharacteristics.Ithasbeenfoundthattherestarttechniqueisnotonlyef-fectivefortheconvergenceofmultipleeigenvaluesbutitalsofurnishesthereductionalgorithmwithatechniquetocheckandcomputemissedeigenvalues.Bycombiningitwiththerestarttechnique,theal-gorithmismadepracticalforlarge-scalegyroscopiceigenvalueproblems.Numericalexamplesaregiv-entodemonstratetheeffectivenessofthemethodproposed.
简介:WeextendtheobliqueprojectionmethodgivenbyY.Saadtosolvethegeneralizedleastsquaresproblem.Thecorrespondingobliqueprojectionoperatorispresentedandtheconvergencetheoremsareproved.SomenecessaryandsufficientconditionsforcomputingthesolutionortheminimumN-normsolutionofthemin||Ax-b||M2havebeenproposedaswell.