Show simple item record

dc.contributor.authorLitvinenko, Alexander
dc.contributor.authorNowak, Wolfgang
dc.date.accessioned2017-06-12T10:24:00Z
dc.date.available2017-06-12T10:24:00Z
dc.date.issued2014-05-04
dc.identifier.urihttp://hdl.handle.net/10754/624938
dc.description.abstractKriging algorithms based on FFT, the separability of certain covariance functions and low-rank representations of covariance functions have been investigated. The current study combines these ideas, and so combines the individual speedup factors of all ideas. The reduced computational complexity is O(dLlogL), where L := max ini, i = 1
dc.titleKriging accelerated by orders of magnitude: combining low-rank with FFT techniques
dc.typePoster
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.conference.dateMay 4-6, 2014
dc.conference.nameSHAXC-2 Workshop 2014
dc.conference.locationKAUST
dc.contributor.institutionUniversität Stuttgart
kaust.personLitvinenko, Alexander
refterms.dateFOA2018-06-14T07:07:05Z


Files in this item

Thumbnail
Name:
litvinenko_kriging_poster.pdf
Size:
1.831Mb
Format:
PDF
Description:
Poster

This item appears in the following Collection(s)

Show simple item record