TITLE

COUNTING AND COMPUTING THE EIGENVALUES OF A COMPLEX TRIDIAGONAL MATRIX, LYING IN A GIVEN REGION OF THE COMPLEX PLANE

AUTHOR(S)
VALVI, F. N.; GEROYANNIS, V. S.
PUB. DATE
February 2013
SOURCE
International Journal of Modern Physics C: Computational Physics;Feb2013, Vol. 24 Issue 2, p-1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We present a numerical technique for counting and computing the eigenvalues of a complex tridiagonal matrix, lying in a given region of the complex plane. First, we evaluate the integral of the logarithmic derivative p′(λ)/p(λ), where p(λ) is the characteristic polynomial of the tridiagonal matrix, on a simple closed contour, being the closure of that region. The problem of evaluating this integral is transformed into the equivalent problem of numerically solving a complex initial value problem defined on an ordinary first-order differential equation, integrated along this contour, and solved by the Fortran package dcrkf54.f95 (developed recently by the authors). In accordance with the "argument principle," the value of the contour integral, divided by 2πi, counts the eigenvalues lying in the region. Second, a Newton-Raphson (NR) method, fed by random guesses lying in the region, computes the roots one by one. If, however, NR signals that |p′(λ)| converges to zero, i.e. a multiple root probably exists at the current value λ, then counting the roots within an elementary square centered at λ reveals the multiplicity of this root.
ACCESSION #
85897275

 

Related Articles

  • BARZILAI-BORWEIN-LIKE METHODS FOR THE EXTREME EIGENVALUE PROBLEM. HUAN GAO; YU-HONG DAI; XIAO-JIAO TONG // Journal of Industrial & Management Optimization;Jul2015, Vol. 11 Issue 3, p999 

    We consider numerical methods for the extreme eigenvalue prob lem of large scale symmetric positive definite matrices. By the variational principle, the extreme eigenvalue can be obtained by minimizing some uncon strained optimization problem. Firstly, we propose two adaptive nonmono tone...

  • On the Identification of Complex Conjugate Eigenvalues with the Positive Real Part for Some Class of Matrices. Roopamala, T. D.; Katti, S. K. // European Journal of Scientific Research;Feb2010, Vol. 40 Issue 4, p605 

    In this paper, a simple technique is presented for identification of complex conjugate eigenvalues with the positive real part for some class of matrices. The proposed analysis is efficient since there is no need to compute actual characteristics polynomial which requires lot of computations....

  • COMPLETE POLYNOMIAL BOUNDS FOR MATRICES. BLOWER, G. // Quarterly Journal of Mathematics;1997, Vol. 48 Issue 1, p11 

    The article discusses complete polynomial bounds for matrices. It notes that estimates on the size of the similarity needed to deform T into a contraction were found. It mentions that matrix T is considered to be polynomially bounded if there is a constant Kp. It states that best estimates of...

  • The parallel algorithm of eigenvalues of Jacobi matrix. LIU Yan-hong; LV Quan-yi // Basic Sciences Journal of Textile Universities / Fangzhi Gaoxia;Mar2011, Vol. 24 Issue 1, p20 

    A parallel algorithm for solving eigenvalues of real tridiagonal matrices is presented ,which mainly apply to Jacobi matrices. This algorithm firstly isolates a small single region which only includes a root from the large region of roots of the polynomials by using the Sturm method; secondly...

  • SYMBOLICAL COMBINATORY MODEL FOR SOLVING THE PROBLEM OF EIGENVALUES IN TASKS OF IDENTIFICATION OF DYNAMIC OBJECTS. Burovs, Genadijs // Computer Science (1407-7493);2008, Vol. 35, p143 

    The problem of calculating the eigenvalues of the matrix of systems of identification equations is considered. Traditional numerical methods possess a number of significant drawbacks. On the basis of symbolical combinatory models, a new more precise algorithm for finding the coefficients of the...

  • To solving problems of algebra for two-parameter matrices. VIII. Kublanovskaya, V. // Journal of Mathematical Sciences;Jul2011, Vol. 176 Issue 1, p83 

    The paper discusses the method of hereditary pencils for computing points of the regular and singular spectra of a general two-parameter polynomial matrix. The method allows one to reduce the spectral problems considered to eigenproblems for polynomial matrices and pencils of constant matrices....

  • A new root-fiding method using the Eigenvalue problem. XHAJA, Eglantina; HOXHA, Fatmir // International Journal of Science, Innovation & New Technology;Jul2012, p1 

    Polynomial root-finding is a classical and highly developed problem of mathematics and computational mathematics. There is a vast literature in approximating the roots of a polynomial and their convergence rate is quite high, but the matrix methods are among the most popular practical choices...

  • The inverse spectral problem for a Stieltjes eight-shaped string. Martynyuk, Olga; Pivovarchik, Vyacheslav // Journal of Mathematical Sciences;Oct2011, Vol. 178 Issue 1, p84 

    We consider a spectral problem generated by the Stieltjes string equation on a metric figure-of-eight graph and the corresponding inverse problem which is stated as follows. Values of the point masses located on one of the loops and the lengths of subintervals on it are given together with the...

  • An alternating LHSS preconditioner for saddle point problems. Liu Qingbing // Computational & Applied Mathematics;2012, Vol. 31 Issue 2, p339 

    In this paper, we present a new alternating local Hermitian and skew-Hermitian Splitting preconditioner for solving saddle point problems. The spectral property of the preconditioned matrices is studies in detail. Theoretical results show all eigenvalues of the preconditioned matrices will...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics