Connections on some functional bundles
Convergence Rates of the POD–Greedy Method
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...
Curves with finite turn
In this paper we study the notions of finite turn of a curve and finite turn of tangents of a curve. We generalize the theory (previously developed by Alexandrov, Pogorelov, and Reshetnyak) of angular turn in Euclidean spaces to curves with values in arbitrary Banach spaces. In particular, we manage to prove the equality of angular turn and angular turn of tangents in Hilbert spaces. One of the implications was only proved in the finite dimensional context previously, and equivalence of finiteness...