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.

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation Vol. 203; no. 2; pp. 629 - 634
Main Authors: Neossi Nguetchue, S.N., Abelman, S.
Format: Journal Article
Language:English
Published: New York, NY Elsevier Inc 15.09.2008
Elsevier
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2008.05.012