Constructing Sobolev orthonormal rational functions via an updating procedure
By: Amin Faghih , Marc Van Barel , Niel Van Buggenhout and more
Potential Business Impact:
Finds math patterns for better computer math.
In this paper, we generate the recursion coefficients for rational functions with prescribed poles that are orthonormal with respect to a continuous Sobolev inner product. Using a rational Gauss quadrature rule, the inner product can be discretized, thus allowing a linear algebraic approach. The presented approach involves reformulating the problem as an inverse eigenvalue problem involving a Hessenberg pencil, where the pencil will contain the recursion coefficients that generate the sequence of Sobolev orthogonal rational functions. This reformulation is based on the connection between Sobolev orthonormal rational functions and the orthonormal bases for rational Krylov subspaces generated by a Jordan-like matrix. An updating procedure, introducing the nodes of the inner product one after the other, is proposed and the performance is examined through some numerical examples.
Similar Papers
On computing the zeros of a class of Sobolev orthogonal polynomials
Numerical Analysis
Finds hidden patterns in math problems faster.
On the recovery of two function-valued coefficients in the Helmholtz equation for inverse scattering problems via inverse Born series
Numerical Analysis
Find hidden things using sound waves.
Numerical Derivatives, Projection Coefficients, and Truncation Errors in Analytic Hilbert Space With Gaussian Measure
Numerical Analysis
Finds math patterns in complex shapes.