[PDF][PDF] Towards an ADI iteration for tensor structured equations
… We will apply a generalized ADI iteration to these equations. Therefore we require a
stronger condition on the right-hand side. It is not enough to have only low-rank … In this
paper we will try out a different approach based on the ADI iteration, since that is closer to our
first way of interpreting these equations. The alternating direction implicit (ADI) iteration is an
efficient algorithm for the solution of equations Ax = b, where A = H +V with commuting H and
V for which the solution of linear systems is cheap compared to solving with A directly. The …
stronger condition on the right-hand side. It is not enough to have only low-rank … In this
paper we will try out a different approach based on the ADI iteration, since that is closer to our
first way of interpreting these equations. The alternating direction implicit (ADI) iteration is an
efficient algorithm for the solution of equations Ax = b, where A = H +V with commuting H and
V for which the solution of linear systems is cheap compared to solving with A directly. The …
Abstract
In this paper a generalization of the alternating directions implicit (ADI) iteration to higher dimensional problems is presented. This generalization solves approximately equations of the form
csc.mpi-magdeburg.mpg.de
以上显示的是最相近的搜索结果。 查看全部搜索结果