๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Two-constraint domain decomposition with Space Filling Curves

โœ Scribed by Christian Konrad

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
736 KB
Volume
37
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Convergence with Hilbert's space filling
Convergence with Hilbert's space filling curve
โœ Arthur R. Butz ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 695 KB

The subject of this paper is a means of converging to a set of numbers in certain mathematical programming problems where a conventional programming method is not possible. The space filling curve is shown to provide a tool for doing this. An algorithm for generating such a curve is presented; the r

Solution of contact problems by FETI dom
Solution of contact problems by FETI domain decomposition with natural coarse space projections
โœ Z. Dostรกl; Francisco A.M. Gomes Neto; Sandra A. Santos ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 410 KB

An ecient non-overlapping domain decomposition algorithm of the NeumannยฑNeumann type for solving both coercive and semicoercive contact problems is presented. The discretized problem is ยฎrst turned by the duality theory of convex programming to the quadratic programming problem with bound and equali