The lanczos algorithm and complex gauss quadrature
| Autor: | Miroslav S. Pranić, Zdeněk Strakoš, Stefano Pozza |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Electronic transactions on numerical analysis 50 (2018): 1–19. doi:10.1553/etna_vol50s1 info:cnr-pdr/source/autori:Pozza S.; Pranic M.S.; Strakos Z./titolo:The lanczos algorithm and complex gauss quadrature/doi:10.1553%2Fetna_vol50s1/rivista:Electronic transactions on numerical analysis/anno:2018/pagina_da:1/pagina_a:19/intervallo_pagine:1–19/volume:50 |
| DOI: | 10.1553/etna_vol50s1 |
| Popis: | Gauss quadrature can be naturally generalized in order to approximate quasi-definite linear functionals, where the interconnections with (formal) orthogonal polynomials, (complex) Jacobi matrices, and the Lanczos algorithm are analogous to those in the positive definite case. In this survey we review these relationships with giving references to the literature that presents them in several related contexts. In particular, the existence of the n-weight (complex) Gauss quadrature corresponds to successfully performing the first n steps of the Lanczos algorithm for generating biorthogonal bases of the two associated Krylov subspaces. 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, the value of the Gauss quadrature is a real number whenever all relevant moments of the quasi-definite linear functional are real. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|