An improved algorithm for in situ adaptive tabulation

Authors:
Liuyan Lu;Stephen B. Pope
Affiliations:
Sibley School of Mechanical and Aerospace Engineering, Cornell University, Ithaca, NY 14853, USA;Sibley School of Mechanical and Aerospace Engineering, Cornell University, Ithaca, NY 14853, USA
Venue:
Journal of Computational Physics
Year:
2009

Citing 3
Cited 2

Indexing for function approximation

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
High-Speed Function Approximation

ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Parallel heuristics for an on-line scientific database for efficient function approximation

PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing

Computationally efficient implementation of combustion chemistry in parallel PDF calculations

Journal of Computational Physics
Dynamic adaptive chemistry with operator splitting schemes for reactive flow simulations

Journal of Computational Physics

Quantified Score

Hi-index	31.46

Visualization

Abstract

In situ adaptive tabulation (ISAT) is a proven storage/retrieval method which efficiently provides accurate approximations to high-dimensional functions which are computationally expensive to evaluate. Previous applications of ISAT to computations of turbulent combustion have resulted in speed-ups of up to a thousand. In this paper, improvements to the original ISAT algorithm are described and demonstrated using two test problems. The principal improvements are in the table-searching strategies and the addition of an error checking and correction algorithm. Compared to an earlier version of ISAT, reductions in CPU time and storage requirements by factors of 2 and 5, respectively, are observed for the most challenging, 54-dimensional test problem.