A fully parallel method for tridiagonal eigenvalue problem.
Li, Kuiyuan (1994)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “A numerical method for solving inverse eigenvalue problems”
A fully parallel method for tridiagonal eigenvalue problem.
A numerical method for solving inverse eigenvalue problems
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.
Partitioning inverse Monte Carlo iterative algorithm for finding the three smallest eigenpairs of generalized eigenvalue problem.
Vajargah, Behrouz Fathi, Mehrdoust, Farshid (2011)
Advances in Numerical Analysis
Similarity:
About an inverse eigenvalue problem arising in vibration analysis
Hua Dai (1995)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
The robust pole assignment problem for second-order systems.
Liu, Hao (2010)
Mathematical Problems in Engineering
Similarity:
Algorithm 19. Calculation of all eigenvalues of a real matrix
A. Rakus (1972)
Applicationes Mathematicae
Similarity:
Eigenvalue computations for regular matrix Sturm-Liouville problems.
Dwyer, H.I., Zettl, A. (1995)
Electronic Journal of Differential Equations (EJDE) [electronic only]
Similarity:
On the inverse eigenvalue problem for a special kind of acyclic matrices
Mohammad Heydari, Seyed Abolfazl Shahzadeh Fazeli, Seyed Mehdi Karbassi (2019)
Applications of Mathematics
Similarity:
We study an inverse eigenvalue problem (IEP) of reconstructing a special kind of symmetric acyclic matrices whose graph is a generalized star graph. The problem involves the reconstruction of a matrix by the minimum and maximum eigenvalues of each of its leading principal submatrices. To solve the problem, we use the recurrence relation of characteristic polynomials among leading principal minors. The necessary and sufficient conditions for the solvability of the problem are derived....
A modified Cayley transform for the discretized Navier-Stokes equations
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...