Premium
AN ADAPTIVE SUCCESSIVE OVER RELAXATION DOMAIN DECOMPOSITION BY THE BOUNDARY SPECTRAL STRIP METHOD
Author(s) -
AVRASHI JACOB,
MICHAEL OFER,
ROSENHOUSE GIORA
Publication year - 1997
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/(sici)1097-0207(19970430)40:8<1383::aid-nme54>3.0.co;2-c
Subject(s) - domain decomposition methods , relaxation (psychology) , domain (mathematical analysis) , convergence (economics) , boundary (topology) , mathematics , scheme (mathematics) , interface (matter) , iterative method , boundary value problem , algorithm , decomposition , mathematical optimization , computer science , mathematical analysis , finite element method , structural engineering , engineering , parallel computing , psychology , social psychology , ecology , bubble , maximum bubble pressure method , economics , biology , economic growth
In the present paper a new adaptive successive over relaxation domain decomposition technique is developed for the boundary spectral strip method. The proposed scheme is based on dividing the overall domain of the problem into several subdomains. First each of the subdomains in the BIEM matrices is analysed independently. These matrices together with an arbitrary initial guess of displacements on the interface of each two neighbouring subdomains, enable an iterative and a very efficient solution of the whole problem. An adaptive procedure, based on comparing two norms along the interface of subregions, is carried out to impose successive over relaxation convergence. Numerical results comparing the present scheme with single domain solutions emphasize the capability of the proposed technique regarding accuracy and computational efforts. © 1997 by John Wiley & Sons, Ltd.