Skip to main content
SpringerLink
Log in

The stable ATA-orthogonal s-step Orthomin(k) algorithm with the CADNA library

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

The major drawback of the s-step iterative methods for nonsymmetric linear systems of equations is that, in the floating-point arithmetic, a quick loss of orthogonality of s-dimensional direction subspaces can occur, and consequently slow convergence and instability in the algorithm may be observed as s gets larger than 5. In [18], Swanson and Chronopoulos have demonstrated that the value of s in the s-step Orthomin(k) algorithm can be increased beyond s=5 by orthogonalizing the s direction vectors in each iteration, and have shown that the ATA-orthogonal s-step Orthomin(k) is stable for large values of s (up to s=16). The subject of this paper is to show how by using the CADNA library, it is possible to determine a good value of s for ATA-orthogonal s-step Orthomin(k), and during the run of its code to detect the numerical instabilities and to stop the process correctly, and to restart the ATA-orthogonal s-step Orthomin(k) in order to improve the computed solution. Numerical examples are used to show the good numerical properties.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P.N. Brown, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Statist. Comput. 12 (1991) 58–78.

    Article  MATH  MathSciNet  Google Scholar 

  2. J.M. Chesneaux, Study of the computing accuracy by using probabilistic approach, in: Contribution to Computer Arithmetic and Self Validating Numerical Methods, ed. C. Ulrich (IMACS, New Brunswick, NJ, 1990) pp. 19–30.

    Google Scholar 

  3. J.M. Chesneaux, CADNA, an ADA tool for round-off error analysis and for numerical debugging, in: Proc.Congress on ADA in Aerospace, Barcelona (1990).

  4. J.M. Chesneaux, Descriptif d'utilisation du logiciel CADNA F, MASI Report, No. 92-32 (1992).

  5. J.M. Chesneaux, The equality relations in scientific computing, Numer. Algorithms 7 (1994) 129–143.

    Article  MATH  MathSciNet  Google Scholar 

  6. J.M. Chesneaux and J. Vignes, Sur la robustesse de la méthode CESTAC, C. R. Acad. Sci. Paris, Sér. I Math. 307 (1988) 855–860.

    MATH  MathSciNet  Google Scholar 

  7. J.M. Chesneaux and J. Vignes, Les fondements de l'arithmétique stochastique, C. R. Acad. Sci. Paris Sér. I Math. 315 (1992) 1435–1440.

    MATH  MathSciNet  Google Scholar 

  8. A.T. Chronopoulos, s-step iterative methods for (non)symmetric (in)definite linear systems, SIAM J. Numer. Anal. 28(6) (1991) 1776–1789.

    Article  MATH  MathSciNet  Google Scholar 

  9. A.T. Chronopoulos and C.W. Gear, s-step iterative methods for symmetric linear systems, J. Comput. Appl. Math. 25 (1989) 153–168.

    Article  MATH  MathSciNet  Google Scholar 

  10. A.T. Chronopoulos and C.W. Gear, Implementation of preconditioned s-step conjugate gradient methods on a multiprocessor system with memory hierarchy, Parallel Comput. 11 (1989) 37–53.

    Article  MATH  MathSciNet  Google Scholar 

  11. A.T. Chronopoulos and S.K. Kim, The s-step Orthomin and s-step GMRES implemented on parallel computers, in: SIAM Conf.on Iterative Methods, The Copper Mountain, CO (April 1–5, 1990), University of Minnesota, Dept. of Computer Science, Tech. Report 90-15, Minneapolis, MN (1990).

    Google Scholar 

  12. H.C. Elman, A stability analysis of incomplete LU factorizations, J. Math. Comput. 47(175) (1986) 191–217.

    Article  MathSciNet  Google Scholar 

  13. A. Feldstein and R. Goodman, Convergence estimates for the distribution of trailing digits, J. ACM 23 (1976) 287–297.

    Article  MATH  MathSciNet  Google Scholar 

  14. R.W. Hamming, On the distribution of numbers, Bell Syst. Tech. J. 49 (1970) 1609–1625.

    MATH  MathSciNet  Google Scholar 

  15. T.E. Hull and J.R. Swenson, Test of probabilistic models for propagation of round-off errors, Commun. ACM 9(2) (1966).

  16. M. La Porte and J. Vignes, Evaluation statistique des erreurs numériques dans les calculs sur ordinateur, Numer. Math. 23 (1974) 63–72.

    Article  MATH  MathSciNet  Google Scholar 

  17. M. La Porte and J. Vignes, Algorithmes Numériques – Analyse et Mise en œuvre, Vol. 1, Arithmétique des Ordinateurs – Systèmes Linéaires (Editions Technip, Paris, 1974).

    Google Scholar 

  18. C.D. Swanson and A.T. Chronopoulos, Orthogonal s-step methods for nonsymmetric linear systems of equations, in: ACM Int.Conf.on Supercomputing (July 19–23, 1992) pp. 456–464.

  19. J. Vignes, New methods for evaluating the validity of the results of mathematical computations, Math. Comput. Simulation 20(4) (1978) 227–249.

    Article  MATH  MathSciNet  Google Scholar 

  20. J. Vignes, Zéro mathématique et zéro informatique, C. R. Acad. Sci. Paris Sér. I Math. 303 (1986) 997–1000; also La Vie des Sciences 4(1) (1987) 1–13.

    MATH  MathSciNet  Google Scholar 

  21. J. Vignes, Contrôle et estimation stochastique des arrondis de calcul, AFCET/Interfaces 54 (1987) 3–11.

    Google Scholar 

  22. J. Vignes, A stochastic arithmetic for reliable scientific computation, Math. Comput. Simulation 35 (1993) 233–261.

    Article  MathSciNet  Google Scholar 

  23. H. Walker, Implementation of the GMRES method using Householder transformations, SIAM J. Sci. Statist. Comput. 9 (1988) 152–163.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Ferdowsi University of Mashhad, c[Mashhad, Iran

    Faezeh Toutounian

Authors
  1. Faezeh Toutounian
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Toutounian, F. The stable ATA-orthogonal s-step Orthomin(k) algorithm with the CADNA library. Numerical Algorithms 17, 105–119 (1998). https://doi.org/10.1023/A:1012013911053

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012013911053

Search

Navigation