Robust Multi Grid Methods Proceedings (8 results)
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 71.79
US$ 16.11 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 67.54
US$ 20.84 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
- Softcover
Seller: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 85.25
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 70.98
US$ 20.18 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
Language: German
Published by Vieweg+Teubner Verlag, Vieweg+Teubner Verlag 1989
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 65.98
US$ 72.50 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - In full multigrid methods for elliptic difference equations one works on a sequence of meshes where a number of pre- and/or postsmoothing steps are performed on each level. As is well known these methods can converge very fast on problems with a sm…ooth solution and a regular mesh, but the rate of convergence can be severely degraded for problems with unisotropy or discontinuous coefficients unless some form of robust smoother is used. Also problems can arise with the increasingly coarser meshes because for some types of discretization methods, coercivity may be lost on coarse meshes and on massively parallel computers the computation cost of transporting information between computer processors devoted to work on various levels of the mesh can dominate the whole computing time. For discussions about some of these problems, see (11). Here we propose a method that uses only two levels of meshes, the fine and the coarse level, respec tively, and where the corrector on the coarse level is equal to a new type of preconditioner which uses an algebraic substructuring of the stiffness matrix. It is based on the block matrix tridiagonal structure one gets when the domain is subdivided into strips. This block-tridiagonal form is used to compute an approximate factorization whereby the Schur complements which arise in the recursive factorization are approximated in an indirect way, i. e.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 133.00
US$ 20.18 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Mispah books, Redhill, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
US$ 121.92
US$ 33.63 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Perfect Paperback. Condition: Like New. Like New. book.
- Softcover
Seller: GreatBookPrices, Columbia, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 152.90
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
