Continuation methods for closed, weakly closed, DKT, and WDKT maps

R. P. Agarwal; Donald O'Regan

doi:10.13025/24206

Continuation methods for closed, weakly closed, DKT, and WDKT maps

R. P. Agarwal
, Donald O'Regan

Mathematics

National University of Singapore

Research output: Contribution to a Journal (Peer & Non Peer) › Article › peer-review

4 Citations (Scopus)

Abstract

A simple approach is presented to establish that if F is essential and F ≅ G, then G is essential. We discuss (i) the case when the multivalued map has closed (or weakly closed) graph, and (ii) the case when the set valued map has continuous (or weakly continuous) selections.

Original language	English
Pages (from-to)	81-88
Number of pages	8
Journal	Computers and Mathematics with Applications
Volume	38
Issue number	7
DOIs	https://doi.org/10.13025/24206 https://doi.org/10.1016/s0898-1221(99)00240-0
Publication status	Published - Oct 1999

Keywords

Externally hosted open access publications with University of Galway authors

Access to Document

10.13025/24206Licence: CC BY
10.1016/s0898-1221(99)00240-0

Cite this

@article{f009a81cb1af4d14a3b74dc149fe9a68,

title = "Continuation methods for closed, weakly closed, DKT, and WDKT maps",

abstract = "A simple approach is presented to establish that if F is essential and F ≅ G, then G is essential. We discuss (i) the case when the multivalued map has closed (or weakly closed) graph, and (ii) the case when the set valued map has continuous (or weakly continuous) selections.",

keywords = "Externally hosted open access publications with University of Galway authors",

author = "Agarwal, \{R. P.\} and Donald O'Regan",

year = "1999",

month = oct,

doi = "10.13025/24206",

language = "English",

volume = "38",

pages = "81--88",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Ltd",

number = "7",

}

TY - JOUR

T1 - Continuation methods for closed, weakly closed, DKT, and WDKT maps

AU - Agarwal, R. P.

AU - O'Regan, Donald

PY - 1999/10

Y1 - 1999/10

N2 - A simple approach is presented to establish that if F is essential and F ≅ G, then G is essential. We discuss (i) the case when the multivalued map has closed (or weakly closed) graph, and (ii) the case when the set valued map has continuous (or weakly continuous) selections.

AB - A simple approach is presented to establish that if F is essential and F ≅ G, then G is essential. We discuss (i) the case when the multivalued map has closed (or weakly closed) graph, and (ii) the case when the set valued map has continuous (or weakly continuous) selections.

KW - Externally hosted open access publications with University of Galway authors

UR - http://hdl.handle.net/10379/8764

UR - https://www.scopus.com/pages/publications/0033204361

U2 - 10.13025/24206

DO - 10.13025/24206

M3 - Article

SN - 0898-1221

VL - 38

SP - 81

EP - 88

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 7

ER -

Continuation methods for closed, weakly closed, DKT, and WDKT maps

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this