A Modified DETGTRI Algorithm with Applications

Please use this identifier to cite or link to this item: https://ir.vidyasagar.ac.in/jspui/handle/123456789/721

Full metadata record

DC Field	Value	Language
dc.contributor.author	Moawwad, E.A.El-Mikkawy
dc.date.accessioned	2016-12-22T17:01:01Z	-
dc.date.available	2016-12-22T17:01:01Z	-
dc.date.issued	2013-11-25
dc.identifier.issn	0972-8791 (Print)
dc.identifier.uri	http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/721	-
dc.description	18-29	en_US
dc.description.abstract	In the current article we present a modified version of the DETGTRI algorithm in [1]. Based on the modified algorithm , an efficient and reliable Maple procedure is written to compute any nth order tri-diagonal determinant. As an application, we show that all orthogonal polynomials can be computed efficiently using this procedure.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science Vol 10 [2006]
dc.subject	Orthogonal Polynomials	en_US
dc.subject	Determinants	en_US
dc.subject	Recurrence Relations	en_US
dc.subject	Maple	en_US
dc.title	A Modified DETGTRI Algorithm with Applications	en_US
dc.type	Article	en_US
Appears in Collections:	Journal of Physical Sciences Vol.10 [2006]

Files in This Item:

File	Description	Size	Format
JPS10art2.pdf		652.22 kB	Adobe PDF	View/Open