Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ISSN 0361 7688, Programming and Computer Software, 2011, Vol. 37, No. 2, pp. 7886. Pleiades Publishing, Ltd., 2011. Original Russian Text S.A. Abramov, A. Gheffar, D.E. Khmelnov, 2011, published in Programmirovanie, 2011, Vol. 37, No. 2.
 

Summary: ISSN 0361 7688, Programming and Computer Software, 2011, Vol. 37, No. 2, pp. 7886. Pleiades Publishing, Ltd., 2011.
Original Russian Text S.A. Abramov, A. Gheffar, D.E. Khmelnov, 2011, published in Programmirovanie, 2011, Vol. 37, No. 2.
78
1. INTRODUCTION
Finding rational solutions (i.e., solutions that have
form of rational functions) of linear difference equa
tions is a part of many computer algebra algorithms.
Study of methods for constructing such solutions is of
interest from the computer algebra standpoint.
Let k be a field of characteristic 0. We will consider
equations of the form
(1)
(x), a1(x), ..., an 1(x) k(x), a0(x) k(x)/{0}. Clear
ing the denominators, we obtain
(2)
(x), b1(x), ... bn 1(x) k[x], b0(x), bn(x) k[x]\{0}.
The last equation will be written in the operator form
L(y) = (x) with the operator
(3)
The notation f(x) g(x) will denote coprime poly

  

Source: Abramov, Sergei A. - Dorodnicyn Computing Centre of the Russian Academy of Sciences

 

Collections: Mathematics; Computer Technologies and Information Sciences