Revision as of 17:04, 7 July 2006 edit Loisel (talk \| contribs) Extended confirmed users 1,558 edits →Domain decomposition algorithm: someone screwed up the sizes. ← Previous edit		Revision as of 09:18, 25 September 2006 edit undo Bluebot (talk \| contribs) 349,597 edits Unicodifying Next edit →
Line 68: The boundary condition is boundedness at infinity. We decompose the ___domain '''R'''<sup>2</sup> into two overlapping subdomains H<sub>1</sub> = (<nowiki>− ~~∞~~∞,1]</nowiki> × '''R''' and H<sub>2</sub> = <nowiki>[0,+ ~~∞~~∞</nowiki>) × '''R'''. In each subdomain, we will be solving a BVP of the form: :''u''<sup>( ''j'' )</sup><sub>''xx''</sub> + ''u''<sup>( ''j'' )</sup><sub>''yy''</sub> = ''f'' in H<sub>''j''</sub>

Additive Schwarz method: Difference between revisions