The Use of Cerami Sequences in Critical Point Theory
Author(s) -
Martin Schechter
Publication year - 2007
Publication title -
abstract and applied analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.228
H-Index - 56
eISSN - 1687-0409
pISSN - 1085-3375
DOI - 10.1155/2007/58948
Subject(s) - algorithm , computer science , artificial intelligence
The concept of linking was developed to produce Palais-Smale (PS) sequences G(uk)→a, G'(uk)→0 for C1functionals G that separate linking sets. These sequences produce critical points ifthey have convergent subsequences (i.e., if G satisfies the PS condition). In the past, we have shown that PS sequences can be obtained even when linking does not exist. We now show that such situations produce more useful sequences. They not only produce PS sequences, but also Cerami sequences satisfying G(uk)→a, (1+||uk||)G'(uk)→ 0 as well. A Cerami sequence can produce a critical point even when a PS sequence does not. In this situation, it is no longer necessary to show thatG satisfies the PS condition, but only that it satisfies the easier Cerami condition (i.e., that Cerami sequences have convergent subsequences). We provide examples and applications. We also give generalizations to situations when the separating criterion is violated
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom