Multiple solutions for higher-order difference equations (Q1963020): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4033029 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4387609 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4230136 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A discrete boundary value problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Double positive solutions of \((n,p)\) boundary value problems for higher order difference equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalization of concavity for finite differences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extension of continuous and discrete inequalities due to Eloe and Henderson / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiple positive solutions of some boundary value problems / rank | |||
Normal rank |
Revision as of 12:18, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiple solutions for higher-order difference equations |
scientific article |
Statements
Multiple solutions for higher-order difference equations (English)
0 references
20 January 2000
0 references
Let \(T\in\{1,2, \dots\}\), \(I_0=\{0,1, \dots,T\}\) and \(y:I_n= \{0,1, \dots, T+n\}\to\mathbb{R}\). The authors discuss the \(n\)th \((n\geq 2)\) order discrete conjugate problem \[ (-1)^{n-p} \Delta^n y(k)=f \bigl(k,y(k)\bigr),\;k\in I_0, \] \[ \Delta^iy(0)=0,\;0\leq i\leq p-1\quad \text{(here }1\leq p\leq n-1), \] and the \(n\)th \((n\geq 2)\) order discrete \((n,p)\) problem \[ \begin{aligned} & \Delta^n y(k)+f\bigl(k,y(k)\bigr) =0,\;k\in i_0,\\ & \Delta^iy(0)=0,\;0\leq i\leq n-2,\\ & \Delta^p y(T+n-p)=0,\;0\leq p\leq n-1\;\text{ is fixed}.\end{aligned} \] The technique employed is based on existence principles, lower type inequalities and Krasnoselskij's fixed point theorem in a cone.
0 references
multiple solutions
0 references
higher-order difference equations
0 references
discrete conjugate problem
0 references
existence
0 references
inequalities
0 references
0 references