Statistics – Applications
Scientific paper
Nov 1999
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1999spie.3807..312o&link_type=abstract
Proc. SPIE Vol. 3807, p. 312-323, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, Franklin T. Luk;
Statistics
Applications
Scientific paper
The classical Caratheodory-Fejer and Nevanlinna-Pick interpolation problems have a long and distinguished history, appearing in a variety of applications in mathematics and electrical engineering. It is well-known that these problems can be solved in O(n2) operations, where n is the overall multiplicity of interpolation points. In this paper we suggest a superfast algorithm for solving the more general confluent tangential interpolation problem. The cost of the new algorithm varies from O(n log2 n) to O(n log3 n), depending on the multiplicity pattern of the interpolation points. The new algorithm can be used to factorize, invert, and solve a linear system of equations with confluent- Cauchy-like matrices. This class of matrices includes Hankel-like (i.e., permuted Toeplitz-like), Vandermonde-like and Cauchy-like matrices as special cases. An important ingredient of the proposed method is a new fast algorithm to compute a product of a confluent- Cauchy-like matrix by a vector.
Olshevsky Vadim
Shokrollahi M. A.
No associations
LandOfFree
Unified superfast algorithm for confluent tangential interpolation problems and for structured matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Unified superfast algorithm for confluent tangential interpolation problems and for structured matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unified superfast algorithm for confluent tangential interpolation problems and for structured matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1513870