The geometric mean decomposition

被引：93

作者：

Jiang, Y

Hager, WW

Li, H

机构：

[1] Univ Florida, Dept Math, Gainesville, FL 32611 USA

[2] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2005年 / 396卷

基金：

美国国家科学基金会;

关键词：

geometric mean decomposition; matrix factorization; unitary factorization; singular value; decomposition; schur decomposition; QR decomposition; MIMO systems;

D O I：

10.1016/j.laa.2004.09.018

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a complex matrix H, we consider the decomposition H = QRP* where Q and P have orthonormal columns, and R is a real upper triangular matrix with diagonal elements equal to the geometric mean of the positive singular values of H. This decomposition, which we call the geometric mean decomposition, has application to signal processing and to the design of telecommunication networks. The unitary matrices correspond to information lossless filters applied to transmitted and received signals that minimize the maximum error rate of the network. Another application is to the construction of test matrices with specified singular values. (C) 2004 Elsevier Inc. All rights reserved.

引用

页码：373 / 384

页数：12

共 16 条

[1] WRITING ON DIRTY PAPER [J].