Solvability of boundary value problems for a class of partial difference equations on the combinatorial domain

DC Field	Value	Language
dc.contributor.author	Stević, Stevo	en
dc.date.accessioned	2020-05-01T20:13:14Z	-
dc.date.available	2020-05-01T20:13:14Z	-
dc.date.issued	2016-12-01	en
dc.identifier.issn	1687-1847	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1383	-
dc.description.abstract	By modifying our recent method of half-lines we show how the following boundary value problem for partial difference equations can be solved in closed form: dn,k = dn−1,k−1 + f(k)dn−1,k, 1≤k<n, dn,0 = un, dn,n = vn, n∈N, where (un)n∈N and (vn)n∈N are given sequences of complex numbers, and f is a complex-valued function on N.	en
dc.publisher	Springer Link	-
dc.relation.ispartof	Advances in Difference Equations	en
dc.subject	boundary value problem \| equation solvable in closed form \| partial difference equation \| the method of half-lines	en
dc.title	Solvability of boundary value problems for a class of partial difference equations on the combinatorial domain	en
dc.type	Article	en
dc.identifier.doi	10.1186/s13662-016-0987-z	en
dc.identifier.scopus	2-s2.0-84992598397	en
dc.relation.issue	1	en
dc.relation.volume	2016	en
dc.description.rank	M22	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
item.openairetype	Article	-
crisitem.author.orcid	0000-0002-7202-9764	-

13

checked on Jan 2, 2025

17

checked on Jan 2, 2025

Check