Numerical Integration in Multiple Dimensions with Designed Quadrature

DOI10.1137/17M1137875zbMath1471.65020arXiv1804.06501MaRDI QIDQ3174765

Robert M. Kirby, Akil C. Narayan, Vahid Keshavarzzadeh

Publication date: 18 July 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.06501

zbMATH Keywords

numerical integrationpolynomial approximationmultiple dimensionsquadrature optimization

Mathematics Subject Classification ID

Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)

Related Items (21)

Tensors in computations ⋮ Statistical models of near-accident event and pedestrian behavior at non-signalized intersections ⋮ Stable high-order cubature formulas for experimental data ⋮ Efficient numerical evaluation of thermodynamic quantities on infinite (semi-)classical chains ⋮ Polynomial chaos expansions for dependent random variables ⋮ Robust topology optimization with low rank approximation using artificial neural networks ⋮ Multivariate quadrature rules on crosslet sparse grids ⋮ Stress-based topology optimization under uncertainty via simulation-based Gaussian process ⋮ Multifidelity uncertainty quantification with models based on dissimilar parameters ⋮ Approximate integrals over bounded volumes with smooth boundaries ⋮ A node elimination algorithm for cubature of high-dimensional polytopes ⋮ An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions ⋮ An efficient solver for cumulative density function-based solutions of uncertain kinematic wave models ⋮ Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids ⋮ Generation and application of multivariate polynomial quadrature rules ⋮ Hybrid topology/shape optimization under uncertainty for actively-cooled nature-inspired microvascular composites ⋮ Generating Nested Quadrature Rules with Positive Weights based on Arbitrary Sample Sets ⋮ Convergence Acceleration for Time-Dependent Parametric Multifidelity Models ⋮ Multilevel Designed Quadrature for Partial Differential Equations with Random Inputs ⋮ Direct reconstruction method for discontinuous Galerkin methods on higher-order mixed-curved meshes. II: Surface integration ⋮ Variational inference for nonlinear inverse problems via neural net kernels: comparison to Bayesian neural networks, application to topology optimization

Uses Software

• SPGL1
• nwSpGr

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Likelihood approximation by numerical integration on sparse grids
• Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
• Adaptive sparse grid algorithms with applications to electromagnetic scattering under uncertainty
• Sparse pseudospectral approximation method
• A domain adaptive stochastic collocation approach for analysis of MEMS under uncertainties
• Bivariate Lagrange interpolation at the Padua points: the generating curve approach
• Extensions of Gauss quadrature via linear programming
• Linear and nonlinear programming.
• Numerical integration formulas of degree two
• A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• Numerical integration using sparse grids
• Explicit cost bounds of algorithms for multivariate tensor product problems
• Techniques of scientific computing (Part 2)
• Multivariate quadrature on adaptive sparse grids
• Bivariate polynomial interpolation on the square at new nodal sets
• Topology optimization under uncertainty via non-intrusive polynomial chaos expansion
• Approximating optimal point configurations for multivariate polynomial interpolation
• Some fifth degree integration formulas for symmetric regions. II
• An Algorithm for Computing Fekete Points in the Triangle
• A Christoffel function weighted least squares algorithm for collocation approximations
• Sparse Optimization with Least-Squares Constraints
• Remarks on the Disposition of Points in Numerical Integration Formulas
• Numerical Integration Formulas of Degree Two
• Probing the Pareto Frontier for Basis Pursuit Solutions
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
• A Characterization of Positive Quadrature Formulae
• Generalized Gaussian Quadrature Rules for Systems of Arbitrary Functions
• Adaptive Leja Sparse Grid Constructions for Stochastic Collocation and High-Dimensional Approximation
• Sparse grids
• Spectral Methods
• Generalized Gaussian quadrature rules on arbitrary polygons
• A Cardinal Function Algorithm for Computing Multivariate Quadrature Points
• Spectral Methods
• High-Order Collocation Methods for Differential Equations with Random Inputs
• The Optimum Addition of Points to Quadrature Formulae
• Calculation of Gauss Quadrature Rules
• Construction of Gauss-Christoffel Quadrature Formulas
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

This page was built for publication: Numerical Integration in Multiple Dimensions with Designed Quadrature