๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The folding algorithm for pentadiagonal matrices

โœ Scribed by John P. Killingbeck; Georges Jolicard

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
327 KB
Volume
166
Category
Article
ISSN
0375-9601

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A fast algorithm for solving diagonally
A fast algorithm for solving diagonally dominant symmetric pentadiagonal Toeplitz systems
โœ Jeffrey Mark McNally ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 298 KB

Banded Toeplitz systems of linear equations arise in many application areas and have been well studied in the past. Recently, significant advancement has been made in algorithm development of fast parallel scalable methods to solve tridiagonal Toeplitz problems. In this paper we will derive a new al

Algorithms for m-fold Hypergeometric Sum
Algorithms for m-fold Hypergeometric Summation
โœ Wolfram Koepf ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 482 KB

Zeilberger's algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms \(F(n, k)\) is extended to certain nonhypergeometric terms. An expression \(F(n, k)\) is called hypergeometric term if both \(F(n+1, k) / F(n, k)\) and \(F(n, k+1) / F(n, k)\) are rational fun

An algorithm for inverting rational matr
An algorithm for inverting rational matrices
โœ Ching-An Lin; Chien-Wen Yang; Tung-Fu Hsieh ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 389 KB