𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Non-Monotone Space Decomposition Methods for Minimization Problems

✍ Scribed by S. Keesmann; W. Mönch

Publisher
John Wiley and Sons
Year
2002
Weight
110 KB
Volume
1
Category
Article
ISSN
1617-7061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A space decomposition method for parabol
A space decomposition method for parabolic equations
✍ Xue-Cheng Tai 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 2 views

A convergence proof is given for an abstract parabolic equation using general space decomposition techniques. The space decomposition technique may be a domain decomposition method, a multilevel method, or a multigrid method. It is shown that if the Euler or Crank-Nicolson scheme is used for the par

Domain decomposition for a non-smooth co
Domain decomposition for a non-smooth convex minimization problem and its application to plasticity
✍ Carsten Carstensen 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

Lions's work on the Schwarz alternating method for convex minimization problems is generalized to a certain non-smooth situation where the non-differentiable part of the functionals is additive and independent with respect to the decomposition. Such functionals arise naturally in plasticity where th

Space-Time Domain Decomposition Methods
Space-Time Domain Decomposition Methods for Scalar Conservation Law
✍ Agouzal, A. ;Debit, N. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

A new space±time domain decomposition method (STDDM) is presented. The space±time domain is partitioned in subdomains, and dierent discretizations are used in each space±time subdomain. Timeintegration in space±time variational methods is derived in a dierent manner from what has been presented so f

State space partitioning methods for sto
State space partitioning methods for stochastic shortest path problems
✍ Alexopoulos, Christos 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

This paper describes methods for computing measures related to shortest paths in networks with discrete random arc lengths. These measures include the probability that there exists a path with length not exceeding a specified value and the probability that a given path is shortest. The proposed meth

Domain decomposition methods for paralle
Domain decomposition methods for parallel solution of shape sensitivity analysis problems
✍ Manolis Papadrakakis; Yiannis Tsompanakis 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 376 KB 👁 2 views

This paper presents the implementation of advanced domain decomposition techniques for parallel solution of large-scale shape sensitivity analysis problems. The methods presented in this study are based on the FETI method proposed by Farhat and Roux which is a dual domain decomposition implementatio