Skip to main content

Stability Analysis of Parallel Evaluation of Finite Series of Orthogonal Polynomials

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (NAA 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1988))

Included in the following conference series:

  • 1280 Accesses

Abstract

In this paper we study the rounding errors in the parallel evaluation of a finite series of a general family of orthogonal polynomials. Both, the theoretical bounds and the numerical tests present an almost similar behavior between the sequential and the parallel algorithms.

The first author is supported partially by the Spanish Ministry of Education and Science (Project #ESP99-1074-CO2-01) and by the Centre National d’Études Spatiales at Toulouse (France). The second author is supported partially by Grants MM-707/97 and I-702/97 from the Bulgarian Ministry of Education and Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Barrio, R.: Parallel algorithms to evaluate orthogonal polynomial series, to appear on SIAM J. Sci. Comput.

    Google Scholar 

  2. Barrio, R.: Stability of parallel algorithms to evaluate Chebyshev series, submitted to Comput. Math. Appl.

    Google Scholar 

  3. Barrio, R. and Sabadell, J.: Parallel evaluation of Chebyshev and Trigonometric series, Comput. Math. Appl., 38 (1999), 99–106.

    Article  MATH  MathSciNet  Google Scholar 

  4. Barrio, R. and Yalamov, P. Y.: Stability of parallel algorithms for polynomial evaluation, submitted to SIAM J. Sci. Comput.

    Google Scholar 

  5. Higham, N. J.: Accuracy and stability of numerical algorithms, SIAM, Philadelphia, (1996).

    Google Scholar 

  6. Magnus, W., Oberhettinger, F. and Soni, R. P.: Formulas and Theorems for the Special Functions of Mathematical Physics, Springer-Verlag, (1966).

    Google Scholar 

  7. Yalamov, P. Y.: Stability of a Partitioning Algorithm for Bidiagonal Systems, Parallel Computing., 23 (1997), 333–348.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barrio, R., Yalamov, P. (2001). Stability Analysis of Parallel Evaluation of Finite Series of Orthogonal Polynomials. In: Vulkov, L., Yalamov, P., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2000. Lecture Notes in Computer Science, vol 1988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45262-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45262-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41814-6

  • Online ISBN: 978-3-540-45262-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics