Comparing Exact and Approximate SAR Model Solutions

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


Exact SAR model solution is both memory and compute intensive. It is needed to develop approximate solutions that do not sacrifice accuracy and can handle very large data-sets having billions of observation points. In this chapter, It is proposed to use two different approximations for solving the SAR model solution: Taylor’s Series expansion and Chebyshev Polynomials [33].


Problem Size Chebyshev Polynomial Thematic Classis Neighborhood Matrix Golden Section Search 
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