简介：Inthispaper,theproblemoffindingtheintersectionofatriangularBezierpatchandaplaneisstudied.Forthedegreethatonefrequentlyencountersinpractice,i.e.n=2,3,anefficientandreliablealgorithmisobtained,andcomputationalstepsarepresented.

简介：Triangularsystemsplayafundamentalroleinmatrixcomputations.Ithasbecomecommonplacethattriangularsystemsaresolvedtobemoreaccurateeveniftheyareill-conditioned.Inthispaper,wedefinestructuredconditionnumberandgivestructured(forward)perturbationbound.Inaddition,wederivetherepresentationofoptimalstructuredbackwardperturbationbound.

简介：让并且吗？是Banach代数学。让吗？是Banach与围住1。当时是有平常的操作和标准的Banach代数学。如此的代数学被称为三角形的Banach代数学。在这份报纸，三角形的Banach代数学的等轴的同晶型被描绘。

简介：Anewmethodforconstructingafittingsurfaceonatriangulargridispresented.Assumingimagesareobtainedbysamplingfromtheoriginalscene.Conventionalpolynomialinterpolationmethodsgenerallyconstructthefittingsurfaceonasquaregrid.Differentfromexistingmethods,thenewmethodconstructsthefittingsurfaceonatriangulargridwhichcandividetheoriginalsurfacemoredetailedandimproveapproximationaccuracy.Asthequalityoftheimageedgesplaysakeyroleinvisualeffectsofimage,thenewmethodusesimageedgesasconstraintstogetatrianglegrid.Thenewmethodconstructsacubicpolynomialpatchlocallyusingimagedatatoapproximatetheoriginalsurface.Experimentalcomparisonresultsofthenewmethodwithothermethodsshowthatthenewmethodcanproducehigh-qualityimagesandremovethezigzaggingartifact.

简介：让D是任何部门戒指，并且让是k×k的集合(k≥2)矩形的块在D上的三角形的矩阵。为A，B∈，如果等级(−B)=1，然后，A和B被说由∼邻近、表示B。地图φ：被说如果，是在两个方向保存地图的毗邻∼B如果并且仅当φ(A)∼φ(B)。让G所有毗邻的转变组上在两个方向正在保存bijections。什么时候m1,nk≥2，我们描绘G的代数学的结构，并且获得矩形的块的基本定理在D上的三角形的矩阵。

简介：Abstract,Inthispaper,anecessaryconditionforamaximaltriangularalgebratobeclosedisgiven,Anecessaryandsufficientconditionforamaxima]triangularalgebratohestronglyreducibleisobtained,

简介：我们考虑形式\的上下文无关语法(G=\{f\tof^{b_1+b_2+1}g^{a_1+a_2}，g\tof^{b_1}g^{a_1+1}\}\)，在哪儿一i和bi是易于某些确实条件的整数。如此的语法G产生三角形的数组{T(n，k)}<潜水艇class=“a-plus-plus”>0kn令人满意一种三术语的复发关系。许多组合序列能这样被产生。让T<潜水艇class=“a-plus-plus”>n(x)=<潜水艇class=“a-plus-plus”>k=0<啜class=“a-plus-plus”>nT(n，k)x<啜class=“a-plus-plus”>k。关于G基于微分操作员，我们定义线性操作员P的一个序列n以便Tn+1(x)=Pn(Tn(x))。使用由于Borcea和Br在multivariate多项式上保存线性操作员的真实稳定性的描述?nd?訤?X

简介：Inthisnote,theexplicitrepresentationsofMoore-Penroseinversesoflowertriangularoperatormatricesareestablished.Asanapplication,theexplicitrepresentationsofBott-DuffininversesofboundedlinearoperatorsonaHilbertspacewithrespecttoaclosedsubspaceareobtained.

简介：

简介：Parameterizationoftrianglemeshesisafundamentalproblemfortexturemapping,surfacefitting,surfacereconstruction,andmeshediting.Thedeformationoftriangularmeshescausedbytheparameterizedprocessisthemeasurementofparameterization.Traditionalstandardmethodhasitslimitationwhenevaluatingmixturedistortionenergyparameterizations.Thusanevaluationmethodbasesondistortionenergyparameterizationoftriangularmeshesisintroducedforthelimitation.Thenovelmethodemploysanadaptiveexpressionformtothemixtureenergy,andusesaweightfactortorepresentdistortionenergydistribution.Byusingthismethod,wecanevaluateallkindsofparameterizationinauniformmeasurementandacquireamoreintuitiveandclearevaluation.

