20
Kriging with large data sets using sparse matrix techniques

Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Embed Size (px)

Citation preview

Page 1: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Kriging  with  large  data  sets  using  sparse  matrix  techniques  

Page 2: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Kriging  

•  One  method  of  obtaining  an  es9mated  map  of  the  variable  of  this  map  in  different  parts  of  the  region  is  kriging.  

Page 3: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Assump9on  for  ordinary  kriging  

•  (1)  Z(s)  is  a  random  func9on  •  (2)  E(Z(s))=μ  for  all  s  in  the  region  •  (3)  

•  The  func9on  2γ(h)  is  called  the  variogram  of  the  process.  If  2γ(h)  exists,  the  process  is  called  intrinsically  sta9onary  

Page 4: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·
Page 5: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·
Page 6: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·
Page 7: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·
Page 8: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

•  If  the  random  process  is  second  order  sta9onary;  then  the  variogram  has  a  sill:  

•  If  the  random  process  have  a  sill:  

Page 9: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·
Page 10: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

This  gives  the  covariogram-­‐based  version  of  the  kriging  equa9on:  

Page 11: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Advantage  and  disadvantage  of  variogram  and  covariogram  kriging  equa9on  

•  Time  consuming  computa9on  of  

         Need  only  be  done  once.  

•  The  9me  required  to  solve  a  dense  (few  nonzero  entries)  linear  n*n  system  grows  at  order  n^3,  and  the  required  memory  is  of  order  n^2    

Page 12: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Sparse  matrix  techniques  

•  Main  idea:    to  exclude  observa9ons  far  away  from  s0.  

•  Lower  9me  and  storage  costs  

Page 13: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Variogram  VS  covariogram  

•  Variogram:  (1)  Less  biased                                                      (2)can  be  defined  for  some  process  that  are  not  second  order  sta9onary  

•  Covariogram:  

Page 14: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

•  (1)  Es9mate  the  variogram  from  the  data  

•  (2)compu9ng  the  covariogram  matrix  ∑  

•  Then,  we  can  retain  the  low  bias  of  variogram  es9ma9on  along  with  the  computa9onal  advantage  of  sparsity  in  ∑.  

Page 15: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Inves9ga9on  of  the  rela9ve  computa9on  

•  For  each  n,  R,  we  obtain  the  sparse  matrix  Σ  and  full  matrix  Γ  

Spherical  variogram:  

Page 16: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·
Page 17: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

R=0.3   R=0.6   R=0.9  

density   9/n   25/n   69/n  

slope   1.39   1.63   1.67  

Page 18: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Geochemical  Data  

Page 19: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

The  advantage  of  sparse  techniques  do  not  depend  on  the  use  of  a  regular  lagce.  

Bailey  and  Gatrell  fit  a  spherical  variogram  to  the  log  of  the  nickel  concentra9on,  obtaining  the  covariogram  model:  

The  resul9ng  covariance  matrix  is  very  sparse,  with  only  2096  nonzero  elements  compared  with  839056  elements  in  full  matrix.  The  sparse  techniques  are  432  9mes  as  fast!  

Page 20: Kriging&with&large&datasets&using& …and&covariogram&kriging&equaon& • Time&consuming&computaon&of& Needonlybedoneonce. • The&9me&required&to&solve&adense& ...comp_exp/jour.club/Kriging_with... ·

Discussion  

•  We  do  not  es9mate  the  covariogram  directly.  To  obtain  sparse  matrices,  variogram  models  with  a  finite  range  must  be  used.  (Spherical  variogram)  

•  For  irregular  data,  it  is  possible  that  a  poor  choice  of  ordering  could  decrease  the  efficiency.