Van den Bos quadrature

[NAThompson]

No description provided.

[NAThompson]

@mborland , @JacobHass8 : I investigated the Padua points, but it appears there is no known literature that satisfies the properties:

• strictly positive weights
• arbitrary nesting
• optimal convergence Kexp(-c\sqrt{n})
• reasonable compute ratios between stages

This paper seems to satisfy all these constraints, and also can extend to nD. Interested?

We probably would need to test https://dl.acm.org/doi/abs/10.5555/2837.2842.

[JacobHass8]

This looks very interesting! Do you know how runtime scales with dimension and number of points used?

[mborland]

This looks very interesting! Do you know how runtime scales with dimension and number of points used?

I believe empirical evaluation is the next step. Nick and I had a competing idea, but literature review found this method.

[JacobHass8]

This looks very interesting! Do you know how runtime scales with dimension and number of points used?

I believe empirical evaluation is the next step. Nick and I had a competing idea, but literature review found this method.

I've been working on implementing sparse grids using the previously implemented Gauss-Legendre quadrature. Would that still be a worthwhile contribution or would this algorithm supersede?

[NAThompson]

I've been working on implementing sparse grids using the previously implemented Gauss-Legendre quadrature. Would that still be a worthwhile contribution or would this algorithm supersede?

@JacobHass8 : I think sparse grids would still be very valuable! We have many 1D quadrature methods, naively it seems like 2D is much more difficult and could be served by many 2D quadrature methods.