Download e-book for iPad: A Black-Box Multigrid Preconditioner for the Biharmonic by Silvester D. J., Mihajlovic M. D.

By Silvester D. J., Mihajlovic M. D.

We research the convergence features of a preconditioned Krylov subspace solver utilized to the linear structures coming up from low-order combined finite point approximation of the biharmonic challenge. the main characteristic of our method is that the preconditioning could be discovered utilizing any "black-box" multigrid solver designed for the discrete Dirichlet Laplacian operator. This ends up in preconditioned structures having an eigenvalue distribution inclusive of a tightly clustered set including a small variety of outliers. Numerical effects exhibit that the functionality of the technique is aggressive with that of specialised speedy new release equipment which were built within the context of biharmonic difficulties.

Show description

Read or Download A Black-Box Multigrid Preconditioner for the Biharmonic Equation PDF

Similar mathematics books

Additional info for A Black-Box Multigrid Preconditioner for the Biharmonic Equation

Sample text

It is common to have such a specification language, and a separate programming language. One might then take a specification, and construct a program from it. The central idea of this chapter is to reason about programs using a language of relations. A function is indeed a relation, and moreover relations satisfy “logical” rules such as conjunction and disjunction. In this chapter, a language and theory of relations is developed which is particularly suitable for specifying programs. The specifications can then be refined, using either calculational techniques or formal theorems, to yield functional programs.

Frequently used properties of maps are contained in the next Mini-exercise. 34 Hilary A. Priestley Mini-exercise (i) Any order-embedding is clearly monotone. Show that it is also one-toone (you will need (po2), antisymmetry of , in P ). Show that not every one-to-one monotone map is an order-embedding (get an example using 2-element posets). (ii) Let F : P → Q and G : Q → R be maps between posets P, Q, R. Show that if F and G are monotone (order-embeddings, order-isomorphisms) then so is the composite G ◦ F : P → R.

Given any poset P (with /P or without ⊥), we form P⊥ (called P ‘lifted’) as follows. Take an element ⊥ ∈ and define on P⊥ := P ∪ {⊥} by x y if and only if x = ⊥ or x y in P. For example, take the natural numbers IN with the antichain order, =. Then IN⊥ is as shown in Figure 7. P⊥ is just {⊥} ⊕ P . A poset of the form S⊥ , where S is an antichain, is called flat. 7 New Posets from Old: Sums and Products Antichains and chains, and the lifting construction, are examples of constructing new posets from existing ones by forming suitable order-theoretic sums.

Download PDF sample

A Black-Box Multigrid Preconditioner for the Biharmonic Equation by Silvester D. J., Mihajlovic M. D.

by Michael

Rated 4.98 of 5 – based on 27 votes