comparison domain decomposition methods di sousedik bedrich (4 risultati)

Taschenbuch. Condizione: Neu. Neuware -A progressive research in domain decomposition in the last several decades has been motivated by inceasing availability of multicore, parallel computers. In this contribution we focus on an iterative substructuring class of the domain decomposition methods. Some of the most popular methods are formulated under so-called minimalist assumptions. This allows for their effective comparison, which reveales that some of the methods are equivalent or even the same. Finally, the theory is used to develop an adaptive method that significantly improves convergence of two most advanced methods, BDDC and FETI-DP.Books on Demand GmbH, Überseering 33, 22297 Hamburg 76 pp. Englisch.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A progressive research in domain decomposition in the last several decades has been motivated by inceasing availability of multicore, parallel computers. In this contribution we focus on an iterative substructuring class of the domain decomposition methods. Some of the most popular methods are formulated under so-called minimalist assumptions. This allows for their effective comparison, which reveales that some of the methods are equivalent or even the same. Finally, the theory is used to develop an adaptive method that significantly improves convergence of two most advanced methods, BDDC and FETI-DP. 76 pp. Englisch.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A progressive research in domain decomposition in the last several decades has been motivated by inceasing availability of multicore, parallel computers. In this contribution we focus on an iterative substructuring class of the domain decomposition methods.

Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - A progressive research in domain decomposition in the last several decades has been motivated by inceasing availability of multicore, parallel computers. In this contribution we focus on an iterative substructuring class of the domain decomposition methods. Some of the most popular methods are formulated under so-called minimalist assumptions. This allows for their effective comparison, which reveales that some of the methods are equivalent or even the same. Finally, the theory is used to develop an adaptive method that significantly improves convergence of two most advanced methods, BDDC and FETI-DP.