首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Parallel algorithms and domain decomposition techniques for solving three-dimensional boundary value problems on quasi-structured grids
Authors:V D Korneev  V M Sveshnikov
Institution:1.Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch,Russian Academy of Sciences,Novosibirsk,Russia;2.Novosibirsk State University,Novosibirsk,Russia
Abstract:A new approach to the decomposition of a three-dimensional computational domain into subdomains matched without overlapping is proposed. It is based on direct approximation of the Poincare–Steklov equation at the interface. Parallel algorithms and techniques for solving threedimensional boundary value problems on quasi-structured grids are presented. Experimental evaluation of parallel efficiency is done by solving a model problem with quasi-structured parallelepipedal matching and non-matching grids as an example.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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