Abstract
We present a systematic method of approximating, to an arbitrary accuracy, a probability measure µ on x = [0,1]q, q 1, with invariant measures for iterated function systems by matching its moments. There are two novel features in our treatment. 1. An infinite set of fixed affine contraction maps on , w2, · ·· }, subject to an ‘ϵ-contractivity' condition, is employed. Thus, only an optimization over the associated probabilities pi is required. 2. We prove a collage theorem for moments which reduces the moment matching problem to that of minimizing the collage distance between moment vectors. The minimization procedure is a standard quadratic programming problem in the pi which can be solved in a finite number of steps. Some numerical calculations for the approximation of measures on [0, 1] are presented.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献