Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2010, Article ID 268093, 17 pages
http://dx.doi.org/10.1155/2010/268093
Research Article

A Novel Parallel Algorithm Based on the Gram-Schmidt Method for Tridiagonal Linear Systems of Equations

Mechanical and Aerospace Engineering Department, Science and Research Branch, Islamic Azad University (IAU), Tehran 1477-893855, Iran

Received 8 June 2010; Revised 19 September 2010; Accepted 6 December 2010

Academic Editor: David Chelidze

Copyright © 2010 Seyed Roholah Ghodsi and Mohammad Taeibi-Rahni. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. N. Datta, Numerical Linear Algebra and Applications, SIAM, Philadelphia, Pa, USA, 2nd edition, 2010. View at Zentralblatt MATH
  2. D. P. O'Leary and P. Whitman, “Parallel QR factorization by householder and modified Gram-Schmidt algorithms,” Parallel Computing, vol. 16, no. 1, pp. 99–112, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. A. Pothen and P. Raghavan, “Distributed orthogonal factorization: givens and Householder algorithms,” SIAM Journal on Scientific and Statistical Computing, vol. 10, no. 6, pp. 1113–1134, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  4. J. Blackford, J. Choi, A. Cleary et al., ScaLAPACK Users’ Guide, SIAM, Philadelphia, Pa, USA, 1997.
  5. E. Agullo, J. Dongarra, B. Hadri et al., “PLASMA 2.0 users’ guide,” Tech. Rep., ICL, UTK, 2009. View at Google Scholar
  6. A. Buttari, J. Langou, J. Kurzak, and J. Dongarra, “Parallel tiled QR factorization for multicore architectures,” Concurrency Computation Practice and Experience, vol. 20, no. 13, pp. 1573–1590, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. R. W. Hockney, “A fast direct solution of Poisson's equation using Fourier analysis,” Journal of the Association for Computing Machinery, vol. 12, pp. 95–113, 1965. View at Google Scholar · View at Zentralblatt MATH
  8. H. S. Stone, “An efficient parallel algorithm for the solution of a tridiagonal linear system of equations,” Journal of the Association for Computing Machinery, vol. 20, pp. 27–38, 1973. View at Google Scholar · View at Zentralblatt MATH
  9. H. H. Wang, “A parallel method for tridiagonal equations,” ACM Transactions on Mathematical Software, vol. 7, no. 2, pp. 170–183, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  10. E. Kilic, “Explicit formula for the inverse of a tridiagonal matrix by backward continued fractions,” Applied Mathematics and Computation, vol. 197, no. 1, pp. 345–357, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. G. H. Golub and C. F. van Loan, Matrix Computations, Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, Md, USA, 3rd edition, 1996.
  12. P. Amodio, L. Brugnano, and T. Politi, “Parallel factorizations for tridiagonal matrices,” SIAM Journal on Numerical Analysis, vol. 30, no. 3, pp. 813–823, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. P. Amodio and L. Brugnano, “The parallel QR factorization algorithm for tridiagonal linear systems,” Parallel Computing, vol. 21, no. 7, pp. 1097–1110, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. S. R. Ghodsi, B. Mehri, and M. Taeibi-Rahni, “A parallel implementation of Gram-Schmidt algorithm for dense linear system of equations,” International Journal of Computer Applications, vol. 5, no. 7, pp. 16–20, 2010. View at Google Scholar
  15. R. Doallo, B. B. Fraguela, J. Touriño, and E. L. Zapata, “Parallel sparse modified Gram-Schmidt QR decomposition,” in Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking, vol. 1067 of Lecture Notes In Computer Science, pp. 646–653, 1996.
  16. E. L. Zapata, J. A. Lamas, F. F. Rivera, and O. G. Plata, “Modified Gram-Schmidt QR factorization on hypercube SIMD computers,” Journal of Parallel and Distributed Computing, vol. 12, no. 1, pp. 60–69, 1991. View at Publisher · View at Google Scholar
  17. L. C. Waring and M. Clint, “Parallel Gram-Schmidt orthogonalisation on a network of transputers,” Parallel Computing, vol. 17, no. 9, pp. 1043–1050, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. B. Kruatrachue and T. Lewis, “Grain size determination for parallel processing,” IEEE Software, vol. 5, no. 1, pp. 23–32, 1988. View at Publisher · View at Google Scholar · View at Scopus
  19. A. W. Lim and M. S. Lam, “Maximizing parallelism and minimizing synchronization with affine partitions,” Parallel Computing, vol. 24, no. 3-4, pp. 445–475, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  20. L. Giraud, J. Langou, and M. Rozloznik, “The loss of orthogonality in the Gram-Schmidt orthogonalization process,” Computers & Mathematics with Applications, vol. 50, no. 7, pp. 1069–1075, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  21. A. Björck and C. C. Paige, “Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm,” SIAM Journal on Matrix Analysis and Applications, vol. 13, no. 1, pp. 176–190, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  22. T. Wittwer, An Introduction to Parallel Programming, VSSD uitgeverij, 2006.
  23. M. Snir and W. Gropp, MPI: The Complete Reference, MIT Press, Cambridge, UK, 2nd edition, 1998.
  24. T. M. Austin, M. Berndt, and J. D. Moulton, “A memory efficient parallel tridiagonal solver,” Tech. Rep. LA-UR 03-4149, Mathematical Modeling and Analysis Group, Los Alamos National Laboratory, Los Alamos, NM, USA, 2004. View at Google Scholar
  25. W. M. Lioen and D. T. Winter, “Solving large dense systems of linear equations on systems with virtual memory and with cache,” Applied Numerical Mathematics, vol. 10, no. 1, pp. 73–85, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  26. J. Demmel, L. Grigori, M. F. Hoemmen, and J. Langou, “Communication-optimal parallel and sequential QR and LU factorizations,” Tech. Rep. UCB/EECS-2008-89, Electrical Engineering and Computer Sciences University of California at Berkeley, Berkeley, Calif, USA, 2008. View at Google Scholar
  27. P. Amodio, “Optimized cyclic reduction for the solution of linear tridiagonal systems on parallel computers,” Computers & Mathematics with Applications, vol. 26, no. 3, pp. 45–53, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH