Previous Page 2

Displaying 21 – 28 of 28

Showing per page

Convergence Rates of the POD–Greedy Method

Bernard Haasdonk (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so-called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, a priori convergence rate statements for this algorithm have been given (Buffa et al. 2009, Binev et al. 2010). The goal of the current study is the extension to time-dependent problems, which are typically approximated using the POD–Greedy...

Convergenza per l'equazione degli integrali primi associata al problema del rimbalzo

Michele Carriero, Antonio Leaci, Eduardo Pascali (1982)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

In this paper we present a few results on convergence for the prime integrals equations connected with the bounce problem. This approach allows both to prove uniqueness for the one-dimensional bounce problem for almost all permissible Cauchy data (see also [6]) and to deepen previous results (see [3], [5], [7]).

Currently displaying 21 – 28 of 28

Previous Page 2