A parallel algorithm for generating discrete orthogonal polynomials

DOI10.1016/0167-8191(92)90005-RMaRDI QIDQ1199096zbMATH OpenFDO

Authors Ömer Eğecioğlu, Çetin Kaya Koç

Publication date 16 January 1993

Published in Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmdiscrete orthogonal polynomialsexperimental resultshypercube topologydistributed-memory multiprocessorthree-term recursion formulaGray code mappingIntel cube

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Parallel numerical computation (65Y05) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)

Recommendations

• Parallel Algorithms to Evaluate Orthogonal Polynomial Series
• Parallel rational interpolation
• Construction of polynomials that are orthogonal with respect to a discrete bilinear form
• scientific article; zbMATH DE number 2102138
• On generating orthogonal polynomials for discrete measures

Cited in

(3)

• Parallel Algorithms to Evaluate Orthogonal Polynomial Series
• scientific article; zbMATH DE number 4139196 (Why is no real title available?)
• Remark on algorithm 726

This page was built for publication: A parallel algorithm for generating discrete orthogonal polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199096)