Recurrences and Triangular Systems

  • Efstratios Gallopoulos
  • Bernard Philippe
  • Ahmed H. Sameh
Chapter
Part of the Scientific Computation book series (SCIENTCOMP)

Abstract

A recurrence relation is a rule that defines each element of a sequence in terms of the preceding elements; it forms one of the most basic tools in discrete and computational mathematics with myriad applications in scientific computing, ranging from numerical linear algebra, the numerical solution of ordinary and partial differential equations and orthogonal polynomials, to dependence analysis in restructuring compilers and logic design. In fact, almost every computational task relies on recursive techniques and hence involves recurrence relations. Therefore, recurrence solvers are computational kernels and need to be implemented as efficient primitives on various architectures. Throughout this book we will encounter many linear and nonlinear recurrences that can be solved using techniques from this chapter. Linear recurrences can usually be expressed in the form of mostly banded lower triangular linear systems, so much of the discussion is devoted to parallel algorithms for solving \(\textit{Lx} = f\), where L is a lower triangular matrix.

References

  1. 1.
    Gautschi, W.: Computational aspects of three-term recurrence relations. SIAM Rev. 9, 24–82 (1967)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Rivlin, T.: The Chebyshev Polynomials. Wiley-Interscience, New York (1974)MATHGoogle Scholar
  3. 3.
    Kuck, D.: The Structure of Computers and Computations. Wiley, New Yok (1978)Google Scholar
  4. 4.
    Chen, S.C., Kuck, D.: Time and parallel processor bounds for linear recurrence systems. IEEE Trans. Comput. C-24(7), 701–717 (1975)Google Scholar
  5. 5.
    Sameh, A., Brent, R.: Solving triangular systems on a parallel computer. SIAM J. Numer. Anal. 14(6), 1101–1113 (1977)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Higham, N.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)CrossRefMATHGoogle Scholar
  7. 7.
    Sameh, A., Kuck, D.: A parallel QR algorithm for symmetric tridiagonal matrices. IEEE Trans. Comput. 26(2), 147–153 (1977)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Higham, N.: Stability of parallel triangular system solvers. SIAM J. Sci. Comput. 16(2), 400–413 (1995)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Lafon, J.: Base tensorielle des matrices de Hankel (ou de Toeplitz). Appl. Numer. Math. 23, 249–361 (1975)MathSciNetGoogle Scholar
  10. 10.
    Boole, G.: Calculus of Finite Differences. Chelsea Publishing Company, New York (1970)Google Scholar
  11. 11.
    Wimp, J.: Computation with Recurrence Relations. Pitman, Boston (1984)MATHGoogle Scholar
  12. 12.
    Kung, H.: New algorithms and lower bounds for the parallel evaluation of certain rational expressions and recurrences. J. Assoc. Comput. Mach. 23(2), 252–261 (1976)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Miranker, W.: Parallel methods for solving equations. Math. Comput. Simul. 20(2), 93–101 (1978). doi: 10.1016/0378-4754(78)90032-0. http://www.sciencedirect.com/science/article/pii/0378475478900320
  14. 14.
    Gal, S., Miranker, W.: Optimal sequential and parallel seach for finding a root. J. Combinatorial Theory 23, 1–14 (1977)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2016

Authors and Affiliations

  • Efstratios Gallopoulos
    • 1
  • Bernard Philippe
    • 2
  • Ahmed H. Sameh
    • 3
  1. 1.Computer Engineering and Informatics DepartmentUniversity of PatrasPatrasGreece
  2. 2.Campus de BeaulieuINRIA/IRISARennes CedexFrance
  3. 3.Department of Computer SciencePurdue UniversityWest LafayetteUSA

Personalised recommendations