메뉴 건너뛰기




Volumn 38, Issue 11, 1999, Pages 99-106

Parallel evaluation of Chebyshev and trigonometric series

Author keywords

[No Author keywords available]

Indexed keywords

CHEBYSHEV APPROXIMATION; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; RECURSIVE FUNCTIONS;

EID: 0345504208     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(99)00289-8     Document Type: Article
Times cited : (5)

References (11)
  • 1
    • 0001733291 scopus 로고
    • Generalisations of Horner's rule for polynomial evaluation
    • W.S. Dorn, Generalisations of Horner's rule for polynomial evaluation, IBM J. Res. Develop. 6, 239-245, (1962).
    • (1962) IBM J. Res. Develop. , vol.6 , pp. 239-245
    • Dorn, W.S.1
  • 2
    • 0000184053 scopus 로고    scopus 로고
    • A simple parallel algorithm for polynomial evaluation
    • L. Li, J. Hu and T. Nakamura, A simple parallel algorithm for polynomial evaluation, SIAM J. Sci. Comput. 17, 260-262, (1996).
    • (1996) SIAM J. Sci. Comput. , vol.17 , pp. 260-262
    • Li, L.1    Hu, J.2    Nakamura, T.3
  • 3
    • 0015566748 scopus 로고
    • On the parallel evaluation of polynomials
    • K. Maruyama, On the parallel evaluation of polynomials, IEEE Trans. Comput. C-22, 2-5, (1973).
    • (1973) IEEE Trans. Comput. , vol.C-22 , pp. 2-5
    • Maruyama, K.1
  • 4
    • 0015793049 scopus 로고
    • Optimal algorithms for parallel polynomial evaluation
    • J.I. Munro and M. Paterson, Optimal algorithms for parallel polynomial evaluation, J. Comput. System Sci. 7, 189-198, (1973).
    • (1973) J. Comput. System Sci. , vol.7 , pp. 189-198
    • Munro, J.I.1    Paterson, M.2
  • 5
    • 0028480167 scopus 로고
    • Performance of parallel algorithms for the evaluation of power series
    • R.E. Overill and S. Wilson, Performance of parallel algorithms for the evaluation of power series, Parallel Computing 20, 1205-1213, (1994).
    • (1994) Parallel Computing , vol.20 , pp. 1205-1213
    • Overill, R.E.1    Wilson, S.2
  • 6
    • 0032226414 scopus 로고    scopus 로고
    • A parallel algorithm to evaluate Chebyshev series on a message-passing environment
    • electronic
    • R. Barrio and F.J. Sabadell, A parallel algorithm to evaluate Chebyshev series on a message-passing environment, SIAM J. Sci. Comp. 20, 964-969, (1998, electronic).
    • (1998) SIAM J. Sci. Comp. , vol.20 , pp. 964-969
    • Barrio, R.1    Sabadell, F.J.2
  • 8
    • 84968505704 scopus 로고
    • A note on the summation of Chebyshev series
    • C.W. Clenshaw, A note on the summation of Chebyshev series, Math. Tab. Wash. 9, 118-120, (1955).
    • (1955) Math. Tab. Wash. , vol.9 , pp. 118-120
    • Clenshaw, C.W.1
  • 9
    • 0002099734 scopus 로고
    • Generation and use of orthogonal polynomials for data fitting with a digital computer
    • G.E. Forsythe, Generation and use of orthogonal polynomials for data fitting with a digital computer, J. SIAM 5, 74-88, (1957).
    • (1957) J. SIAM , vol.5 , pp. 74-88
    • Forsythe, G.E.1
  • 10
    • 84968484453 scopus 로고
    • An algorithm for summing orthogonal polynomial series and their derivatives with applications to curve-fitting and interpolation
    • F.J. Smith, An algorithm for summing orthogonal polynomial series and their derivatives with applications to curve-fitting and interpolation, Math. Comp. 19, 33-36, (1965).
    • (1965) Math. Comp. , vol.19 , pp. 33-36
    • Smith, F.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.