A Note on Coercivity of Lower Semicontinuous Functions and Nonsmooth Critical Point Theory

The first motivation for this note is to obtain a general version of the following result: let E be a Banach space and f : E → R be a differentiable function, bounded below and satisfying the Palais-Smale condition; then, f is coercive, i.e., f(x) goes to infinity as ||x|| goes to infinity. In recent years, many variants and extensions of this result appeared, see [3], [5], [6], [9], [14], [18], [19] and the references therein. A general result of this type was given in [3, Theorem 5.1] for a lower semicontinuous function defined on a Banach space, through an approach based on an abstract notion of subdifferential operator, and taking into account the “smoothness” of the Banach space. Here, we give (Theorem 1) an extension in a metric setting, based on the notion of slope from [11] and coercivity is considered in a generalized sense, inspired by [9]; our result allows to recover, for example, the coercivity result of [19], where a weakened version of the Palais-Smale condition is used. Our main tool (Proposition 1) is a consequence of Ekeland’s variational principle extending [12, Corollary 3.4], and deals with a function f which is, in some sense, the “uniform” Γ-limit of a sequence of functions.

Perturbations of Critical Values in Nonsmooth Critical Point Theory

* Supported by Ministero dell’Università e della Ricerca Scientifica e Tecnologica (40% – 1993). ** Supported by Ministero dell’Università e della Ricerca Scientifica e Tecnologica (40% – 1993).

Nontrivial Solutions of Quasilinear Equations In BV

The existence of a nontrivial critical point is proved for a functional containing an area-type term. Techniques of nonsmooth critical point theory are applied.

On the Hyperbolicity Domain of the Polynomial x^n + a1x^(n-1) + 1/4+ an

∗ Partially supported by INTAS grant 97-1644

On The Critical Points of some Iteration Methods for Solving Algebraic Equations. Global Convergence Properties

In this work we give su±cient conditions for k-th approximations of the polynomial roots of f(x) when the Maehly{Aberth{Ehrlich, Werner-Borsch-Supan, Tanabe, Improved Borsch-Supan iteration methods fail on the next step. For these methods all non-attractive sets are found. This is a subsequent improvement of previously developed techniques and known facts. The users of these methods can use the results presented here for software implementation in Distributed Applications and Simulation Environ- ments. Numerical examples with graphics are shown.

On the Critical Points of Kyurkchiev’s Method for Solving Algebraic Equations

This paper is dedicated to Prof. Nikolay Kyurkchiev on the occasion of his 70th anniversary This paper gives sufficient conditions for kth approximations of the zeros of polynomial f (x) under which Kyurkchiev’s method fails on the next step. The research is linked with an attack on the global convergence hypothesis of this commonly used in practice method (as correlate hypothesis for Weierstrass–Dochev’s method). Graphical examples are presented.