A numerical method of determining eigenvalues of matrices of arbitrary large size
type: Item
instance of: scholarly article
title: A numerical method of determining eigenvalues of matrices of arbitrary large size
zbMATH Open document ID: 1072.65053
DOI: 10.1023/B:CASA.0000034458.85470.08
author: V. V. Khylenko
published in: Cybernetics and Systems Analysis
publication date: 2005-06-07T00:00:00Z
review text: The author proposes a new algorithm for computing the eigenvalues of real matrices. It has the advantage that its computational complexity does not exponentially increase with increasing matrix size. Moreover, the algorithm is convenient for any types of matrices, and first of all for determination of eigenvalues of stiff matrices.
reviewed by: Constantin Popa
Mathematics Subject Classification ID: 65F15
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 2174124
zbMATH Keywords: eigenvalue
zbMATH Keywords: stiff matrices
zbMATH Keywords: algorithm
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: b:casa.0000034458.85470.08
OpenAlex ID: W2021526757
Recommended article: A numerical method for computing eigenvectors of a large matrix
Recommended article: Q3602459
Recommended article: Numerical Methods for Large Eigenvalue Problems
Recommended article: Numerical methods for large eigenvalue problems
Recommended article: An approximation method for eigenvectors of very large matrices
Recommended article: An algorithm for solution of large eigenvalue problems
Recommended article: Computational methods for large eigenvalue problems
Recommended article: A method for computing a few eigenpairs of large generalized eigenvalue problems
Recommended article: Q3975057
description: scientific article; zbMATH DE number 2174124