The buneman variant of the block cyclic reduction algorithm begins as a highly parallel algorithm, but collapses with each reduction to a very serial one. Using partial fraction expansions of rational matrix functions...
详细信息
The buneman variant of the block cyclic reduction algorithm begins as a highly parallel algorithm, but collapses with each reduction to a very serial one. Using partial fraction expansions of rational matrix functions, it isshown how to regain the parallelism. The resulting algorithm using nspan>2span>span>span>span>span>span>span><span class="MJX_Assistive_MathML" role="presentation">="http://www.
暂无评论