An Alternating Sequence Iteration’s Method for Computing Largest Real Part Eigenvalue of Essentially Positive Matrices: Collatz and Perron-Frobernius’ Approach

This paper describes a new numerical method for the numerical solution of eigenvalues with the largest real part of essentially positive matrices. Finally, a numerical discussion is given to derive the required number of mathematical operations of the new method. Comparisons between the new method and several well know ones, such as Power and QR methods, were discussed. The process consists of computing lower and upper bounds which are monotonically approximating the eigenvalue.

• Publication year

  2017

• Venue

  Journal of Applied and Computational Mathematics

• Publication date

  Unknown publication date

• Fields of study

  Mathematics

• Identifiers
  DOI 10.4172/2168-9679.1000334
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On high relative accuracy of the Kogbetliantz method

  2015cited by this paper
• A backward error for the symmetric generalized inverse eigenvalue problem

  2015cited by this paper
• Accurate eigenvalue decomposition of real symmetric arrowhead matrices and applications

  2013cited by this paper
• INVERSE PROBLEMS NEWSLETTER

  1999cited by this paper
• Computational methods in linear algebra

  1984influential reference
• A Class of Diagonal Transformation Methods for the Computation of the Spectral Radius of a Nonnegative Irreducible Matrix

  1981cited by this paper
• Reduction of a positive matrix to a quasistochastic matrix by a similar variation method

  1971cited by this paper
• Bounds for the maximal eigenvalue of a nonnegative irreducible matrix

  1969cited by this paper
• Computing the Maximal Eigenvalue and Eigenvector of a Positive Matrix

  1968cited by this paper
• An iterative procedure for computing the maximal root of a positive matrix

  1968cited by this paper
• Computing the Maximal Eigenvalue and Eigenvector of a Nonnegative Irreducible Matrix

  1968cited by this paper
• Convergence of the LR, QR, and Related Algorithms

  1965cited by this paper
• Bounds for the maximal characteristic root of a non-negative irreducible matrix

  1960cited by this paper
• Note on the Fundamental Theorem on Irreducible Non-Negative Matrices

  1958cited by this paper
• Reactor Criticality and Nonnegative Matrices

  1958cited by this paper
• Topological proofs for certain theorems on matrices with non-negative elements

  1958cited by this paper
• A Method for the Computation of the Greatest Root of a Positive Matrix

  1957cited by this paper
• Bounds for the Greatest Latent Root of a Positive Matrix

  1952cited by this paper
• Bounds for the Greatest Latent Roots of a Positive Matrix

  1950cited by this paper
• Einschließungssatz für die charakteristischen Zahlen von Matrizen

  1942cited by this paper

• Type the title of your paper here mathematical properties of n×n nonnegative matrix: case of irreducible Leslie matrix

  2019cites this paper