首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Two Splittings of a Square Matrix
Authors:Marko Huhtanen
Institution:(1) Department of Mathematics, Room 2-335, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 01239, USA
Abstract:In this note it is shown that any square matrix AisinC n×n can be represented as the sum A= 
$$\tilde S{\text{ }} + {\text{ }}\tilde T$$
, where 
$$\tilde S$$
is complex symmetric and rank 
$$(\tilde T)$$
lelfloor 
$$\tfrac{n}{2}$$
rfloor. The corresponding persymmetric result can be used in finding the terms of a small rank perturbed Toeplitz matrix via an O(n 2) computation. This allows one to perform fast matrix–vector products in case n is large.
Keywords:complex symmetric  unitary congruence  matrix nearness problem  iterative methods  Toeplitz+small rank
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号