A Numerical Method for Computing an SVD-like Decomposition
نویسنده
چکیده
We present a numerical method to compute the SVD-like decomposition B = QDS−1, where Q is orthogonal, S is symplectic and D is a permuted diagonal matrix. The method can be applied directly to compute the canonical form of the Hamiltonian matrices of the form JBTB, where J = [ 0 −I I 0 ] . It can also be applied to solve the related application problems such as the gyroscopic systems and linear Hamiltonian systems. Error analysis and numerical examples show that the eigenvalues of JBTB computed by this method are more accurate than that computed by the methods working on the explicit product JBTB or BJBT .
منابع مشابه
Numerical Computation of an Analytic Singular Value Decomposition of a Matrix Valued Function Partial Support Received from Sfb 343, Diskrete Strukturen in Der Mathematik, Universitt at Bielefeld
This paper extends the singular value decomposition to a path of matrices E(t). An analytic singular value decomposition of a path of matrices E(t) is an analytic path of factorizations E(t) = X(t)S(t)Y (t)T where X(t) and Y (t) are orthogonal and S(t) is diagonal. To maintain di erentiability the diagonal entries of S(t) are allowed to be either positive or negative and to appear in any order....
متن کاملFace Recognition Based Rank Reduction SVD Approach
Standard face recognition algorithms that use standard feature extraction techniques always suffer from image performance degradation. Recently, singular value decomposition and low-rank matrix are applied in many applications,including pattern recognition and feature extraction. The main objective of this research is to design an efficient face recognition approach by combining many tech...
متن کاملNumerical Computation of an Analytic
This paper extends the singular value decomposition to a path of matrices E(t). An analytic singular value decomposition of a path of matrices E(t) is an analytic path of factorizations E(t) = X(t)S(t)Y (t)T where X(t) and Y (t) are orthogonal and S(t) is diagonal. To maintain di erentiability the diagonal entries of S(t) are allowed to be either positive or negative and to appear in any order....
متن کاملA Jacobi Method for Computing Generalized Hyperbolic SVD
In this paper, we introduce a joint hyperbolic-orthogonal decomposition of two matrices which we call a Generalized Hyperbolic SVD, or GHSVD. This decomposition can be used for nding the eigenvalues and eigenvectors of a symmetric indeenite pencil X T X ? Y T Y where = diag(1). We also present an implicit Jacobi-like method for computing this GHSVD.
متن کاملNew Fast and Accurate Jacobi Svd Algorithm: I. Lapack Working
This paper is the result of contrived efforts to break the barrier between numerical accuracy and run time efficiency in computing the fundamental decomposition of numerical linear algebra – the singular value decomposition (SVD) of a general dense matrix. It is an unfortunate fact that the numerically most accurate one–sided Jacobi SVD algorithm is several times slower than generally less accu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 26 شماره
صفحات -
تاریخ انتشار 2005