A Ulm-like method for inverse eigenvalue problems

Authors:
W. P. Shen;C. Li;X. Q. Jin
Affiliations:
Department of Mathematics, Zhejiang Normal University, Jinhua 321004, PR China;Department of Mathematics, Zhejiang University, Hangzhou 310027, PR China and Department of Mathematics, College of Sciences, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia;Department of Mathematics, University of Macau, Macao, PR China
Venue:
Applied Numerical Mathematics
Year:
2011

Citing 9
Cited 0

Thr formulation and analysis of numerical methods for inverse Eigenvalue problems

SIAM Journal on Numerical Analysis
Pole assignment by output feedback

Three decades of mathematical system theory
An inverse eigenvalue problem: computing B-stable Runge-Kutta methods having real poles

BIT
Numerical Solution of the Inverse Eigenvalue Problem for Real Symmetric Toeplitz Matrices

SIAM Journal on Scientific Computing
Inverse Eigenvalue Problems

SIAM Review
On the Convergence Rate of a Quasi-Newton Method for Inverse Eigenvalue Problems

SIAM Journal on Numerical Analysis
A New Parallel Approach to the Toeplitz Inverse Eigenproblem Using Newton-like Methods

VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
A note on a modification of Moser's method

Journal of Complexity
The Ulm method under mild differentiability conditions

Numerische Mathematik

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a Ulm-like method for solving inverse eigenvalue problems, which avoids solving approximate Jacobian equations comparing with other known methods. A convergence analysis of this method is provided and the R-quadratic convergence property is proved under the assumption of the distinction of given eigenvalues. Numerical experiments as well as the comparison with the inexact Newton-like method are given in the last section.