Solvability of boundary-value problems for a linear partial difference equation

dc.contributor.authorStevic, Stevo
dc.date.accessioned2022-03-16T21:32:53Z
dc.date.available2022-03-16T21:32:53Z
dc.date.issued2017-01-14
dc.description.abstractIn this article we consider the two-dimensional boundary-value problem dm,n = dm-1,n + ƒn dm-1,n-1, 1 ≤ n < m, dm,0 = αm, d m,m = b m, m ∈ ℕ, where αm, bm, m ∈ ℕ and ƒn, n ∈ ℕ, are complex sequences. Employing recently introduced method of half-lines, it is shown that the boundary-value problem is solvable, by finding an explicit formula for its solution on the domain, the, so called, combinatorial domain. The problem is solved for each complex sequence ƒn, n ∈ ℕ, that is, even if some of its members are equal to zero. The main result here extends a recent result in the topic.
dc.description.departmentMathematics
dc.formatText
dc.format.extent10 pages
dc.format.medium1 file (.pdf)
dc.identifier.citationStevic, S. (2017). Solvability of boundary-value problems for a linear partial difference equation. <i>Electronic Journal of Differential Equations, 2017</i>(17), pp. 1-10.
dc.identifier.issn1072-6691
dc.identifier.urihttps://hdl.handle.net/10877/15522
dc.language.isoen
dc.publisherTexas State University, Department of Mathematics
dc.rightsAttribution 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.sourceElectronic Journal of Differential Equations, 2017, San Marcos, Texas: Texas State University and University of North Texas.
dc.subjectPartial difference equation
dc.subjectSolvable difference equation
dc.subjectMethod of half-lines
dc.subjectCombinatorial domain
dc.titleSolvability of boundary-value problems for a linear partial difference equation
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
stevic.pdf
Size:
218.02 KB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.54 KB
Format:
Item-specific license agreed upon to submission
Description: