Results 261 to 270 of about 382,986 (293)
Some of the next articles are maybe not open access.

Orthogonal Polynomials on the Hexagon

SIAM Journal on Applied Mathematics, 1987
Least-square approximation by polynomials, with respect to area measure on the regular hexagon, is useful in the construction and analysis of hexagonal optical elements. Notably the Keck Ten-Meter Telescope will utilize a main mirror composed of thirty-six hexagonal segments.
openaire   +2 more sources

Vector Orthogonal Polynomials

SIAM Journal on Numerical Analysis, 1981
We give the relation between Hermite–Padé approximants and vector orthogonal polynomials. An algorithm for calculating vector orthogonal polynomials near the diagonal is described. An exact multiple integral formula for vector orthogonal polynomials is proved.
Burley, S. K., John, S. O., Nuttall, J.
openaire   +1 more source

On expansions in orthogonal polynomials

Advances in Computational Mathematics, 2011
In 2011, \textit{A. Iserles} [Numer. Math. 117, No. 3, 529--553 (2011; Zbl 1211.33001)] introduced an \(\mathcal{O}(N \log N)\) algorithm for the computation of the first \(N\) coefficients in an expansion of an analytic function in Legendre polynomials.
María José Cantero, Arieh Iserles
openaire   +1 more source

Pseudo-Orthogonal Polynomials

Siberian Mathematical Journal, 2001
The author presents an extension of a system of orthogonal polynomials on a finite set by using a transformation of weights of orthogonality. It is shown that if certain weights of orthogonality are negative, then the roots of the system of polynomials (under a specific selection of weights) are real and, moreover, these roots are weakly separated. The
openaire   +3 more sources

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 ...
openaire   +2 more sources

Galerkin orthogonal polynomials

Journal of Computational Physics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Orthogonal polynomials—centroid of their zeroes

Numerical Algorithms, 2008
Given and orthogonal polynomial sequence \((P_n)_n\), the centroid of the zeros of the \(n\)-th polynomial \(P_n\) is defined by \(s_n=\frac1n\sum_{k=1}^n x_{n,k}\), where \(x_{n,k}\), \(k=1,2,\dots,n\) are the roots of \(P_n\). In the present paper the author reviews some properties of the zeros and the centroid (such as inequalities, invariance with ...
openaire   +3 more sources

Binomial-Weighted Orthogonal Polynomials

Journal of the ACM, 1967
This paper discusses a set of polynomials, {φ r ( s )}, orthogonal over a discrete range, with binomial distribution, b ( s ; n , p ), as the weighting function.
openaire   +1 more source

Orthogonal Polynomial Fitting

Biometrika, 1953
Wishart, John, Metakides, Theocharis
openaire   +1 more source

Home - About - Disclaimer - Privacy