This is the authors' abstract. We don't add key points for this paper.
The solution of a set of m linear equations with a non-Hermitian Toeplitz associated matrix is considered. Presently available fast algorithms solve this set with 4 m 2 “operations” (an “operation” is defined here as a set of one addition and one multiplication). An improved algorithm requiring only 3 m 2 “operations” is presented.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
S. Zohar (1974) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: