journal article
oaidoi:10.1016/0024-3795(87)90122-4

A fast but unstable orthogonal triangularization technique for Toeplitz matrices

Authors
Publication date
30 April 1987
Publisher
Published by Elsevier Inc.
Doi

    Abstract

    AbstractD. Sweet's clever QR decomposition algorithm for Toeplitz matrices is considered. It requires only O(n2) flops to factor an n × n matrix. We analyze the algorithm to point out its deficiencies, and compare it against two other Toeplitz solvers

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/0024-3795(87)90122...
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.