We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.
We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.
We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.
Two groups of 10 speech-language pathology graduate students were each given 7 weeks of singing lessons to determine whether voice lessons could have an effect on their clinical and perceptual skills. Pre-, mid-, and posttests to measure various skills were designed and implemented. With use of paired sample statistical testing, statistically significant results were obtained. In addition, the subjective responses of the students show that the lessons were effective in improving pitch perception, breath control, and legato production or easy onset. This study supports efforts to integrate curricula in vocal performance and speech-language pathology. 相似文献
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
Summary We study the integration theory for general integral metrics when restricted to upper integrals q, finding improvements in the relation between the classes of the q-integrable and the ql-integrable functions. We give new results and notions which lead to the desirable characterizations of q-integrable functions as ql-integrable f with q(|f|) < ∞, and of ql-integrable functions via the integrability of their upper truncations, under natural conditions which are fulfilled in most
finitely additive integration theories. 相似文献
Some authors claim that reporting the best result obtained by a stochastic algorithm in a number of runs is more meaningful
than reporting some central statistic. In this short note, we analyze and refute the main argument brought in favor of this
statement. 相似文献