Extensions of Gauss quadrature via linear programming
From MaRDI portal
Publication:896553
DOI10.1007/s10208-014-9197-9zbMath1327.65049OpenAlexW2095886698MaRDI QIDQ896553
Ernest K. Ryu, Stephen P. Boyd
Publication date: 10 December 2015
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-014-9197-9
Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Numerical quadrature and cubature formulas (65D32)
Related Items
Learning to differentiate, Stable high-order cubature formulas for experimental data, Sparse data-driven quadrature rules via \(\ell^p\)-quasi-norm minimization, Numerical Integration in Multiple Dimensions with Designed Quadrature, An LP empirical quadrature procedure for parametrized functions, Quadrature-based polynomial optimization, Optimization approaches to quadrature: new characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions, A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis, Generation and application of multivariate polynomial quadrature rules, An LP empirical quadrature procedure for reduced basis treatment of parametrized nonlinear PDEs, Numerical integration of discontinuous functions: moment fitting and smart octree, Fast sampling from \(\beta \)-ensembles, Generating Nested Quadrature Rules with Positive Weights based on Arbitrary Sample Sets, Monte Carlo cubature construction, Discontinuous Galerkin reduced basis empirical quadrature procedure for model reduction of parametrized nonlinear conservation laws, Stable high-order randomized cubature formulae in arbitrary dimension, Gaussian Quadrature and Polynomial Approximation for One-Dimensional Ridge Functions, PI-type fully symmetric quadrature rules on the 3-, \dots, 6-simplexes, Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere, Unnamed Item, On the Computation of Gaussian Quadrature Rules for Chebyshev Sets of Linearly Independent Functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear and nonlinear programming.
- A numerical algorithm for the construction of efficient quadrature rules in two and higher dimensions
- Infinite programming. Proceedings of an International Symposium on Infinite Dimensional Linear Programming, Churchill College, Cambridge, United Kingdom, September 7-10, 1984
- Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
- Global Optimization with Polynomials and the Problem of Moments
- Numerical Integration over the Planar Annulus
- The ideas of P. L. Čebyšev and A. A. Markov in the theory of limiting values of integrals and their further development
- Numerical Evaluation of Multiple Integrals II
- QUADRATURE METHODS FOR FUNCTIONS OF MORE THAN ONE VARIABLE
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Some NP-complete problems in quadratic and nonlinear programming
- Atomic Decomposition by Basis Pursuit
- An Introduction to Numerical Analysis
- Generalized Gaussian Quadrature Rules for Systems of Arbitrary Functions
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- Spectra of Multiplication Operators as a Numerical Tool
- Calculation of Gauss Quadrature Rules
- A Construction of Nonnegative Approximate Quadratures
