首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 712 毫秒
1.
Summary In this paper we give bounds for the error constants of certain classes of stable implicit finite difference methods for first order hyperbolic equations in one space dimension. We consider classes of methods that user downwind ands upwind points in the explicit part andR downwind andS upwind points in the implicit part, respectively, and that are of optimal orderp=min (r+R+s+S, 2(r+R+1), 2(s+S)).In some cases the error constant of interpolatory methods [5] can be improved. The results are proved via the order star technique. They are further used to determine methods of optimal order that are stable.  相似文献   

2.
In Burrage and Butcher [3] the concept of Algebraic Stability was introduced in the study of Runge-Kutta methods. In this paper an analysis is made of the family ofs-stage Runge-Kutta methods of order 2s—2 or more which possesses this property.  相似文献   

3.
In Burrage and Burrage [1] it was shown that by introducing a very general formulation for stochastic Runge-Kutta methods, the previous strong order barrier of order one could be broken without having to use higher derivative terms. In particular, methods of strong order 1.5 were developed in which a Stratonovich integral of order one and one of order two were present in the formulation. In this present paper, general order results are proven about the maximum attainable strong order of these stochastic Runge-Kutta methods (SRKs) in terms of the order of the Stratonovich integrals appearing in the Runge-Kutta formulation. In particular, it will be shown that if ans-stage SRK contains Stratonovich integrals up to orderp then the strong order of the SRK cannot exceed min{(p+1)/2, (s−1)/2},p≥2,s≥3 or 1 ifp=1.  相似文献   

4.
F on s edges and k disjoint cycles. The main result is the following theorem. Let F be a forest on s edges without isolated vertices and let G be a graph of order at least with minimum degree at least , where k, s are nonnegative integers. Then G contains the disjoint union of the forest F and k disjoint cycles. This theorem provides a common generalization of previous results of Corrádi & Hajnal [4] and Brandt [3] who considered the cases (cycles only) and (forests only), respectively. Received: October 13, 1995  相似文献   

