Symmetric Matrix Polynomial Equation: Interpolation Results
نویسندگان
چکیده
An interpolation approach is pursued to solve a bilateral matrix polynomial equation frequently arising in control and signal processing. It results in eecient and numerically reliable resolution methods. Abstract New numerical procedures are proposed to solve the symmetric matrix polynomial equation A T (?s)X(s) + X T (?s)A(s) = 2B(s) that is frequently encountered in control and signal processing. An interpolation approach is presented that takes fully advantage of symmetry properties and leads to an equivalent reduced-size linear system of equations. It results in a simple and general characterization of all solutions of expected column degrees. Several new theoretical results concerning stability theory and reduced Sylvester resultant matrices are also developed and used to conclude a priori on the existence of a solution. By means of numerical experiments, it is shown that our algorithms are more eecient than older methods and, namely, appear to be numerically reliable.
منابع مشابه
Symmetric Matrix Polynomial Equation
A new numerical procedure is proposed to solve the symmetric matrix polynomial equation A T (?s)X(s) + X T (?s)A(s) = 2B(s) that is frequently encountered in control and signal processing. It is based on interpolation and takes fully advantage of symmetry of the equation by reducing the original problem dimension. The algorithm is more eecient and more general than older methods and, namely, it...
متن کاملA hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix
In this paper we suggest a hybrid method for computing the smallest eigenvalue of a symmetric and positive definite Toeplitz matrix which takes advantage of two types of methods, Newton’s method for the characteristic polynomial and projection methods based on rational interpolation of the secular equation.
متن کاملComputing the Smallest Eigenvalue of a Symmetric Toeplitz Matrix
In this note we discuss a method of order 1 + √ 3 for computing the smallest eigenvalue λ1 of a symmetric and positive definite Toeplitz matrix. It generalizes and improves a method introduced in [7] which is based on rational Hermitean interpolation of the secular equation. Taking advantage of a further rational approximation of the secular equation which is essentially for free and which yiel...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 34 شماره
صفحات -
تاریخ انتشار 1998