Parallel Implementations of Approximate SAR Model Solutions

  • Baris M. KazarEmail author
  • Mete Celik
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)


In this chapter, parallel approximate SAR models are developed using hybrid programming and sparse matrix algebra in order to reach very large problem sizes i.e. billions of observations. Hybrid programming enables greater scalability by using MPI across nodes and OpenMP within a single node. The developed parallel approximate SAR model solutions based on Chebyshev Polynomial and Taylor’s Series approximations.


Chebyshev Polynomial Parallel Implementation Large Problem Size Chebyshev Approximation Hybrid Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© The Author(s) 2012

Authors and Affiliations

  1. 1.Oracle America Inc.NashuaUSA
  2. 2.Erciyes UniversityKayseriTurkey

Personalised recommendations