Eigenvalues of tridiagonal matrices: An alternative to Givens' method

Li, Baoxin; Law, A.G.; Raafat, Hazem M.; Nguyen, Phuong Ha; Yan, Yujin

doi:10.1016/0898-1221(90)90140-f

Search citation statements

Order By: Relevance

Paper Sections

Select...

A Time and Space Complexity1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1994

2009

Publication Types

Select...

Article3

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the Scheinhardt method, the complexity depends on N and depends also on the method used to obtain the eigenvalues of AD −1 . We mention here that the references [3] and [8] cited by [15] to obtain eigenvalues of the key matrix are not usable because the matrix AD −1 is not necessarily symmetric. The solution we adopted then was to build a companion matrix from the polynomial ∆ N −1 (x) and obtain the eigenvalues from that matrix.…”

Section: A Time and Space Complexitymentioning

confidence: 98%

Comparison of computation methods for the steady-state markov modulated fluid queues

Abbessi

Nabli

2009

2009 IEEE Symposium on Computers and Communications

View full text Add to dashboard Cite

The Markov-modulated fluid models are mathematical tools widely used in telecommunication networks modeling. These models represent the discrete entities of the network traffic as a continuous fluid whose rates depend on a Markov process. The study of the fluid models shows that they are governed by a linear differential system. Many techniques are used to solve these equations such as spectral analysis, Laplace transforms, orthogonal polynomials and recurrence relations. The purpose of this work is to study mathematically the resolution techniques and to compare them in term of computational complexity, accuracy and stability.

show abstract

Section: A Time and Space Complexitymentioning

confidence: 98%