Numerical integration as a finite matrix approximation to multiplication operator (Q2423516)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numerical integration as a finite matrix approximation to multiplication operator |
scientific article |
Statements
Numerical integration as a finite matrix approximation to multiplication operator (English)
0 references
20 June 2019
0 references
Gaussian quadrature for the integral \(\int_\Omega f(x)w(x)dx\) is captured by the Golub-Meurant formula as the top left element in the matrix \(f(J_n)\) where \(J_n\) is the Jacobi matrix for the underlying orthonormal polynomial sequence. This matrix is the truncated form of the matrix representation of the multiplication operator \(M(x):f(x)\mapsto xf(x)\), with respect to the orthogonal polynomial basis. In this paper the idea is extended considerably in three essential ways. (1) One may replace \(M(x)\) by \(M(g(x)): f(x)\mapsto g(x)f(x)\) for a bounded \(g\) in a separable Hilbert space. (2) The polynomial basis can be replaced by any, not necessary orthogonal, basis. (3) \(\Omega\) can be a subset of \(\mathbb{R}^d\). The result will always be a scalar integration problem for \(f(x)\). The interpretation that can be given to the entries of the matrix \(f(M(g))\) is explored. Convergence and other properties are discussed. The paper is very readable with one-liner proofs referring to known literature. The possibilities are illustrated with some numerical examples that need symbolic computation when the condition is bad.
0 references
numerical integration
0 references
multiplication operator
0 references
matrix function
0 references
Gaussian quadrature
0 references
0 references
0 references