✦ LIBER ✦

Maximal monotonicity of operators with sufficiently large domain and application to the Hartree problem

✍ Scribed by Jürgen Weyer

Publisher: Springer
Year: 1982
Tongue: English
Weight: 458 KB
Volume: 38
Category: Article
ISSN: 0025-2611
DOI: 10.1007/bf01168589

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The sum of a maximal monotone operator o

The sum of a maximal monotone operator of type (FPV) and a maximal monotone operator with full domain is maximal monotone

✍ Liangjin Yao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Inverse monotonicity of monotone L-Opera

Inverse monotonicity of monotone L-Operators with applications to quasilinear and free boundary value problems

✍ Klaus Glashoff; Bodo Werner 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 745 KB

The Maximality of the Sum of Monotone Op

The Maximality of the Sum of Monotone Operators in Banach Space and an Application to Hemivariational Inequalities

✍ A. Taa 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 121 KB

In this paper we give some conditions under which T q Ѩ f is maximal monotone Ž . in the Banach space X not necessarily reflexive , where T is a monotone operator from X into X \* and Ѩ f is the subdifferential of a proper lower semicontinuous Ä 4 convex function f, from X into ‫ޒ‬ j qϱ . We also gi

Zeros and growth of entire functions of

Zeros and growth of entire functions of order 1 and maximal type with an application to the random signs problem

✍ Carl D. Offner 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 French ⚖ 869 KB

On the Behaviour of the Spectrum of Para

On the Behaviour of the Spectrum of Parameter-Depending Operators under Small Variation of the Domain and an Application to Operator Pencils Generated by Elliptic Boundary Value Problems in a Cone

✍ V. A. Koslov; J. Rossmann 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB 👁 1 views

The FETI family of domain decomposition

The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces

✍ Philip Avery; Charbel Farhat 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-li