Unitary rank structured matrices
نویسندگان
چکیده
In this paper we describe how one can represent a unitary rank structured matrix in an efficient way as a product of unitary or Givens transformations. We provide also some basic operations for manipulating the representation, such as the transition to zerocreating form, the transition to a unitary/Givens-weight representation, as well as an internal pull-through process of the two branches of the representation. Finally, we characterize how to determine the ‘shift’ correction term to the rank structure, and we provide some applications to this result.
منابع مشابه
Eigenvalue computation for unitary rank structured matrices
In this paper we describe how to compute the eigenvalues of a unitary rank structured matrix in two steps. First we perform a reduction of the given matrix into Hessenberg form, next we compute the eigenvalues of this resulting Hessenberg matrix via an implicit QR-algorithm. Along the way, we explainhow the knowledge of a certain ‘shift’ correction term to the structure can be used to speed up ...
متن کاملTransforming a hierarchical into a unitary-weight representation
In this paper we consider a class of hierarchically rank structured matrices, including some of the hierarchical matrices occurring in the literature, such as hierarchically semiseparable (HSS) and certain H∈-matrices. We describe a fast O(rn log(n)) and stable algorithm to transform this hierarchical representation into a so-called unitary-weight representation, as introduced in an earlier wor...
متن کاملCompression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
This paper is concerned with the reduction of a unitary matrix U to CMV-like shape. A Lanczos–type algorithm is presented which carries out the reduction by computing the block tridiagonal form of the Hermitian part of U , i.e., of the matrix U +UH . By elaborating on the Lanczos approach we also propose an alternative algorithm using elementary matrices which is numerically stable. If U is ran...
متن کاملThe explicit QR-algorithm for rank structured matrices
In this paper we show how to perform in an explicit way the shifted QR-algorithm for computing the eigenvalues of a rank structured matrix. The implementation is based on the underlying preservation of rank structure under the QR-algorithm. It will be expressed in terms of the Givens-weight/unitary-weight representation which we introduced in a previous paper. The results of some numerical expe...
متن کاملA Hessenberg Reduction Algorithm for Rank Structured Matrices
In this paper we show how to perform the Hessenberg reduction of a rank structured matrix under unitary similarity operations in an efficient way, using the Givens-weight representation which we introduced in an earlier paper. This reduction can be used as a first step for eigenvalue computation. We also show how the algorithm can be modified to compute the bidiagonal reduction of a rank struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006