zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Superfast solution of real positive definite Toeplitz systems. (English) Zbl 0671.65021
Linear algebra in signals, systems, and control, Proc. SIAM Conf., Boston/Mass. 1986, 107-125 (1988).

[For the entire collection see Zbl 0661.00019.]

The authors derive a generalized Schur algorithm for the “superfast” solution of real positive definite Toeplitz systems Mx=b of order n+1, where n=2 ν . Fast Toeplitz solvers are based on ideas from the classical theory of Szegö polynomials. In particular, the Szegö polynomials can be identified with the columns of the reverse Cholesky factorization of M -1 . Schur’s algorithm generates a continued fraction representation of the holomorphic function mapping the unit disk in the complex plane into its closure.

The generalized Schur algorithm is a doubling procedure for calculating the linear fractional transformation that results from n steps of Schur’s algorithm. By using standard fast Fourier transform, the authors construct the linear fractional transformation that results from n steps of Schur’s algorithm in O(n log 2 n) complex multiplications. The implementation uses the split-radix fast Fourier transform algorithms for real data of Duhamel that exploit the inherent symmetries of the real data.

Reviewer: Th.Beth
MSC:
65F05Direct methods for linear systems and matrix inversion (numerical linear algebra)
65T40Trigonometric approximation and interpolation (numerical methods)
68Q25Analysis of algorithms and problem complexity