MORE: talk by Miroslav Pranic

The talk Gauss quadrature and Lanczos algorithm, by Miroslav Pranic will be held on Monday March 13, 2017 at 9:00 in room K4.


Gauss quadrature can be naturally generalized to approximate quasi-definite linear functionals, where the interconnections with (formal) orthogonal polynomials, (complex) Jacobi matrices and Lanczos algorithm are analogous to those in the positive definite case. In this talk we show that existence of the n-weight (complex) Gauss quadrature corresponds to performing successfully the first n steps of the Lanczos algorithm for generating the biorthogonal bases for the two associated Krylov subspaces. We also prove that the Jordan decomposition of the (complex) Jacobi matrix can be explicitly expressed in terms of the Gauss quadrature nodes and weights and the associated orthogonal polynomials. Since the output of the Lanczos algorithm can be made real whenever the input is real, it can be shown that the value of the Gauss quadrature is a real number whenever all relevant moments of the quasi-definite linear functional are real.