ebooks logo journals logo reference works logo abstract databases logo
bullet  SIGN IN Register | Why Register? | Got a Voucher? alerts   marked lists   shopping cart 

informaworld

HOME   |   SEARCH   |   BROWSE
    Issues List       Latest Issue       Forthcoming Articles       Volume 14 Issue 9       Subscribe       Article       References       Related articles      
<< firstfirst   < prevprev   Table of contentstoc   next >next   last >>last
Publisher Logo Publication Cover
Search within this journal

Zeros of semilinear systems with applications to nonlinear partial difference equations on graphs  

Author: Rubeacuten A. Hidalgo a
Affiliation:   a Departamento de Matemaacuteticas, Universidad Teacutecnica Federico Santa Mariacutea, Valparaiacuteso, Chile
DOI: 10.1080/10236190701883302
Publication Frequency: 12 issues per year
Published in: journal Journal of Difference Equations and Applications, Volume 14, Issue 9 September 2008 , pages 953 - 969
First Published: September 2008
Formats available: HTML (English) : PDF (English)
Article Requests: Order Reprints : Request Permissions


Abstract

Let Q be a m times m real matrix and fj : Ropf → Ropf, j = 1, …, m, be some given functions. If x and f(x) are column vectors whose j-coordinates are xj and fj(xj), respectively, then we apply the finite dimensional version of the mountain pass theorem to provide conditions for the existence of solutions of the semilinear system Qx = f(x) for Q symmetric and positive semi-definite. The arguments we use are a simple adaptation of the ones used by Neuberger. An application of the above concerns partial difference equations on a finite, connected simple graph. A derivation of a graph G is just any linear operator D:C0(G) → C0(G), where C0(G) is the real vector space of real maps defined on the vertex set V of the graph. Given a derivation D and a function F:V times Ropf → Ropf, one has associated a partial difference equation  = F(v,μ), and one searches for solutions μ ∈ C0(G). Sufficient conditions in order to have non-trivial solutions of partial difference equations on any finite, connected simple graph for D symmetric and positive semi-definite derivation are provided. A metric (or weighted) graph is a pair (G, d), where G is a connected finite degree simple graph and d is a positive function on the set of edges of the graph. The metric d permits to consider some classical derivations, such as the Laplacian operator ▵2. In (Neuberger, Elliptic partial difference equations on graphs, Experiment. Math. 15 (2006), pp. 91-107) was considered the nonlinear elliptic partial difference equations ▵2u = F(u), for the metric d = 1.
Partially supported by projects Fondecyt 1070271 and UTFSM 12.05.21.
Keywords: 05C12; 39A12; 35J05
view references (13)
Bookmark with:
  • CiteULike
  • Del.icio.us
  • BibSonomy
  • Connotea
  • More bookmarks
Privacy Policy | Terms & Conditions | Accessibility | RSS
FAQs in: English . Français . Español . 中文(简体和繁體)
© 2009 Informa plc