Filtern
Erscheinungsjahr
Dokumenttyp
- Wissenschaftlicher Artikel (958)
- Preprint (363)
- Monographie/Sammelband (353)
- Dissertation (126)
- Postprint (28)
- Sonstiges (25)
- Rezension (12)
- Konferenzveröffentlichung (7)
- Masterarbeit (3)
- Teil eines Buches (Kapitel) (1)
Sprache
- Englisch (1876) (entfernen)
Schlagworte
- random point processes (19)
- statistical mechanics (19)
- stochastic analysis (19)
- index (14)
- Fredholm property (12)
- boundary value problems (12)
- cluster expansion (10)
- data assimilation (10)
- regularization (10)
- elliptic operators (9)
Institut
- Institut für Mathematik (1876) (entfernen)
The paper is devoted to pseudodifferential boundary value problems in domains with singular points on the boundary. The tangent cone at a singular point is allowed to degenerate. In particular, the boundary may rotate and oscillate in a neighbourhood of such a point. We show a criterion for the Fredholm property of a boundary value problem and derive estimates of solutions close to singular points.
In 1914 Bohr proved that there is an r ∈ (0, 1) such that if a power series converges in the unit disk and its sum has modulus less than 1 then, for |z| < r, the sum of absolute values of its terms is again less than 1. Recently analogous results were obtained for functions of several variables. The aim of this paper is to comprehend the theorem of Bohr in the context of solutions to second order elliptic equations meeting the maximum principle.
The estimation of a log-concave density on R is a canonical problem in the area of shape-constrained nonparametric inference. We present a Bayesian nonparametric approach to this problem based on an exponentiated Dirichlet process mixture prior and show that the posterior distribution converges to the log-concave truth at the (near-) minimax rate in Hellinger distance. Our proof proceeds by establishing a general contraction result based on the log-concave maximum likelihood estimator that prevents the need for further metric entropy calculations. We further present computationally more feasible approximations and both an empirical and hierarchical Bayes approach. All priors are illustrated numerically via simulations.
This paper reports on the historical development of the Runge-Kutta methods beginning with the simple Euler method up to an embedded 13-stage method. Moreover, the design and the use of those methods under error order, stability and computation time conditions is edited for students of numerical analysis at undergraduate level. The second part presents applications in natural sciences, compares different methods and illustrates some of the difficulties of numerical solutions.