Spelling suggestions: "subject:"MSC 65555"" "subject:"MSC 65655""
1 
Efficient time step parallelization of full multigrid techniquesWeickert, J., Steidten, T. 30 October 1998 (has links) (PDF)
This paper deals with parallelization methods for timedependent
problems where the time steps are shared out among the
processors. A Full Multigrid technique serves as solution
algorithm, hence information of the preceding time step and of
the coarser grid is necessary to compute the solution at each new
grid level. Applying the usual extrapolation formula to process
this information, the parallelization will not be very efficient.
We developed another extrapolation technique which causes a much
higher parallelization effect. Test examples show that no
essential loss of exactness appears, such that the method
presented here shall be wellapplicable.

2 
On the preconditioning in the domain decomposition technique for the pversion finite element method. Part IIvanov, S. A., Korneev, V. G. 30 October 1998 (has links) (PDF)
Abstract Pversion finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary re sults for 1D case, condition number estimates and some inequalities for 2D reference element.

3 
Domain Decomposition and Multilevel Techniques for Preconditioning OperatorsNepomnyaschikh, S. V. 30 October 1998 (has links) (PDF)
Introduction In recent years, domain decomposition methods have been used extensively to efficiently solve boundary value problems for partial differential equations in complex{form domains. On the other hand, multilevel techniques on hierarchical data structures also have developed into an effective tool for the construction and analysis of fast solvers. But direct realization of multilevel techniques on a parallel computer system for the global problem in the original domain involves difficult communication problems. I this paper, we present and analyze a combination of these two approaches: domain decomposition and multilevel decomposition on hierarchical structures to design optimal preconditioning operators.

4 
On the preconditioning in the domain decomposition technique for the pversion finite element method. Part IIIvanov, S. A., Korneev, V. G. 30 October 1998 (has links) (PDF)
Pversion finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary results for 1D case, condition number estimates and some inequalities for 2D reference element. Part II is devoted to the derivation of the Schur complement preconditioner and conditionality number estimates for the pversion finite element matrixes. Also DD preconditioning is considered.

5 
Efficient time step parallelization of full multigrid techniquesWeickert, J., Steidten, T. 30 October 1998 (has links)
This paper deals with parallelization methods for timedependent
problems where the time steps are shared out among the
processors. A Full Multigrid technique serves as solution
algorithm, hence information of the preceding time step and of
the coarser grid is necessary to compute the solution at each new
grid level. Applying the usual extrapolation formula to process
this information, the parallelization will not be very efficient.
We developed another extrapolation technique which causes a much
higher parallelization effect. Test examples show that no
essential loss of exactness appears, such that the method
presented here shall be wellapplicable.

6 
Parallelization of multigrid methods based on domain decomposition ideasJung, M. 30 October 1998 (has links) (PDF)
In the paper, the parallelization of multigrid methods for solving secondorder elliptic boundary value problems in twodimensional domains is discussed. The parallelization strategy is based on a nonoverlapping domain decomposition data structure such that the algorithm is wellsuited for an implementation on a parallel machine with MIMD architecture. For getting an algorithm with a good paral lel performance it is necessary to have as few communication as possible between the processors. In our implementation, communication is only needed within the smoothing procedures and the coarsegrid solver. The interpolation and restriction procedures can be performed without any communication. New variants of smoothers of GaussSeidel type having the same communication cost as Jacobi smoothers are presented. For solving the coarsegrid systems iterative methods are proposed that are applied to the corresponding Schur complement system. Three numerical examples, namely a Poisson equation, a magnetic field problem, and a plane linear elasticity problem, demonstrate the efficiency of the parallel multi grid algorithm.

7 
Domain Decomposition and Multilevel Techniques for Preconditioning OperatorsNepomnyaschikh, S. V. 30 October 1998 (has links)
Introduction In recent years, domain decomposition methods have been used extensively to efficiently solve boundary value problems for partial differential equations in complex{form domains. On the other hand, multilevel techniques on hierarchical data structures also have developed into an effective tool for the construction and analysis of fast solvers. But direct realization of multilevel techniques on a parallel computer system for the global problem in the original domain involves difficult communication problems. I this paper, we present and analyze a combination of these two approaches: domain decomposition and multilevel decomposition on hierarchical structures to design optimal preconditioning operators.

8 
On the preconditioning in the domain decomposition technique for the pversion finite element method. Part IIvanov, S. A., Korneev, V. G. 30 October 1998 (has links)
Abstract Pversion finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary re sults for 1D case, condition number estimates and some inequalities for 2D reference element.

9 
On the preconditioning in the domain decomposition technique for the pversion finite element method. Part IIIvanov, S. A., Korneev, V. G. 30 October 1998 (has links)
Pversion finite element method for the second order elliptic equation in an arbitrary sufficiently smooth domain is studied in the frame of DD method. Two types square reference elements are used with the products of the integrated Legendre's polynomials for the coordinate functions. There are considered the estimates for the condition numbers, preconditioning of the problems arising on subdomains and the Schur complement, the derivation of the DD preconditioner. For the result we obtain the DD preconditioner to which corresponds the generalized condition number of order (logp )2 . The paper consists of two parts. In part I there are given some preliminary results for 1D case, condition number estimates and some inequalities for 2D reference element. Part II is devoted to the derivation of the Schur complement preconditioner and conditionality number estimates for the pversion finite element matrixes. Also DD preconditioning is considered.

10 
Implicit extrapolation methods for multilevel finite element computationsJung, M., Rüde, U. 30 October 1998 (has links) (PDF)
Extrapolation methods for the solution of partial differential equations are commonly based on the existence of error expansions for the approximate solution. Implicit extrapolation, in the contrast, is based on applying extrapolation indirectly, by using it on quantities like the residual. In the context of multigrid methods, a special technique of this type is known as \034 extrapolation. For finite element systems this algorithm can be shown to be equivalent to higher order finite elements. The analysis is local and does not use global expansions, so that the implicit extrapolation technique may be used on unstructured meshes and in cases where the solution fails to be globally smooth. Furthermore, the natural multilevel structure can be used to construct efficient multigrid and multilevel preconditioning techniques. The effectivity of the method is demonstrated for heat conduction problems and problems from elasticity theory.

Page generated in 0.0393 seconds