Charles Beall: A randomized Greedy algorithm with certification over the entire parameter set скачать в хорошем качестве

Charles Beall: A randomized Greedy algorithm with certification over the entire parameter set

We introduce a randomized Greedy algorithm that can be employed to construct and certify local approximation spaces for linear and nonlinear multiscale PDEs. The algorithm draws random samples of local problem data (such as boundary conditions, source functions, or PDE coefficients) from a clever probability distribution to effectively build a training set at each iteration. We prove that this algorithm provides certification with high probability over the entire parameter set, utilizing results from sampling discretization theory and concentration of measure phenomena. Moreover, we demonstrate favorable properties of the algorithm’s sampling complexity which may break the curse of dimensionality encountered by e.g. the deterministic Greedy algorithm when choosing a suitable training set. We present numerical results of the algorithm’s performance at building reduced approximation spaces for benchmark PDE problems, and finally investigate the algorithm’s construction of local approximation spaces for solutions to the p-Laplace equation, a nonlinear PDE, by sampling local boundary conditions.