Share Email Print

Proceedings Paper

How bad are symmetric Pick matrices?
Author(s): Dario Fasino; Vadim Olshevsky
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Let P be a symmetric positive definite Pick matrix of order n. The following facts will be proven here: (1) P is the Gram matrix of a set of rational functions, with respect to an inner product defined in terms of a 'generating function' associated to P; (2) Its condition number is lower-bounded by a function growing exponentially in n. (3) P can be effectively preconditioned by the Pick matrix generated by the same nodes and a constant function.

Paper Details

Date Published: 13 November 2000
PDF: 10 pages
Proc. SPIE 4116, Advanced Signal Processing Algorithms, Architectures, and Implementations X, (13 November 2000); doi: 10.1117/12.406491
Show Author Affiliations
Dario Fasino, Univ. of Udine (Italy)
Vadim Olshevsky, Georgia State Univ. (United States)

Published in SPIE Proceedings Vol. 4116:
Advanced Signal Processing Algorithms, Architectures, and Implementations X
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?