简介:在Tikhonov正则化方法的基础上将其转化为一类l1极小化问题进行求解,并基于Bregman迭代正则化构建了Bregman迭代算法,实现了l1极小化问题的快速求解.数值实验结果表明,Bregman迭代算法在快速求解算子方程的同时,有着比最小二乘法和Tikhonov正则化方法更高的求解精度.
简介:Undertheframeofthe(2+1)-dimensionalzerocurvatureequationandTumodel,the(2+1)-dimensionaldispersivelongwavehierarchyisobtained.Furthermore,theloopalgebraisexpandedintoalargerone.Moreover,aclassofintegrablecouplingsystemfordispersivelongwavehierarchyand(2+1)-dimensionalmulti-componentintegrablesystemwillbeinvestigated.
简介:Inthispaper,weusecontractionmappingprinciple,operator-theoreticapproachandsomeuniformestimatestoestablishlocalsolvabilityoftheparabolic-hyperbolictypechemotaxissystemwithfixedboundaryin1-dimensionaldomain.Inaddition,localsolvabilityofthefreeboundaryproblemisconsideredbystraighteningthefreeboundary.
简介:Letp(z)=beapolynomialdegreenandletThenaccord-ingtoBernstein’sinequality||p’||
简介:The3-stageClosnetworkC(n,m,r)isconsideredasthemostbasicandpopularmultistageinterconnectionnetworkwhichhasbeenwidelyemployedfordatacommunicationsandparallelcomputingsystems.Quitealotofeortshasbeenputontheresearchofthe3-stageClosnetwork.Unfortunately,verylittleisknownforthemultiratemulticastClosnetworkwhichisthemostcomplicatedcase.Firstlyasucientconditionfor1-ratemulticastnetworkstobeSNBisgiven,fromwhicharesultfor2-ratemulticastnetworkstobeWSNBcaneasilybegotten.Furthermore,byusingareservation-schemerouting,morespecificresultfor2-ratemulticastnetworkstobeWSNBcanbeobtainedforthecaseofoneofthemexceeding1/2.
简介:与联系的谎言点对称新(2+1)维的KdVequationu_t+3u_xu_y+u_(xxy)=0被调查。一些类似减小被解决相应特战程导出。为这个方程的Painleve分析也被介绍,孤立子答案从Baecklund转变直接被获得。
简介:Usingrecursivemethod,thispaperstudiesthequeuesizepropertiesatanyepochn+inGeom/G/1(E,SV)queueingmodelwithfeedbackunderLASDA(latearrivalsystemwithdelayedaccess)setup.Somenewresultsabouttherecursiveexpressionsofqueuesizedistributionatdifferentepoch(n+,n,n-)areobtained.Furthermoretheimportantrelationsbetweenstationaryqueuesizedistributionatdifferentepochsarediscovered.TheresultsaredifferentfromtherelationsgiveninM/G/1queueingsystem.Themodeldiscussedinthispapercanbewidelyappliedinmanykindsofcommunicationsandcomputernetwork.
简介:LetL~2([0,1],x)bethespaceoftherealvalued,measurable,squaresummablefunctionson[0,1]withweightx,andlet■_nbethesubspaceofL~2([0,1],x)definedbyalinearcombinationofJ_0(μ_kx),whereJ_0istheBesselfunctionoforder0and{μ_k}isthestrictlyincreasingsequenceofallpositivezerosofJ_0.Forf∈L~2([0,1],x),letE(f,■_n)betheerrorofthebestL~2([0,1],x),i.e.,approximationoffbyelementsof■_n.Theshiftoperatoroffatpointx∈[0,1]withstept∈[0,1]isdefinedbyT(t)f(x)=(1/π)∫_0~πf((x~2+t~2-2xtcosθ)~(1/2))dθ.Thedifferences(1-T(t))~(r/2)f=∑_(j=0)~∞(-1)~j(_j~(r/2))T~j(t)foforderr∈(0,∞)andtheL~2([0,1],x)-modulusofcontinuityω_r(f,τ)=sup{||(I-T(t))~(r/2)f||:0≤t≤τ}oforderraredefinedinthestandardway,whereT~0(t)=Iistheidentityoperator.Inthispaper,weestablishthesharpJacksoninequalitybetweenE(f,■_n)andω_r(f,τ)forsomecasesofrandτ.Moreprecisely,wewillfindthesmallestconstant■_n(τ,r)whichdependsonlyonn,r,andτ,suchthattheinequalityE(f,■_n)≤■_n(τ,r)ω_r(f,τ)isvalid.
简介:Basedontherangespaceproperty(RSP),theequivalentconditionsbetweennonnegativesolutionstothepartialsparseandthecorrespondingweightedl_1-normminimizationproblemarestudiedinthispaper.Differentfromotherconditionsbasedonthesparkproperty,themutualcoherence,thenullspaceproperty(NSP)andtherestrictedisometryproperty(RIP),theRSPbasedconditionsareeasiertobeverified.Moreover,theproposedconditionsguaranteenotonlythestrongequivalence,butalsotheequivalencebetweenthetwoproblems.First,accordingtothefoundationofthestrictcomplementaritytheoremoflinearprogramming,asufficientandnecessarycondition,satisfyingtheRSPofthesensingmatrixandthefullcolumnrankpropertyofthecorrespondingsub-matrix,ispresentedfortheuniquenonnegativesolutiontotheweightedl_1-normminimizationproblem.Then,basedonthiscondition,theequivalenceconditionsbetweenthetwoproblemsareproposed.Finally,thispapershowsthatthematrixwiththeRSPoforderkcanguaranteethestrongequivalenceofthetwoproblems.
简介:Thepurposeofthepresentpaperistoevaluatetheerroroftheapproximationofthefunc-tionfL1[0,1]byKantorovich-BernsteinpolynomialsinLp-metric(0
1).