共查询到20条相似文献,搜索用时 906 毫秒
1.
文献[1]研究了一类Block型代数的李双代数结构, 该文对此代数进行了量子化. 相似文献
2.
本文运用最近由Taibleson和Weiss首创的函数的Block(块)分解方法,分别研究了奇异积分和卷积型积分的点收敛问题。本文的主要结果是定理1和定理2,定理1改进了新近Calderón关于奇异积分点收敛的工作,定理2是关于卷积型积分点收敛的一般性结果,它同时包含着Calderón-Zygmund的经典结果和Carrillo的新近结果。 相似文献
3.
我们将引入一类新的Block空间并把它应用于奇异积分理论。首先引入一些记号和定义。设S~(n-1)是n维欧空间R~n中的n-1维单位球面,当n≥2时,以B(x,r)表示S~(n-1)中以x为中心,r为半径的球:B(x,r)={y∈S~(n-1):|x-y|≤r}。以ρ表示R~n中绕原点的旋转,|ρ|表示它的模,即|ρ|=|x-ρx|,其中|x|=1。设K(x)=Ω(x)/|x|~n是R~n\{0}上局部可积函数,Ω(x)是正性齐次且满足消失条件的函数,其中dσ(x)表示S~(n-1)上的Lebesgue测度。又设b(x)是有界的径向函数,H(x)=b(x)K(x)。考虑算子 相似文献
4.
5.
目的 探讨吻合器痔上黏膜环切术(PPH 术)加直肠闭式修补术(Block 术)治疗直肠前突的临床疗效。方法 近9年来对女性直肠前突患者先后采用Block 术(36 例)和PPH+Block 术(41 例)治疗,分析两组患者的临床资料,观察并比较其术后第1 天出血量、术后并发症的发生率及疗效。结果 两组患者术后第1 天出血量及术后并发症发生率的差异均无统计学意义(均P>0.05)。术后3、6、12个月PPH+Block 术组与Block 术组的痊愈率分别为85.4%、82.9%、82.9%和58.3%、52.8%、52.8%,差异均有统计学意义(均P<0.05)。结论 PPH+Block 术治疗直肠前突较单纯Block 术疗效更好,值得推广应用。 相似文献
6.
7.
Let G be a finite group, R a complete local principal ideal domain and peJ-(R). with p being a fixed prime, H≤G, B and B be an RG-block with idempot-ent e aud an RH-block with idempotent e respectively. The restriction of B as a 相似文献
8.
9.
Suppose that comlex matrix A or order n is partitioned as where the diagonal submatrices A_(ⅱ) are square of order n_i(1≤i≤N) .If each A_(ⅱ)is nonsingular and satisfies sum from (j=1 j≠i) to N(‖A_(ij)~(-1)A_(ij)‖≤1),1≤i≤N. thon A is called quasi-block diagonally domfnant. Specially, if strictly inequality in(2) is valid for all 1≤i≤N then A is called quasi-block strictly diagonally dominant. If strict inequality in (2) is valid for at least one i (1≤i≤N) and 相似文献
10.
Chen Jianlong 《数学季刊》1996,(1)
Moore-Penrose Inverses and Group Inverses of Block k-Circulant MatricesMoore-PenroseInversesandGroupInversesofBlockk-Circulan... 相似文献
11.
In 1966, Reilly Characterized bisimple ω-semigroups as Bruck-Reilly extensions of Groups.Later, Munn and Reilly proved that a congruence on a bisimple ω-semigroup is a group congruence or is idempotent-separating. Many author investigated the congruences on Bruck-Reilly ex- 相似文献
12.
对特征0的域F以及F的一个加法子群G, 一类Block型Lie代数B(G)定义为以{Lα,i,c|α ∈ G, -1≤ i∈Z}为基, 并满足关系
[Lα,i, Lβ,j]=((i+1)β-(j+1)α)Lα+β,i+j+αδα,-βδi+j,-2c, [c,Lα,i]=0.给定群G上的一个与其群结构相融的全序以及任意的Λ∈B(G)*0, 我们定义了B(G)上的Verma模M(Λ,), 并且完全决定了M(Λ,), 的可约性. 而且证明了B(Z)上的一个不可约最高权模是伪有限的当且仅当它是某个Verma 模的非平凡商模. 相似文献
13.
Qian Yin Linzhang Lu 《高等学校计算数学学报(英文版)》2006,15(3):268-277
In this paper, we develop an implicitly restarted block Arnoldi algorithm in a vector-wise fashion. The vector-wise construction greatly simplifies both the detection of necessary deflation and the actual deflation itself, so it is preferable to the block-wise construction. The numerical experiment shows that our algorithm is effective. 相似文献
14.
李国安 《数学的实践与认识》2007,37(10):178-184
导出了二元Block~Basu型指数分布的一个特征,利用该特征,获得了二元Block~Basu型指数分布参数的最大似然估计及矩估计,给出了强度服从二元Block~Basu型分布时并联结构系统可靠度的估计,并给出了二元Block~Basu型指数分布的一个随机模拟. 相似文献
15.
P. B. Dzhakov 《Mathematical Notes》1975,17(6):541-546
It is shown that a block sequence in a nuclear Fréchet space with a basis has a block extension if and only if the subspace it generates is complemented. In addition, a short proof is given of the following result of Dubinsky and Robinson: a nuclear Fréchet space is isomorphic to = RN, N = {1,2,...} if it has a basis such that any block sequence with blocks of length 2 of any permutation of this basis has a block extension. It is shown that a similar result holds without considering permutations of the basis if the length of the blocks is arbitrary.Translated from Matematicheskie Zametki, Vol. 17, No. 6, pp. 899–908, June, 1975.The author wishes to thank B. S. Mityagin for calling his attention to this problem and for his valuable suggestions. 相似文献
16.
Sabine Le Borne 《PAMM》2006,6(1):747-748
For saddle point problems in fluid dynamics, many preconditioners in the literature exploit the block structure of the problem to construct block diagonal or block triangular preconditioners. The performance of such preconditioners depends on whether fast, approximate solvers for the linear systems on the block diagonal as well as for the Schur complement are available. We will construct these efficient preconditioners using hierarchical matrix techniques in which fully populated matrices are approximated by blockwise low rank approximations. We will compare such block preconditioners with those obtained through a completely different approach where the given block structure is not used but a domain-decomposition based ℋ︁-LU factorization is constructed for the complete system matrix. Preconditioners resulting from these two approaches will be discussed and compared through numerical results. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
17.
Let G be a finite group,H≤G,F a field of characteristic p,where p is afixed prime;B=e·FH and B=e·FG be an FH-block and an FG-block resp.B issaid to be covered by B if B|B↓_(H×H);dually,B is said to be covered by B ifB|B↑~(G×G).Donote the Brauer homomorphism into C_G(P)by Br_(C_G(P))for any p-subgroupP. 相似文献
18.
19.
Stability Analysis Of Block ɵ-Methods For Neutral Multidelay-Differential-Algebraic Equations
下载免费PDF全文
![点击此处可从《Journal of Applied Analysis & Computation》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Yuhao Cong Chunying Mao Chengxiang Jiang 《Journal of Applied Analysis & Computation》2012,2(3):273-279
This paper is concerned with the stability analysis of Block ɵ -met hods forsolving neutral multidelay-di®erential- algebraic equations. We shown that if the coefficient matrices of neutral multidelay-differential-algebraic equations satisfying somestability conditions and ɵ ϵ [ 1 2; 1], then the numerical solution of Block µ-methods forsolving neutral multidelay-differential-algebraic equations is asymptotically stable. 相似文献
20.
We propose an efficient and robust algorithm to solve the steady Euler equa- tions on unstructured grids.The new algorithm is a Newton-iteration method in which each iteration step is a linear multigrid method using block lower-upper symmetric Gauss-Seidel(LU-SGS)iteration as its smoother To regularize the Jacobian matrix of Newton-iteration,we adopted a local residual dependent regularization as the replace- ment of the standard time-stepping relaxation technique based on the local CFL number The proposed method can be extended to high order approximations and three spatial dimensions in a nature way.The solver was tested on a sequence of benchmark prob- lems on both quasi-uniform and local adaptive meshes.The numerical results illustrated the efficiency and robustness of our algorithm. 相似文献