5.
Loana Boca 《代数通讯》2013,41(14):5769-5776
Let u q (s[(2)) denote the quantum enveloping algebra of s((2) over a field k. In this note we show that if q is a root of unity, then the coradical filtration {H n}n ≥0 of u q (s[(2)) is the filtration by a certain degree function depending on the order of q 4 and on the characteristic of k. The degree function will be explicitly described in Section 2 for char s = 0 and in Section 3 for char k = s > 0.

We use the fact that u q (g) is pointed for any finite-dimensional semisimple Lie algebra (proved in [R], [Ml] and remarked in [Tl]).

The skew-primitives of u q (g[(n)) and u q (s[(n)) are described in [T2], based en [Tl]. The theorem in [T2] motivated the present result, although we did not need its full strength in the proof.

The filtration of u q (g) over Q(q), where g is a finite dimensional complex simple Lie algebra, and q is an indeterminate over Q, is described in [CM]. The case of u q (s[(2)) with char k = 0 and where q is not a root of unity was first solved in [Ml].  相似文献   

6.
In this paper, we describe some aspects of a Lenz(-Barlotti)-type classification of finite generalized quadrangles, which is being prepared by the author. Some new points of view are given. We also prove that each span-symmetric generalized quadrangle of order s > 1 with s even is isomorphic to $ \mathcal{Q} $ (4, s), without using the canonical connection (obtained by S. E. Payne in [15] between groups of order s 3 ? s with a 4-gonal basis and span-symmetric generalized quadrangle of order s. (The latter result was obtained for general s independently by W. M. Kantor in [10], and the author in [30] Finally, we obtain a classification program for all finite translation generalized quadrangles, which is suggested by the main results of [27], [30], [32], [35], [38] and [37].  相似文献   

7.
In this paper we prove the multiplicity result for the Dirichlet problems (A s ) and (B t ) with a boundary data inL 2 Q) and with the nonlinearity interacting with the spectrum of the elliptic operatorL. The fact that the boundary data is inL 2 leads in a natural way to the Dirichlet problem in a weighted Sobolev space. We follow methods and arguments from the recent papers of Walter and McKenna [11] and [12].  相似文献   

8.
Previously, the authors [9] classified various types of continuous explicit Runge-Kutta methods of order 5. Here, new lower bounds on the numbers of stages required for a sequence of continuous methods of increasing orders which are embedded in a continuouss-stage method of orderp are obtained. Carnicer [2] showed for each continuous explicit Runge-Kutta method of orderp in a mildly restricted family that at least 2p – 2 stages are required. Here, the same bound is established for all such methods of orderp.This research was supported by the Natural Sciences and Engineering Research Council of Canada, and the Information Technology Research Centre of Ontario. In addition, the second author was supported by the Ministero dell'Università e della Ricerca Scientifica e Tecnologica of Italy.  相似文献   

9.
Three tree-paths     
Itai and Rodeh [3] have proved that for any 2-connected graph G and any vertex sG there are two spanning trees such that the paths from any other vertex to s on the trees are disjoint. In this paper the result is generalized to 3-connected graphs.  相似文献   

10.
Joseph and Kwack [9] introduced the notion of (θ,s)-continuous functions in order to investigateS-closed spaces due to Thompson [32]. In [26], the present authors investigated further properties of (θ,s)-continuous functions. In this paper, we introduce a new class of functions called α-quasi-irresolute functions which is weaker than (θ,s)-continuous and improve some results established in [26].  相似文献   

11.
In this paper, we study diagonally implicit Runge-Kutta-Nyström methods (DIRKN methods) for use on parallel computers. These methods are obtained by diagonally implicit iteration of fully implicit Runge-Kutta-Nyström methods (corrector methods). The number of iterations is chosen such that the method has the same order of accuracy as the corrector, and the iteration parameters serve to make the method at least A-stable. Since a large number of the stages can be computed in parallel, the methods are very efficient on parallel computers. We derive a number of A-stable, strongly A-stable and L-stable DIRKN methods of orderp withs * (p) sequential, singly diagonal-implicit stages wheres *(p)=[(p+1)/2] ors * (p)=[(p+1)/2]+1,[°] denoting the integer part function.These investigations were supported by the University of Amsterdam with a research grant to enable the author to spend a total of two years in Amsterdam.  相似文献   

12.
In this article, we consider the finite element methods (FEM) for Grwünwald–Letnikov time-fractional diffusion equation, which is obtained from the standard two-dimensional diffusion equation by replacing the first-order time derivative with a fractional derivative (of order α, with 0?h r+1?+?τ2-α), where h, τ and r are the space step size, time step size and polynomial degree, respectively. A numerical example is presented to verify the order of convergence.  相似文献   

13.
In [2] and [3] we described the double coset decomposition for the modular group SLr+s (Z) with respect to the congruence subgroup Р r,s (m) for any positive integer m. In the present paper we obtain the double coset decomposition of SLr+s (R) with respect to Р r,s (I). Where R is a commutative ring with unioty 1, and I is a nonzero ideal in R such that R/I is the direct sum of local principal ideal rings; thus generalize the results obtained in [2] and [3].  相似文献   

14.
In order to obtain the numerical solution for a one-dimensional parabolic system, an unconditionally stable difference method is investigated in [1]. If the number of unknown functions is M, for each time step only M times of calculation are needed. The rate of convergence is $O(\tau+h^2)$. On the basis of [1], an alternating calculation difference scheme is presented in [2]; the rate of the convergence is $O(\tau^2+h^2)$. The difference schemes in [1] and [2] are economic ones. For the $\alpha$-$th$ equation, only $U_{\alpha}$ is an unknown function; the others $U_{\beta}$ are given evaluated either in the last step or in the present step. So the practical calculation is quite convenient. The purpose of this paper is to derive a trilayer difference scheme for one-dimensional parabolic systems. It is known that the scheme is also unconditionally stable and the rate of convergence is $O(\tau^2+h^2)$.  相似文献   

15.
Summary We introduce in this article a new domain decomposition algorithm for parabolic problems that combines Mortar Mixed Finite Element methods for the space discretization with operator splitting schemes for the time discretization. The main advantage of this method is to be fully parallel. The algorithm is proven to be unconditionally stable and a convergence result in (Δt/h 1/2) is presented.  相似文献   

16.
Denote by sn the nth order Fourier polynomial of the odd function f of period 2π equal to 1 on ]0, π[. The Gibbs phenomenon is caused by the well-known fact that [formula] An analogous Gibbs phenomenon is caused by a similar limiting behaviour of s*n, the nth order trigonometric polynomial interpolating f at jπ/n (1 ≤ j ≤ 2n).  相似文献   

17.
The major drawback of the s-step iterative methods for nonsymmetric linear systems of equations is that, in the floating-point arithmetic, a quick loss of orthogonality of s-dimensional direction subspaces can occur, and consequently slow convergence and instability in the algorithm may be observed as s gets larger than 5. In [18], Swanson and Chronopoulos have demonstrated that the value of s in the s-step Orthomin(k) algorithm can be increased beyond s=5 by orthogonalizing the s direction vectors in each iteration, and have shown that the ATA-orthogonal s-step Orthomin(k) is stable for large values of s (up to s=16). The subject of this paper is to show how by using the CADNA library, it is possible to determine a good value of s for ATA-orthogonal s-step Orthomin(k), and during the run of its code to detect the numerical instabilities and to stop the process correctly, and to restart the ATA-orthogonal s-step Orthomin(k) in order to improve the computed solution. Numerical examples are used to show the good numerical properties. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献   

18.
Using the main result of Madsen and Weiss [MW], we compute the mod 2 homology of spin mapping class groups in the stable range. In earlier work [G] we computed the stable mod p homology of the oriented mapping class group, and the methods and results here are very similar. The forgetful map from the spin mapping class group to the oriented mapping class groups induces a homology isomorphism for odd p but for p=2 it is far from being an isomorphism. We include a general discussion of tangential structures on 2-manifolds and their mapping class groups and then specialise to spin structures.  相似文献   

19.
It is proved unconditionally that every sufficiently large positive integer satisfying some necessary congruence conditions can be represented as the sum of s almost equal k-th powers of prime numbers for 2 ≤ k ≤ 10 and s =2k + 1, which gives a short interval version of Hun's theorem.  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号