Skip to content

Van den Bos quadrature - #1440

Open
NAThompson wants to merge 2 commits into
developfrom
vandenbos_quadrature
Open

Van den Bos quadrature#1440
NAThompson wants to merge 2 commits into
developfrom
vandenbos_quadrature

Conversation

@NAThompson

Copy link
Copy Markdown
Collaborator

No description provided.

@NAThompson

NAThompson commented Aug 28, 2026

Copy link
Copy Markdown
Collaborator Author

@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.

Comment thread test/test_van_den_bos.cpp Outdated
Comment thread test/test_van_den_bos.cpp Outdated
Comment thread test/test_van_den_bos.cpp Outdated
Comment thread include/boost/math/quadrature/van_den_bos.hpp Outdated
Comment thread include/boost/math/quadrature/van_den_bos.hpp Outdated
@NAThompson
NAThompson force-pushed the vandenbos_quadrature branch from 55e5690 to 7f20e15 Compare August 28, 2026 18:24
@JacobHass8

Copy link
Copy Markdown
Contributor

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

@mborland

Copy link
Copy Markdown
Member

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

Copy link
Copy Markdown
Contributor

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

Copy link
Copy Markdown
Collaborator Author

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.

@NAThompson
NAThompson force-pushed the vandenbos_quadrature branch 3 times, most recently from 13efc4f to 6ccfbc6 Compare August 29, 2026 16:29
@NAThompson

Copy link
Copy Markdown
Collaborator Author

@JacobHass8 , @mborland , @jzmaddock : The code is in a pretty good place I think. I had originally thought that maybe we could generate more nodes/weights at runtime if we hadn't achieved convergence, but it's a big dense "find a nullspace" problem that really cannot be done online.

So this method is great for (say) assembling a stiffness matrix in a finite element calculation, but can't be used for (say) David H Bailey-style high precision quadrature.

@NAThompson
NAThompson force-pushed the vandenbos_quadrature branch from 6ccfbc6 to 9b8643f Compare August 29, 2026 21:31
@NAThompson
NAThompson force-pushed the vandenbos_quadrature branch 2 times, most recently from 9c9ef6b to 8512178 Compare August 30, 2026 02:56
@NAThompson
NAThompson force-pushed the vandenbos_quadrature branch from 8512178 to 7f947d7 Compare August 30, 2026 03:14
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants