The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
Displacement Structure: Theory and Applications
Open accessAbstract
In this survey paper, we describe how strands of work that are important in two different fields, matrix theory and complex function theory, have come together in some work on fast computational algorithms for matrices with what we call displacement structure. In particular, a fast triangularization procedure can be developed for such matrices, generalizing in a striking way an algorithm presented by Schur (1917) [J. Reine Angew. Math., 147 (1917), pp. 205–232] in a paper on checking when a power series is bounded in the unit disc. This factorization algorithm has a surprisingly wide range of significant applications going far beyond numerical linear algebra. We mention, among others, inverse scattering, analytic and unconstrained rational interpolation theory, digital filter design, adaptive filtering, and state-space least-squares estimation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Rogers, S. (1996) · Control Engineering Practice · doi:10.1016/0967-0661(96)82838-3 · Cited by 9,278
Gantmacher, F. R. (1984) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 8,520
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Linear prediction: A tutorial review
Makhoul, J. (1975) · Proceedings of the IEEE · doi:10.1109/proc.1975.9792 · Cited by 4,023
Introduction to matrix computations
Stewart, G. W. (1973) · International Linear Collider · Cited by 2,381
Szegő, G. (1939) · Colloquium Publications · doi:10.1090/coll/023 · Cited by 2,110
Markel, J. D., & Gray, A. H. (1976) · Communication and Cybernetics · doi:10.1007/978-3-642-66286-7 · Cited by 1,402
The Classical Moment Problem and Some Related Questions in Analysis
Akhiezer, N. I. (2020) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976397 · Cited by 1,208
Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind.
Schur, J. (1917) · crll · doi:10.1515/crll.1917.147.205 · Cited by 1,035
An exact recursion for the composite nearest-neighbor degeneracy for a 2×N lattice space
McQuistan, R. B., & Hock, J. L. (1984) · Journal of Mathematical Physics · doi:10.1063/1.526133 · Cited by 924
Numerical methods for solving linear least squares problems
Golub, G. (1965) · Numerische Mathematik · doi:10.1007/bf01436075 · Cited by 849
THE CLASSICAL MOMENT PROBLEM AND SOME RELATED QUESTIONS IN ANALYSIS
Mulholland, H. P. (1966) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-41.1.757 · Cited by 803
Fast, recursive-least-squares transversal filters for adaptive filtering
Cioffi, J., & Kailath, T. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164334 · Cited by 730
Self-citationInterpolation of Rational Matrix Functions
Ball, J. A., Gohberg, I., & Rodman, L. (1990) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-7709-1 · Cited by 723
Convolution equations and projection methods for their solution
Gohberg, I., & Fel′dman, I. (2005) · Translations of Mathematical Monographs · doi:10.1090/mmono/041 · Cited by 692
The Commutant Lifting Approach to Interpolation Problems
Foiaş, C., & Frazho, A. E. (1990) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-7712-1 · Cited by 598
Algebraic Methods for Toeplitz-like Matrices and Operators
Heinig, G., & Rost, K. (1984) · Operator Theory: Advances and Applications · doi:10.1007/978-3-0348-6241-7 · Cited by 580
An Algorithm for the Inversion of Finite Toeplitz Matrices
Trench, W. F. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112045 · Cited by 557
Brune, O. (1931) · Journal of Mathematics and Physics · doi:10.1002/sapm1931101191 · Cited by 537
Least Squares Computations by Givens Transformations Without Square Roots
GENTLEMAN, W. M. (1973) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/12.3.329 · Cited by 479
Displacement ranks of matrices and linear equations
Kailath, T., Kung, S.-Y., & Morf, M. (1979) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(79)90124-0 · Cited by 470
Self-citationA state-space approach to adaptive RLS filtering
Sayed, A. H., & Kailath, T. (1994) · IEEE Signal Processing Magazine · doi:10.1109/79.295229 · Cited by 449
Self-citationA Proposal for Toeplitz Matrix Calculations
Strang, G. (1986) · Studies in Applied Mathematics · doi:10.1002/sapm1986742171 · Cited by 428
Fast solution of toeplitz systems of equations and computation of Padé approximants
Brent, R. P., Gustavson, F. G., & Yun, D. Y. Y. (1980) · Journal of Algorithms · doi:10.1016/0196-6774(80)90013-9 · Cited by 385
Recursive solution to the multichannel filtering problem
Wiggins, R. A., & Robinson, E. A. (1965) · Journal of Geophysical Research · doi:10.1029/jz070i008p01885 · Cited by 369
A fast sequential algorithm for least-squares filtering and prediction
Carayannis, G., Manolakis, D., & Kalouptsidis, N. (1983) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1983.1164224 · Cited by 272
Superfast Solution of Real Positive Definite Toeplitz Systems
Ammar, G. S., & Gragg, W. B. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609005 · Cited by 258
The Nevanlinna–Pick Problem for Matrix-Valued Functions
Delsarte, P., Genin, Y., & Kamp, Y. (1979) · SIAM Journal on Applied Mathematics · doi:10.1137/0136005 · Cited by 255
Square-root algorithms for least-squares estimation
Morf, M., & Kailath, T. (1975) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1975.1100994 · Cited by 249
Self-citationAdvanced Digital Signal Processing
Proakis, J. G., Ling, F., & Rader, C. M. (1992) · Cited by 248
Some new algorithms for recursive estimation in constant, linear, discrete-time systems
Morf, M., Sidhu, G., & Kailath, T. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100576 · Cited by 221
Self-citationDoubling algorithms for Toeplitz and related equations
Morf, M. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1980.1171074 · Cited by 161
Numerical solution of linear equations with Toeplitz and Vector Toeplitz matrices
Bareiss, E. H. (1969) · Numerische Mathematik · doi:10.1007/bf02163269 · Cited by 154
Maximum entropy and the moment problem
Landau, H. J. (1987) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1987-15464-4 · Cited by 138
Lecture Notes in Control and Information Sciences
Postlethwaite, I., & MacFarlane, A. G. J. (1979) · Cited by 137
On Computations with Dense Structured Matrices
Pan, V. Y. (1990) · Mathematics of Computation · doi:10.1090/s0025-5718-1990-1023051-7 · Cited by 136
Complexity of multiplication with vectors for structured matrices
Gohberg, I., & Olshevsky, V. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90189-9 · Cited by 127
Hyperbolic householder transformations
Rader, C. M., & Steinhardt, A. O. (1986) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1986.1164998 · Cited by 127
Orthogonal digital filters for VLSI implementation
Rao, S. K., & Kailath, T. (1984) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1984.1085452 · Cited by 121
Self-citationLeast-squares adaptive lattice and transversal filters: A unified geometric theory
Lev-Ari, H., Kailath, T., & Cioffi, J. M. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056882 · Cited by 114
Self-citationGeneralized Displacement Structure for Block-Toeplitz, Toeplitz-Block, and Toeplitz-Derived Matrices
Kailath, T., & Chun, J. (1994) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479889169042 · Cited by 102
Self-citationExtended Levinson and Chandrasekhar equations for general discrete-time linear estimation problems
Friedlander, B., Kailath, T., Morf, M., & Lennart Ljung, A. (1978) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1978.1101797 · Cited by 99
Self-citationInversion of Generalized Cauchy Matrices and other Classes of Structured Matrices
Heinig, G. (1995) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4612-4228-4_5 · Cited by 96
Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations
Merchant, G. A., & Parks, T. W. (1982) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1982.1163845 · Cited by 95
Circulants, displacements and decompositions of matrices
Gohberg, I., & Olshevsky, V. (1992) · Integral Equations and Operator Theory · doi:10.1007/bf01200697 · Cited by 94
QR factorization of Toeplitz matrices
Bojańczyk, A. W., Brent, R. P., & Hoog, F. R. D. (1986) · Numerische Mathematik · doi:10.1007/bf01389431 · Cited by 81
Schur's Algorithm and Several Applications
Bakonyi, M., & Constantinescu, T. (1992) · Cited by 78
Parametrization of Newton's iteration for computations with structured matrices and applications
Pan, V. Y. (1992) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(92)90215-4 · Cited by 64
Extended Chandrasekhar recursions
Sayed, A. H., & Kailath, T. (1994) · IEEE Transactions on Automatic Control · doi:10.1109/9.280773 · Cited by 64
Self-citationSignal processing applications of some moment problems
Kailath, T. (1987) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/037/921085 · Cited by 58
Self-citationReichel, L., & Opfer, G. (1991) · Mathematics of Computation · doi:10.1090/s0025-5718-1991-1094957-9 · Cited by 55
Bozzo, E., & Fiore, C. D. (1995) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479893245103 · Cited by 51
A unified square-root-free approach for QRD-based recursive-least-squares estimation
Hsieh, S. F., Liu, K. J. R., & Yao, K. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.205742 · Cited by 51
Fast state space algorithms for matrix Nehari and Nehari-Takagi interpolation problems
Gohberg, I., & Olshevsky, V. (1994) · Integral Equations and Operator Theory · doi:10.1007/bf01194749 · Cited by 48
Fast inversion of Chebyshev--Vandermonde matrices
Gohberg, I., & Olshevsky, V. (1994) · Numerische Mathematik · doi:10.1007/s002110050018 · Cited by 47
Fast inversion algorithms of Toeplitz-plus-Hankel matrices
Heinig, G., Jankowski, P., & Rost, K. (1988) · Numerische Mathematik · doi:10.1007/bf01395817 · Cited by 41
Fast identification of state-space models via exploitation of displacement structure
Cho, Y. M., Xu, G., & Kailath, T. (1994) · IEEE Transactions on Automatic Control · doi:10.1109/9.328824 · Cited by 38
Self-citationDisplacement structure approach to Chebyshev-Vandermonde and related matrices
Kailath, T., & Olshevsky, V. (1995) · Integral Equations and Operator Theory · doi:10.1007/bf01195490 · Cited by 37
Self-citationDisplacement structure for Hankel, Vandermonde, and related (derived) matrices
Chun, J., & Kailath, T. (1991) · Linear Algebra and its Applications · doi:10.1016/0024-3795(91)90364-3 · Cited by 36
Self-citationDivide-and-Conquer Solutions of Least-Squares Problems for Matrices with Displacement Structure
Chun, J., & Kailath, T. (1991) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0612010 · Cited by 33
Self-citationTime-variant displacement structure and triangular arrays
Sayed, A. H., Lev-Ari, H., & Kailath, T. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.295212 · Cited by 25
Self-citationRao, S. K., & Kailath, T. (1985) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1985.1085645 · Cited by 25
Self-citationFast triangular factorization of the sum of quasi-Toeplitz and quasi-Hankel matrices
Sayed, A. H., Lev-Ari, H., & Kailath, T. (1993) · Linear Algebra and its Applications · doi:10.1016/0024-3795(93)90510-u · Cited by 12
Self-citationGeneralized Chandrasekhar recursions from the generalized Schur algorithm
Sayed, A. H., Kailath, T., & Lev-Ari, H. (1994) · IEEE Transactions on Automatic Control · doi:10.1109/9.333773 · Cited by 12
Self-citationFast algorithms for fixed-order recursive least squares parameter estimation
Kailath, T., & Slock, D. T. M. (1989) · Cited by 11
Self-citation
Cited by
Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
Nikolova, M., & Ng, M. K. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030600862 · Cited by 478
A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
Ng, M. K., Chan, R. H., & Tang, W.-C. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598341384 · Cited by 452
Displacement structure approach to polynomial Vandermonde and related matrices
Kailath, T., & Olshevsky, V. (1997) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(96)00315-1 · Cited by 50
Self-citation
Metadata
- Authors
- Kailath, T., & Sayed, A. H.
- Venue
- SIAM Review
- Published
- 1995-09
- Volume
- 37
- Issue
- 3
- Pages
- 297-386
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W1986676404
- Cited by
- 436
- References
- 66
- FWCI
- 29.58
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.