A fully parallel method for tridiagonal eigenvalue problem.
Li, Kuiyuan (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Li, Kuiyuan (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Hua Dai (2010)
ESAIM: Mathematical Modelling and Numerical Analysis
Similarity:
Based on -like decomposition with column pivoting, a new and efficient numerical method for solving symmetric matrix inverse eigenvalue problems is proposed, which is suitable for both the distinct and multiple eigenvalue cases. A locally quadratic convergence analysis is given. Some numerical experiments are presented to illustrate our results.
Vajargah, Behrouz Fathi, Mehrdoust, Farshid (2011)
Advances in Numerical Analysis
Similarity:
Hua Dai (1995)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
Liu, Hao (2010)
Mathematical Problems in Engineering
Similarity:
A. Rakus (1972)
Applicationes Mathematicae
Similarity:
Dwyer, H.I., Zettl, A. (1995)
Electronic Journal of Differential Equations (EJDE) [electronic only]
Similarity:
K. A. Cliffe, T. J. Garratt, Alastair Spence (1993)
Applications of Mathematics
Similarity:
This paper is concerned with the problem of computing a small number of eigenvalues of large sparse generalized eigenvalue problems. The matrices arise from mixed finite element discretizations of time dependent equations modelling viscous incompressible flow. The eigenvalues of importance are those with smallest real part and are used to determine the linearized stability of steady states, and could be used in a scheme to detect Hopf bifurcations. We introduce a modified Cayley transform...
Tremblay, Jean Christophe, Carrington, Tucker jun. (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Similarity: