Results 261 to 270 of about 448,247 (335)
Some of the next articles are maybe not open access.
Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications
SIAM Journal of Scientific Computing, 1993One important issue for matrix eigenvalue problems on high performance parallel computers is the cost of data movement. The paper shows that the eigenvalues and eigenvectors of a symmetric \(n\times n\) matrix can be found by \(O(\log_ 2n)\) matrix multiplications.
Ya Yan Lu, Shing-Tung Yau
exaly +3 more sources
Modified Finite Element Transfer Matrix Method for Eigenvalue Problem of Flexible Structures [PDF]
The speedy computation of eigenvalue problems is the key point in structure dynamics. In this paper, by combining transfer matrix method and finite element method, the modified finite element-transfer matrix method and its algorithm for eigenvalue ...
Xiaoting Rui, Rong Bao, Rui Xiaoting
exaly +3 more sources
Microcomputer Algorithms, 2020
Find scalars λ and vectors x = 0 for which Ax = λx The form of the matrix affects the way in which we solve this problem, and we also have variety as to what is to be found. • A symmetric and real (or Hermitian and complex). This is the most common case.
J. Killingbeck
openaire +2 more sources
Find scalars λ and vectors x = 0 for which Ax = λx The form of the matrix affects the way in which we solve this problem, and we also have variety as to what is to be found. • A symmetric and real (or Hermitian and complex). This is the most common case.
J. Killingbeck
openaire +2 more sources
An inverse eigenvalue problem for Jacobi matrix
Applied Mathematics and Computation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ying Wei 0003, Hua Dai 0001
openaire +3 more sources
The eigenvalue problem of a specially updated matrix
Applied Mathematics and Computation, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiu Ding, Guangming Yao
openaire +3 more sources
An Algorithm for Generalized Matrix Eigenvalue Problems
SIAM Journal on Numerical Analysis, 1973A new method, called the $QZ$ algorithm, is presented for the solution of the matrix eigenvalue problem $Ax = \lambda Bx$ with general square matrices A and B. Particular attention is paid to the degeneracies which result when B is singular. No inversions of B or its submatrices are used.
Moler, C. B., Stewart, G. W.
openaire +4 more sources
Inverse matrix eigenvalue problems
Journal of Mathematical Sciences, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chugunov V N, Kh D Ikramov, Ikramov Kh D
exaly +2 more sources
Eigenvalue problem for an irregular ?-matrix
Journal of Soviet Mathematics, 1980The solution of the eigenvalue problem is examined for the polynomial matrixD(λ)=Aoλs+A1λs−1+...+As when the matricesA0 andA2 (or one of them) are singular. A normalized process is used for solving the problem, permitting the determination of linearly independent eigenvectors corresponding to the zero eigenvalue of matrixD(λ) and to the zero eigenvalue
V N Kublanovskaya +2 more
exaly +2 more sources

