Previous Page 2

Displaying 21 – 26 of 26

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...

Covariantization of quantized calculi over quantum groups

Seyed Ebrahim Akrami, Shervin Farzi (2020)

Mathematica Bohemica

We introduce a method for construction of a covariant differential calculus over a Hopf algebra A from a quantized calculus d a = [ D , a ] , a A , where D is a candidate for a Dirac operator for A . We recover the method of construction of a bicovariant differential calculus given by T. Brzeziński and S. Majid created from a central element of the dual Hopf algebra A . We apply this method to the Dirac operator for the quantum SL ( 2 ) given by S. Majid. We find that the differential calculus obtained by our method is the...

Curves with finite turn

Jakub Duda (2008)

Czechoslovak Mathematical Journal

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...

Currently displaying 21 – 26 of 26

Previous Page 2