Construction of polynomials that are orthogonal with respect to a discrete bilinear form |
| |
Authors: | Lothar Reichel |
| |
Institution: | (1) Department of Mathematics and Computer Science, Kent State University, 44242 Kent, OH, USA |
| |
Abstract: | We describe a new algorithm for the computation of recursion coefficients of monic polynomials {p
j
}
j
=0/n
that are orthogonal with respect to a discrete bilinear form (f, g) :=
k
=1/m
f(x
k
)g(x
k
)w
k
,m n, with real distinct nodesx
k
and real nonvanishing weightsw
k
. The algorithm proceeds by applying a judiciously chosen sequence of real or complex Givens rotations to the diagonal matrix diagx
1,x
2, ...,x
m
] in order to determine an orthogonally similar complex symmetric tridiagonal matrixT, from whose entries the recursion coefficients of the monic orthogonal polynomials can easily be computed. Fourier coefficients of given functions can conveniently be computed simultaneously with the recursion coefficients. Our scheme generalizes methods by Elhay et al. 6] based on Givens rotations for updating and downdating polynomials that are orthogonal with respect to a discrete inner product. Our scheme also extends an algorithm for the solution of an inverse eigenvalue problem for real symmetric tridiagonal matrices proposed by Rutishauser 20], Gragg and Harrod 17], and a method for generating orthogonal polynomials based theoron 18]. Computed examples that compare our algorithm with the Stieltjes procedure show the former to generally yield higher accuracy except whenn m. Ifn is sufficiently much smaller thanm, then both the Stieltjes procedure and our algorithm yield accurate results.Research supported in part by the Center for Research on Parallel Computation at Rice University and NSF Grant No. DMS-9002884. |
| |
Keywords: | Orthogonal polynomials bilinear form inverse eigenvale problem Stieltjes procedure |
本文献已被 SpringerLink 等数据库收录! |
|