Numerical integration in multiple dimensions with designed quadrature
From MaRDI portal
Publication:3174765
Abstract: We present a systematic computational framework for generating positive quadrature rules in multiple dimensions on general geometries. A direct moment-matching formulation that enforces exact integration on polynomial subspaces yields nonlinear conditions and geometric constraints on nodes and weights. We use penalty methods to address the geometric constraints, and subsequently solve a quadratic minimization problem via the Gauss-Newton method. Our analysis provides guidance on requisite sizes of quadrature rules for a given polynomial subspace, and furnishes useful user-end stability bounds on error in the quadrature rule in the case when the polynomial moment conditions are violated by a small amount due to, e.g., finite precision limitations or stagnation of the optimization procedure. We present several numerical examples investigating optimal low-degree quadrature rules, Lebesgue constants, and 100-dimensional quadrature. Our capstone examples compare our quadrature approach to popular alternatives, such as sparse grids and quasi-Monte Carlo methods, for problems in linear elasticity and topology optimization.
Recommendations
- Generation and application of multivariate polynomial quadrature rules
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- Multivariate quadrature rules on crosslet sparse grids
- Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids
- Generalized Gaussian quadrature rules on arbitrary polygons
Cites work
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 3591295 (Why is no real title available?)
- scientific article; zbMATH DE number 1821102 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Cardinal Function Algorithm for Computing Multivariate Quadrature Points
- A Characterization of Positive Quadrature Formulae
- A Christoffel function weighted least squares algorithm for collocation approximations
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- A domain adaptive stochastic collocation approach for analysis of MEMS under uncertainties
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- A survey of weighted polynomial approximation with exponential weights
- Adaptive Leja sparse grid constructions for stochastic collocation and high-dimensional approximation
- Adaptive sparse grid algorithms with applications to electromagnetic scattering under uncertainty
- An algorithm for computing Fekete points in the triangle
- Approximating optimal point configurations for multivariate polynomial interpolation
- Bivariate Lagrange interpolation at the Padua points: the generating curve approach
- Bivariate polynomial interpolation on the square at new nodal sets
- Calculation of Gauss Quadrature Rules
- Construction of Gauss-Christoffel Quadrature Formulas
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Extensions of Gauss quadrature via linear programming
- Generalized Gaussian Quadrature Rules for Systems of Arbitrary Functions
- Generalized Gaussian quadrature rules on arbitrary polygons
- High-Order Collocation Methods for Differential Equations with Random Inputs
- Likelihood approximation by numerical integration on sparse grids
- Linear and nonlinear programming.
- Multivariate quadrature on adaptive sparse grids
- Numerical Integration Formulas of Degree Two
- Numerical integration formulas of degree two
- Numerical integration using sparse grids
- Probing the Pareto frontier for basis pursuit solutions
- Remarks on the Disposition of Points in Numerical Integration Formulas
- Some fifth degree integration formulas for symmetric regions. II
- Sparse Optimization with Least-Squares Constraints
- Sparse grids
- Sparse pseudospectral approximation method
- Spectral Methods
- Spectral Methods
- Techniques of scientific computing (Part 2)
- The Optimum Addition of Points to Quadrature Formulae
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Topology optimization under uncertainty via non-intrusive polynomial chaos expansion
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Cited in
(27)- Robust topology optimization with low rank approximation using artificial neural networks
- Approximate integrals over bounded volumes with smooth boundaries
- Parametric topology optimization with multiresolution finite element models
- Generation and application of multivariate polynomial quadrature rules
- Efficient numerical evaluation of thermodynamic quantities on infinite (semi-)classical chains
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- Efficient quadratures for high-dimensional Bayesian data assimilation
- Multidimensional numerical integration using pseudorandom numbers
- Direct reconstruction method for discontinuous Galerkin methods on higher-order mixed-curved meshes. II: Surface integration
- Statistical models of near-accident event and pedestrian behavior at non-signalized intersections
- Tensors in computations
- scientific article; zbMATH DE number 2219472 (Why is no real title available?)
- Stable high-order cubature formulas for experimental data
- Variational inference for nonlinear inverse problems via neural net kernels: comparison to Bayesian neural networks, application to topology optimization
- Stress-based topology optimization under uncertainty via simulation-based Gaussian process
- Hybrid topology/shape optimization under uncertainty for actively-cooled nature-inspired microvascular composites
- Generation of nested quadrature rules for generic weight functions via numerical optimization: application to sparse grids
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions
- scientific article; zbMATH DE number 1398923 (Why is no real title available?)
- Convergence Acceleration for Time-Dependent Parametric Multifidelity Models
- Polynomial chaos expansions for dependent random variables
- A node elimination algorithm for cubature of high-dimensional polytopes
- Multilevel Designed Quadrature for Partial Differential Equations with Random Inputs
- Generating nested quadrature rules with positive weights based on arbitrary sample sets
- Multivariate quadrature rules on crosslet sparse grids
- An efficient solver for cumulative density function-based solutions of uncertain kinematic wave models
- Multifidelity uncertainty quantification with models based on dissimilar parameters
This page was built for publication: Numerical integration in multiple dimensions with designed quadrature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174765)
