Answers are grounded in this paper and cite their sources.
The stability of the circular deconvolution algorithm for the solution of a circulant linear system is studied. This algorithm is known to be not strongly stable. The notion of almost strong stability is introduced, and it is shown that it leads to results similar to those for strongly stable algorithms. Then it is proved that the circular deconvolution algorithm based on fast Fourier transforms is almost strongly stable with respect to the 2-norm. A numerical example illustrates the theoretical conclusions.
No takes yet. Share an insight, caveat, or question.
Plamen Y. Yalamov (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: