• Speaker: Paul Leopardi
  • Title: Finding quadrature points in a sparse grid: a down-set constrained binary knapsack problem
  • Location: Room V31, Mathematics Building (Callaghan Campus) The University of Newcastle
  • Time and Date: 3:00 pm, Thu, 22nd Oct 2015
  • Abstract:

    A dimension adaptive algorithm for sparse grid quadrature in reproducing kernel Hilbert spaces on products of spheres uses a greedy algorithm to approximately solve a down-set constrained binary knapsack problem. The talk will describe the quadrature problem, the knapsack problem and the algorithm, and will include some numerical examples.

  • [Permanent link]