Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
936 1 |
Ultima descărcare din IBN: 2016-05-13 14:39 |
Căutarea după subiecte similare conform CZU |
004.421:[512.6+519.6] (1) |
Programe. Software (296) |
Algebră (409) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
SM ISO690:2012 GERDT, Vladimir, ROBERTZ, Daniel. Computation of Difference Grobner Bases. In: Computer Science Journal of Moldova, 2012, nr. 2(59), pp. 203-226. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 2(59) / 2012 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 004.421:[512.6+519.6] | ||||||
Pag. 203-226 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
This paper is an updated and extended version of our note [1] (cf. also [2]). To compute difference Grobner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the package. Its applications are illustrated by generation of finite difference approximations to linear partial differential equations and by reduction of Feynman integrals. We
also present the algorithm for an ideal generated by a finite set of nonlinear difference polynomials. If the algorithm terminates, then it constructs a GrÄobner basis of the ideal. |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Gerdt, V.P.</creatorName> </creator> <creator> <creatorName>Robertz, D.</creatorName> </creator> </creators> <titles> <title xml:lang='en'>Computation of Difference Grobner Bases</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2012</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier> <subjects> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>004.421:[512.6+519.6]</subject> </subjects> <dates> <date dateType='Issued'>2012-07-03</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'>This paper is an updated and extended version of our note [1] (cf. also [2]). To compute difference Grobner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the package. Its applications are illustrated by generation of finite difference approximations to linear partial differential equations and by reduction of Feynman integrals. We also present the algorithm for an ideal generated by a finite set of nonlinear difference polynomials. If the algorithm terminates, then it constructs a GrÄobner basis of the ideal.</description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>