Results 271 to 280 of about 15,437 (317)

On Generating Orthogonal Polynomials

SIAM Journal on Scientific and Statistical Computing, 1982
We consider the problem of numerically generating the recursion coefficients of orthogonal polynomials, given an arbitrary weight distribution of either discrete, continuous, or mixed type. We discuss two classical methods, respectively due to Stieltjes and Chebyshev, and modern implementations of them, placing particular emphasis on their numerical ...
Walter Gautschi
exaly   +3 more sources

Orthogonal Polynomial Wavelets

Numerical Algorithms, 2002
The authors construct orthogonal polynomial wavelets and extend some results of \textit{B. Fischer} and \textit{J. Prestin} [Math. Comput. 66, No. 220, 1593-1618 (1997; Zbl 0896.42020)]. Let \(P_j\) \((j= 0,1,\dots)\) be orthonormal polynomials on \([a,b]\) \((-\infty\leq a< b\leq\infty)\) with respect to a nonnegative weight function \(w\).
Fischer B, Themistoclakis W
openaire   +4 more sources

Orthogonal Polynomials Associated with Related Measures and Sobolev Orthogonal Polynomials

Numerical Algorithms, 2003
Let \(d\mu_1\) and \(d\mu_2\) be two measures with the same support \(E\). They are said to be related to each other by a first degree polynomial multiplication, if \[ (x-q)d\mu_1(x)=cd\mu_2(x), \] where the first degree polynomial \(c^{-1}(x-q)\) is positive on \(E\). The authors study the connection between two sequences of orthogonal polynomials and
A. C. Berti   +2 more
openaire   +3 more sources

Computing orthogonal polynomials

Computers & Operations Research, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank G. Landram, Bahram Alidaee
openaire   +1 more source

Home - About - Disclaimer - Privacy