|ITEM METADATA RECORD
|Title: ||Orthogonality and linear prediction|
|Authors: ||Bultheel, Adhemar # ×|
|Issue Date: ||Aug-1993 |
|Conference: ||The Second International Colloquium on Numerical Analysis location:Plovdiv, Bulgaria date:August 17, 1993|
|Abstract: ||A simple algorithm like the Euclidean algorithm that everybody knows
as a method to compute the greatest common divisor of two integers,
when applied in more general situations may solve some unexpected
One can trace the fundaments of this algorithm in applications
the recursive computation of PadÃ© approximants, the theory of continued
fractions, the recurrence relations of orthogonal polynomials,
the partial realization problem of linear
systems theory, the theory of linear predictive coding, the Lanczos method
for solving large (un)symmetric linear systems or eigenvalue problems
and several others.
We shall give a survey of some of these applications.
|Publication status: ||published|
|KU Leuven publication type: ||IMa|
|Appears in Collections:||Numerical Analysis and Applied Mathematics Section|
× corresponding author|
# (joint) last author|
|Files in This Item:
There are no files associated with this item.
All items in Lirias are protected by copyright, with all rights reserved.