Average case complexity of multivariate integration

From MaRDI portal
Revision as of 15:07, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3355138

DOI10.1090/S0273-0979-1991-15985-9zbMath0729.65010OpenAlexW2106149169MaRDI QIDQ3355138

Henryk Woźniakowski

Publication date: 1991

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-1991-15985-9




Related Items (46)

A constructive approach to strong tractability using quasi-Monte Carlo algorithmsOn tractability of path integration\(I\)-binomial scrambling of digital nets and sequencesPerspectives on information-based complexityIntegration and \(L_ 2\)-approximation: Average case setting with isotropic Wiener measure for smooth functionsScrambled net variance for integrals of smooth functionsEntropy, Randomization, Derandomization, and DiscrepancyQuasi-Monte Carlo Progressive Photon MappingThe Stolarsky principle and energy optimization on the sphereConstruction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancySufficient conditions for fast quasi-Monte Carlo convergenceCalcolo numerico: Tradizioni secolari e tecniche recentiThe exponent of discrepancy is at most 1.4778...Goodness-of-fit statistics, discrepancies and robust designsUnnamed ItemA survey of average case complexity for linear multivariate problemsEstimation of random fields by piecewise constant estimatorsGaussian limits for discrepancies. I: Asymptotic resultsWeighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spacesA generalized discrepancy and quadrature error boundComplexity of verification and computation for IBC problemsOn average complexity of global optimization problemsFunction approximation and integration on the Wiener space with noisy dataAverage case complexity of linear multivariate problems. II: ApplicationsLow discrepancy sequences in high dimensions: how well are their projections distributed?Average errors for zero finding: Lower boundsQuasi-Monte Carlo methods with applications in financeOn the \(L_2\)-discrepancy of the Sobol-Hammersley net in dimension 3A new insight into the consistency of the SPH interpolation formulaOn the exponent of discrepanciesIntegration and approximation of multivariate functions: average case complexity with isotropic Wiener measureNew averaging technique for approximating weighted integralsEfficient algorithms for computing the $L_2$-discrepancyThe exponent of discrepancy is at least 1. 0669Quantum field theory for discrepanciesQuantum field theory for discrepancies. II: \(1/N\) corrections using fermionsDiscrepancy-based error estimates for quasi-Monte Carlo. I: General formalismMultidimensional sampling for simulation and integration: Measures, discrepancies, and quasi-random numbersOn the necessity of low-effective dimensionRandomized Halton sequencesAverage case complexity of linear multivariate problemsThe asymptotic efficiency of randomized nets for quadratureCalculation of Discrepancy Measures and ApplicationsProof techniques in quasi-Monte Carlo theoryThe error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimensionFast convergence of quasi-Monte Carlo for a class of isotropic integrals




Cites Work




This page was built for publication: Average case complexity of multivariate integration