A space quantization method for numerical integration
type: Item
instance of: scholarly article
title: A space quantization method for numerical integration
zbMATH Open document ID: 0908.65012
DOI: 10.1016/S0377-0427(97)00190-8
author: Gilles Pagès
published in: Journal of Computational and Applied Mathematics
publication date: 1998-07-28T00:00:00Z
review text: The aim of this paper is to propose and to investigate a new method, called space quantization method, for multidimensional numerical integration based on a space quantization and requiring a stochastic optimization. Numerical examples are given. The paper contains a bibliography including 36 references from the most significant works in this domain.
Mathematics Subject Classification ID: 65D32
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 94A34
zbMATH DE Number: 1180781
zbMATH Keywords: cubature formulas
zbMATH Keywords: Monte Carlo methods
zbMATH Keywords: rate-distortion theory
zbMATH Keywords: numerical examples
zbMATH Keywords: space quantization method
zbMATH Keywords: multidimensional numerical integration
zbMATH Keywords: stochastic optimization
reviewed by: Dumitru Acu
MaRDI profile type: Publication
cites work: Q4810596
cites work: Convergence of the one-dimensional Kohonen algorithm
cites work: Q3780804
cites work: Self-organization and a.s. convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuli
cites work: About the multidimensional competitive learning vector quantization algorithm with constant gain
cites work: Do stochastic algorithms avoid traps?
cites work: Multidimensional asymptotic quantization theory with&lt;tex&gt;r&lt;/tex&gt;th power distortion measures
cites work: Étude d'un processus d'auto-organisation. (Study of a self-organization process)
cites work: Q4331760
cites work: On the a.s. convergence of the Kohonen algorithm with a general neighborhood function
cites work: Convergence of stochastic algorithms: from the Kushner–Clark theorem to the Lyapounov functional method
cites work: Asymptotically optimal block quantization
cites work: Q4271995
cites work: Exponential rate of convergence for Lloyd's method I
cites work: Self-organization and associative memory
cites work: Q4767350
cites work: Stochastic approximation methods for constrained and unconstrained systems
cites work: Q3831101
cites work: Sequences with low discrepancy generalisation and application to bobbins-monbo algorithm
cites work: Convergence of stochastic-approximation procedures in the case of regression equation with several roots
cites work: Q4003879
cites work: Van der Corput sequences, Kakutani transforms and one-dimensional numerical integration
cites work: Q4158394
cites work: Q3997570
cites work: Global convergence and empirical consistency of the generalized Lloyd algorithm
cites work: Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions
cites work: On the design of an optimal quantizer
cites work: Asymptotic quantization error of continuous signals and the quantization dimension
full work available at URL: s0377-0427(97)00190-8
OpenAlex ID: W2042436556
description: scientific article; zbMATH DE number 1180781