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


Existence and Computation of Low Kronecker-Rank Approximations for Large Linear Systems of Tensor Product Structure
Authors:L Grasedyck
Affiliation:(1) Max-Planck-Institute for Mathematics in the Sciences, Inselstr. 22-26, D-04103 Leipzig, Germany
Abstract:In this paper we construct an approximation to the solution x of a linear system of equations Ax=b of tensor product structure as it typically arises for finite element and finite difference discretisations of partial differential operators on tensor grids. For a right-hand side b of tensor product structure we can prove that the solution x can be approximated by a sum of MediaObjects/s00607-003-0037-zflb1.gif(log(epsiv)2) tensor product vectors where epsiv is the relative approximation error. Numerical examples for systems of size 1024256 indicate that this method is suitable for high-dimensional problems.
Keywords:Data-sparse approximation  Sylvester equation  low rank approximation  Kronecker product  high-dimensional problems
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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