Skip to main content

Notes on the classification of numerical algorithms with respect to their stability to roundoff errors

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (WNAA 1996)

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

Included in the following conference series:

Abstract

First a review of previous results on dependence graphs and roundoff error analyses is presented. Then it is shown that allowing perturbations of outputs does not change the bounds on the forward error essentially in two important cases. A new condition number of the algorithm is introduced. Finally, a classification of all numerical algorithms is given.

This work was supported by Grant MM-434/94 from the Bulgarian Ministry of Education, Science and Technology

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chatin-Chatelin, F., Frayssé, V.: Lectures in finite precision computations. SIAM, 1996

    Google Scholar 

  2. Hansen, P. C., Yalamov, P. Y.: Stabilization by perturbation of a 4n 2 Toeplitz solver. Preprint N25, Technical University of Russe, January 1995 (submitted to SIAM J. Matrix Anal. Appl.)

    Google Scholar 

  3. Higham, N. J.: Accuracy and stability of numerical algorithms. SIAM, 1996

    Google Scholar 

  4. Pavlov, V. T., Todorova, D.: Stabilization and experience with a partitining method for tridiagonal systems. Preprint N30, University of Rousse, 1996 (in this volume)

    Google Scholar 

  5. Skeel, R. D.: Scaling for numerical stability in Gaussian elimination. J. Assoc. Comput. Mach. 26 (1979) 494–526

    Google Scholar 

  6. Stummel, F.: Perturbation theory for evaluation algorithms of arithmetic expressions. Math. Comp. 37 (1981) 435–473

    Google Scholar 

  7. Voevodin, V. V., Yalamov, P. Y.: A new method of roundoff error estimation. Parallel and Distributed Processing (K. Boyanov, ed.), Elsevier, Amsterdam, 1990, 315–333

    Google Scholar 

  8. Wilkinson, J. H.: The algebraic eigenvalue problem. Clarendon Press, Oxford, 1965

    Google Scholar 

  9. Yalamov, P. Y.: On the stability of the cyclic reduction without back substitution for tridiagonal systems. BIT 35 (1994) 428–447

    Google Scholar 

  10. Yalamov, P. Y.: On some classes of backward stable algorithms. Preprint N27, Center of Applied Mathematics and Informatics, University of Rousse, 1995

    Google Scholar 

  11. Yalamov, P. Y., Pavlov, V. T.: Stabilization by perturbation of ill-conditioned cyclic reduction. Preprint N28, Center of Applied Mathematics and Informatics, University of Rousse, 1996

    Google Scholar 

  12. Yalamov, P. Y.: Notes on the classification of numerical algorithms with respect to their stability to roundoff errors. Preprint N31, Center of Applied Mathematics and Informatics, University of Rousse, 1996

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lubin Vulkov Jerzy Waśniewski Plamen Yalamov

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yalamov, P.Y. (1997). Notes on the classification of numerical algorithms with respect to their stability to roundoff errors. In: Vulkov, L., Waśniewski, J., Yalamov, P. (eds) Numerical Analysis and Its Applications. WNAA 1996. Lecture Notes in Computer Science, vol 1196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62598-4_139

Download citation

  • DOI: https://doi.org/10.1007/3-540-62598-4_139

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62598-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics