Advertisement

A New Approximation: Gauss-Lanczos Approximated SAR Model Solution

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

Abstract

In this chapter, a new approximate ML theory based solution for the SAR model which is called Gauss-Lanczos (GL) approximation is developed. The key idea of the proposed algorithm is to find only the some of the eigenvalues of a large matrix, instead of finding all the eigenvalues, by reducing the size of large matrix dramatically using GL algorithm [3]. Because of this property of GL algorithm, we can save huge computation costs, especially when the matrix size is quite large.

Keywords

Spatial Autocorrelation Problem Size Chebyshev Polynomial Large Problem Size Large Matrix 
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.

Preview

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