N. S. Bakhvalov. On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comput. Math. Phys., 6(101--135), 1966. 75  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Ewald method for N N , due to the fact of better scaling. In [70] the computational efficiency and accuracy with 2 dimensional periodic boundary conditions for 3 dimensional systems are discussed. 3. 4 Multi grid Multi grid (MG) was introduced in the 1960s by Fedorenko [35] and Bakhvalov [5] to solve partial differential equations. It got full attention in the 1980s, but only recently it has been applied and implemented for N body problems [13, 107] MG scales as O(N) MG imposes a hierarchical separation of spatial scales. The pair wise interactions are split into a local and a ....

N. S. Bakhvalov. On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comput. Math. Phys., 6(101-- 135), 1966.

....convergence and, thus reducing the computing time. 301 0021 9991 98 25.00 Copyright c # 1998 by Academic Press All rights of reproduction in any form reserved. 302 DRIKAKIS, ILIEV, AND VASSILEVA The origin of the multigrid method is found in the papers of Fedorenko [1] and Bakhvalov [2], and later on in the work of Brandt [3] To make reference to all past works in connection with multigrid methods would be a task for the introduction of a book (e.g. 4, 5] rather than of the present paper. However, it is worth mentioning that most of the developments and applications of ....

N. S. Bakhvalov, On the convergence of a relaxation method with natural constraints on the elliptic operator, USSR Comput. Math. Phys. 6, 101 (1966).

....will allow, it is critical that the convergence rate of the method should be insensitive to the number of unknowns. The general solution strategy that appears most promising in this regard is multigrid, for which grid independent convergence rates have been proven for elliptic operators [1, 2, 3, 4, 5]. Although no rigorous extension of this theory has emerged for problems involving a hyperbolic component, methods based on multigrid have proven highly effective for inviscid calculations with the Euler equations [6, 7, 8] and remain the most attractive approach for Navier Stokes calculations ....

N.S. Bakhvalov. On the convergence of a relaxation method with natural constraints of the elliptic operator. Zh. Vychisl. Mat. Mat. Fiz., 6(5):861--885, 1966. (USSR Comput. Math. Math. Phys., 6:101135, 1966).

....extensions and present some examples of classes of spaces to which the method can be successfully applied. Our two level scheme can be generalized to a k level scheme for k 2. However, the rate of convergence which our analysis would predict depends on N if k does. We, as well as several others [2, 4, 12, 14], have obtained for various k level schemes convergence results comparable to our two level scheme. These multi level schemes are relatively complicated, and the requirements of the elliptic equation and the space M are more severe; e.g. the requirement that all the meshes are quasi uniform. When ....

....of this argument will work for any fixed number of levels, one would like the number of levels to depend on N . In this case the above analysis will fail to show that the rate of convergence is bounded less than one independent of h. However, such results have been obtained for multilevel schemes [2, 4, 5, 12, 14]. To do so, the concept of simple block iteration has been abandoned in favor of recursively defined algorithms. Furthermore, all presently known proofs explicitly or implicitly require some elliptic regularity, that the meshes T h j all be quasi uniform, 9 and that the spaces M h j satisfy ....

N. S. Bahkvalov, On the convergence of a relaxation method with natural constraints on the elliptic operator, Zh. Vychisl. Mat. mat. Fiz., 6 (1966), pp. 861--885.

....constraints will allow, it is critical that the convergence rate of the method should be insensitive to the problem size. The general solution strategy that appears most promising in this regard is multigrid, for which grid independent convergence rates have been proven for elliptic operators [1, 2, 3, 4]. Although no rigorous extension of this theory has emerged for problems involving a hyper1 bolic component, methods based on multigrid have proven highly effective for inviscid calculations with the Euler equations [5, 6, 7] and remain the most attractive approach for Navier Stokes calculations ....

N.S. Bakhvalov. On the convergence of a relaxation method with natural constraints of the elliptic operator. Zh. vych. mat., 6(5):861--885, 1966. (USSR Comp. Math. and Math. Phys., 6:101-135, 1966).

....a database of an extensive collection of multigrid papers in the literature. The germ of the idea of multigrid can be found in the works of Southwell [92] and Wachpress [100] The modern idea was introduced and analyzed by Brakhage [15] and Fedorenko [49, 50] in the 1960 s, followed by Bachvalov [5]. Multigrid methods have not been paid much attention in the 1970 s until the works of Astrachancer [2] Bank and Dupont [6] Brandt [19] Hackbusch [57] Nicolaides [83] and others showed that multigrid is indeed a very useful technique practically and theoretically. An enormous amount of ....

N. S. Bachvalov. On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comput. Math. and Phys., 6:101--135, 1966.

....begin of the history of multigrid methods . A two grid method and later a multi grid method [70] was proposed and analyzed, namely a W cycle with pre and post smoothing using damped Jacobi iterations for the Poisson problem on the unit square. A variable coefficient problem was analyzed by [7], structured triangle grids were considered in [2] and the multigrid method was further developed to general grids in [121] The interest in multigrid methods was mainly theoretical at that time and was focused on the optimal complexity of the algorithms. Real applications were first considered by ....

N. S. Bachvalov, On the convergence of a relaxation method with natural constraints on the elliptic operator, Sov. J. Comput. Math. Math. Phys., 6 (1966), pp. 861--883.

No context found.

N. S. Bakhvalov. On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comput. Math. Phys., 6(101--135), 1966. 75

No context found.

N. S. Bachvalov. On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comput. Math. and Phys., 6:101--135, 1966.

No context found.

Bakhvalov, N. S.: On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Computational Math. and Math. Phys. 6 (1996) 101-- 135

No context found.

N. S. Bakhvalov, On the convergence of a relaxation method with natural constraints on the elliptic operator, USSR Comput. Math. and Math. Phys., 6 (1966), pp. 861--885.

No context found.

N. S. Bachvalov. On the convergence of a relaxation method with natural constraints on the elliptic operator. USSR Comput. Math. and Math. Phys., 6,5:101-- 135, 1966.

No context found.

N. S. Bakhvalov, On the convergence of a relaxation method with natural constraints on the elliptic operator, USSR Comput. Math. Phys. 6, 101 (1966).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC