A computational algorithm for solving nearly penta-diagonal linear systems

An efficient computational algorithm for solving nearly penta-diagonal linear systems is presented. A problem arising from the spreading of a thin power-law fluid, subject to periodic boundary conditions, illustrates the algorithm.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied mathematics and computation Ročník 203; číslo 2; s. 629 - 634
Hlavní autoři:	Neossi Nguetchue, S.N., Abelman, S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Elsevier Inc 15.09.2008 Elsevier
Témata:	Algebra Algebraic geometry Computer algebra systems (CAS) Determinants Exact sciences and technology Linear systems Mathematical analysis Mathematics Nearly penta-diagonal matrices Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use Linear systems Determinants Nearly penta-diagonal matrices Computer algebra systems (CAS) Numerical linear algebra Determinant Boundary condition Algorithm Direct method Numerical analysis Linear system Matrix inversion Applied mathematics Computer system Computer algebra
ISSN:	0096-3003, 1873-5649
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!