简介：Abstract,Inthispaper,algorithmsfordeterminingthetriangularfactorizationofCauchytypematricesandtheirinversesarederivedbyusingO(n2)operations.

简介：Wepresentanovelalgorithmforadaptivetriangularmeshcoarsening.Thealgorithmhastwostages.First,theinputtriangularmeshisrefinedbyiterativelyapplyingtheadaptivesubdivisionoperatorthatperformsaso-calledred-greensplit.Second,therefinedmeshissimplifiedbyaclusteringalgorithmbasedoncentroidalVoronoitessellations(CVTs).TheaccuracyandgoodqualityoftheoutputtriangularmeshareachievedbycombiningadaptivesubdivisionandtheCVTstechnique.Testresultsshowedthemeshcoarseningschemetoberobustandeffective.Examplesareshownthatvalidatethemethod.

简介：这份报纸描述怎么为三角形的Bezier表面构造跳的金字塔和跳的锥的实际途径。例子被提供说明建设的过程，比较在围住体积的各种各样的表面之间被做。作为为构造的一个起点，而且，我们提供一个方法计算三角形的Bezier表面的速度图并且为计算一套向量的跳的锥改进算法。[从作者抽象]

简介：ＯＮＴＨＥＳＥＬＥＣＴＩＯＮＯＦＳＨＡＰＥＦＵＮＣＴＩＯＮＳＰＡＣＥＳＯＦＴＲＩＡＮＧＵＬＡＲＰＬＡＴＥＥＬＥＭＥＮＴＳＣｈｅｎＳｈａｏｃｈｕｎ；ＳｈｉＤｏｎｇｙａｎｇ（Ｄｅｐｔ．ｏｆＳｙｓ．Ｓｃｉ．＆Ｍａｔｈ．，ＺｈｅｎｇｚｈｏｕＵｎｉｖ．，Ｚｈｅ...

简介：

简介：第四级的代码的特征被分析。区分三角方向的规则被给出。邻居由从回到前面分解第四级的代码发现的一个算法在这篇论文被介绍。在这个算法和Bartholdi之间的时间复杂性的对比的分析是算法被接近。结果说明一般水准消费了这个算法的时间，这是大约23.66%Bartholdi的算法。

简介：

简介：Usingatriangularlatticemodeltostudythedesignabilityofproteinfolding,weovercametheparityproblemofpreviouscubiclatticemodelandenumeratedallthesequencesandcompactstructuresonasimpletwo-dimensionaltriangularlatticemodelofsize4+5+6+5+4.Weusedtwotypesofaminoacids,hydrophobicandpolar,tomakeupthesequences,andachieved223+212differentsequencesexcludingthereversesymmetrysequences.Thetotalstringnumberofdistinctcompactstructureswas219,093,excludingreflectionsymmetryintheself-avoidingpathoflength24triangularlatticemodel.Basedonthismodel,weappliedafastsearchalgorithmbyconstructingaclustertree.Thealgorithmdecreasedthecomputationbycomputingtheobjectiveenergyofnon-leafnodes.Theparallelexperimentsprovedthatthefasttreesearchalgorithmyieldedanexponentialspeed-upinthemodelofsize4+5+6+5+4.Designabilityanalysiswasperformedtounderstandthesearchresult.

简介：Inthispaper,antiplaneresponseofanisoscelestriangularhilltoincidentSHwavesisstudiedbasedonthemethodofcomplexfunctionandbyusingmovingcoordinatesystem.Thestandingwavefunction,whichcansatisfythegoverningequationandboundarycondition,isprovided.Furthermore,numericalexamplesarepresented;theinfluencesofwavenumberandangleoftheincidentwavesandtheangleofthehill'speakongroundmotionarediscussed.

简介：在这份报纸，我们为一个semilinear问题扩大插入内推的系数的想法到三角形的有限体积元素方法。我们首先为semilinear的一个边界价值问题与插入内推的系数介绍三角形的有限体积元素方法椭圆形的方程。我们然后分别地在H1标准，L2标准和L鈭?标准导出集中估计。最后，一个例子被给说明建议方法的有效性。[从作者抽象]