Article
On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors.
Mathematics and Computers in Simulation
01/2009;
79:2135-2147.
pp.2135-2147
Source: DBLP
-
Citations (0)
- Cited In (1)
-
Article: On the inverses of general tridiagonal matrices
[show abstract] [hide abstract]
ABSTRACT: In this work, the sign distribution for all inverse elements of general tridiagonal H-matrices is presented. In addition, some computable upper and lower bounds for the entries of the inverses of diagonally dominant tridiagonal matrices are obtained. Based on the sign distribution, these bounds greatly improve some well-known results due to Ostrowski (1952) [23], Shivakumar and Ji (1996) [26],Nabben (1999) [21,22] and recently given by Peluso and Politi (2001) [24], Peluso and Popolizio (2008) [25] and so forth. It is also stated that the inverse of a general tridiagonal matrix may be described by 2n − 2 parameters ({θk}n k=2 and {ϕk}n−1 k=1) instead of 2n + 2 ones as givenby El-Mikkawy(2004) [3], El-Mikkawyand Karawia (2006) [4] and Huang and McColl (1997) [10]. According to these results, a new symbolic algorithm for finding the inverse of a tridiagonal matrix without imposing any restrictive conditions is presented, which improves some recent results. Finally, several applications to the preconditioning technology, the numerical solution of differential equations and the birth–death processes together with numerical tests are given.Linear Algebra and its Applications 05/2010; 433(5):965-983. · 0.97 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed.
The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual
current impact factor.
Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence
agreement may be applicable.
