Direct recursive algorithms for the solution of band Toeplitz systems are here considered. They exploit the displacement rank properties, which allow a large reduction of computational efforts and storage requirements. Their use of the Sherman-Morrison-Woodbury formula turns out to be particularly suitable for the case of unbalanced bandwidths. The computational costs of the algorithms under consideration are compared both in a theoretical and practical setting. Some stability issues are discussed as well.
|Autori:||FAVATI P; LOTTI G; MENCHI O|
|Titolo:||Recursive algorithms for unbalanced banded Toeplitz systems|
|Anno del prodotto:||2009|
|Digital Object Identifier (DOI):||10.1002/nla.632|
|Appare nelle tipologie:||1.1 Articolo in rivista|