On a refinement of a theorem of Landau on Koebe domains

We state and prove a refinement of a classical theorem due to Landau on the Koebe domains for certain families of holomorphic functions introduced by A. W. Goodman. Our geometric approach in this article enables us to derive several statements of interest, which would not be produced via the methods in Goodman's paper, as immediate corollaries of the proof of the main theorem.     

Isometries of the Half-Apollonian Metric

The half-Apollonian metric is a generalization of the hyperbolic metric, similar to the Apollonian metric. It can be defined in arbitrary domains in the euclidean space and has the advantages of being easy to calculate and estimate. We show that the half-Apollonian metric has many geodesics and use this fact to show that in most domains all the isometries of the metric are similarity mappings.     

On the Wu metric in unbounded domains

We discuss the properties of the Wu pseudometric and present counterexamples for its upper semicontinuity that answers the question posed by Jarnicki and Pflug. We also give formulae for the Wu pseudometric in elementary Reinhardt domains. Received: 12 September 2007     

On functions convex in the direction of the real axis with a fixed second coefficient

In the paper we consider the class Γ of analytic and univalent functions f in the unit disk Δ, normalized by f(0) = f′(0) − 1 = 0, having real coefficients and such that f(Δ) is convex in the direction of the real axis. We are especially interested in some subclasses of Γ. The most important of them is Γ(c) consisting of those functions which have the second coefficients of the Taylor expansion fixed and equal to c. We obtain the Koebe set for this class as well as for the classes Γ⁺(c) and Γ⁻(c) of functions which are in some sense convex in the direction of positive and negative axes respectively.     

Remarks on Lempert functions of balanced domains

This note should clarify how the behavior of certain invariant objects reflects the geometric convexity of balanced domains. Authors’ addresses: Nikolai Nikolov, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev 8, 1113 Sofia, Bulgaria; Peter Pflug, Carl von Ossietzky Universit?t Oldenburg, Institut für Mathematik, Fakult?t V, Postfach 2503, D-26111 Oldenburg, Germany     

Compact,convex sets in R n and a new banach lattice. II.- Application: An approximation problem.

We develop a calculus structure in the Banach lattice introduced in a preceding paper, having in mind an approximation problem appearing in non-smooth optimization. We show that the essential results depend as much on the order structure as on the analytical one.     

Travelling wavefronts of reaction-diffusion equations in cylindrical domains

Abstract

Function spaces with asymptotics is a usual tool in the analysis on manifolds with singularities. The asymptotics are singular ingredients of the kernels of pseudodifferential operators in the calculus. They correspond to potentials supported by the singularities of the manifold, and in this form asymptotics can be treated already on smooth configurations. This article is aimed at describing refined asymtotics in the Dirichlet problem in a ball. The beauty of explicit formulas actually highlights the structure of asymptotic expansions in the calculi on singular varieties.     

A continuous selection of the metric projection in matrix spaces,addendum

Summary In an earlier paper [1] the authors proved that the metric projection of the space ofm byn matrices onto the subset of matrices of rank less than or equal tok has a continuous selection. In this note we sharpen the result to show that the selection is in fact globally Lipschitz-continuous.Dedicated to R. S. Varga on the occasion to his sixtieth birthday     

Convergence of the infinite element methods for the Helmholtz equation in separable domains

To the best knowledge of the authors, this work presents the first convergence analysis for the Infinite Element Method (IEM) for the Helmholtz equation in exterior domains. The approximation applies to separable geometries only, combining an arbitrary Finite Element (FE) discretization on the boundary of the domain with a spectral-like approximation in the “radial” direction, with shape functions resulting from the separation of variables. The principal idea of the presented analysis is based on the spectral decomposition of the problem. Received February 10, 1996 / Revised version received February 17, 1997     

Weighted regularization of Maxwell equations in polyhedral domains

Summary. We present a new method of regularizing time harmonic Maxwell equations by a {\bf grad}-div term adapted to the geometry of the domain. This method applies to polygonal domains in two dimensions as well as to polyhedral domains in three dimensions. In the presence of reentrant corners or edges, the usual regularization is known to produce wrong solutions due the non-density of smooth fields in the variational space. We get rid of this undesirable effect by the introduction of special weights inside the divergence integral. Standard finite elements can then be used for the approximation of the solution. This method proves to be numerically efficient. Received April 27, 2001 / Revised version received September 13, 2001 / Published online March 8, 2002     

A family of variable metric proximal methods

We consider conceptual optimization methods combining two ideas: the Moreau—Yosida regularization in convex analysis, and quasi-Newton approximations of smooth functions. We outline several approaches based on this combination, and establish their global convergence. Then we study theoretically the local convergence properties of one of these approaches, which uses quasi-Newton updates of the objective function itself. Also, we obtain a globally and superlinearly convergent BFGS proximal method. At each step of our study, we single out the assumptions that are useful to derive the result concerned.     

Geodesics for the capacity metric in doubly connected domains

We give the qualitative behavior of geodesics of the capacity metric defined on the annulus and study the variation of its Gaussian curvature. We make explicit the relation between the capacities, the Bergman kernel and the reduced Bergman kernel on doubly connected domains and give some applications.     

On local behaviour of the phase separation line in the 2D Ising model

Summary. The aim of this note is to discuss some statistical properties of the phase separation line in the 2D low-temperature Ising model. We prove the functional central limit theorem for the probability distributions describing fluctuations of the phase boundary in the direction orthogonal to its orientation. The limiting Gaussian measure corresponds to a scaled Brownian bridge with direction dependent parameters. Up to the temperature factor, the variances of local increments of this limiting process are inversely proportional to the stiffness. Received: 6 June 1997/In revised form: 20 August 1997     

The Existence of Good Extensible Polynomial Lattice Rules

Extensible (polynomial) lattice rules have been introduced recently and they are convenient tools for quasi-Monte Carlo integration. It is shown in this paper that for suitable infinite families of polynomial moduli there exist generating parameters for extensible rank-1 polynomial lattice rules such that for all these infinitely many moduli and all dimensions s the quantity R ^(s) and the star discrepancy are small. The case of Korobov-type polynomial lattice rules is also considered.Received April 30, 2002; in revised form August 21, 2002 Published online April 4, 2003     

On the orthogonality of residual polynomials\newline of minimax polynomial preconditioning

Summary. This paper studies polynomials used in polynomial preconditioning for solving linear systems of equations. Optimum preconditioning polynomials are obtained by solving some constrained minimax approximation problems. The resulting residual polynomials are referred to as the de Boor-Rice and Grcar polynomials. It will be shown in this paper that the de Boor-Rice and Grcar polynomials are orthogonal polynomials over several intervals. More specifically, each de Boor-Rice or Grcar polynomial belongs to an orthogonal family, but the orthogonal family varies with the polynomial. This orthogonality property is important, because it enables one to generate the minimax preconditioning polynomials by three-term recursive relations. Some results on the convergence properties of certain preconditioning polynomials are also presented. Received February 1, 1992/Revised version received July 7, 1993     

On the abstract theory of additive and multiplicative Schwarz algorithms

Summary. In recent years, it has been shown that many modern iterative algorithms (multigrid schemes, multilevel preconditioners, domain decomposition methods etc.) for solving problems resulting from the discretization of PDEs can be interpreted as additive (Jacobi-like) or multiplicative (Gauss-Seidel-like) subspace correction methods. The key to their analysis is the study of certain metric properties of the underlying splitting of the discretization space into a sum of subspaces and the splitting of the variational problem on into auxiliary problems on these subspaces. In this paper, we propose a modification of the abstract convergence theory of the additive and multiplicative Schwarz methods, that makes the relation to traditional iteration methods more explicit. The analysis of the additive and multiplicative Schwarz iterations can be carried out in almost the same spirit as in the traditional block-matrix situation, making convergence proofs of multilevel and domain decomposition methods clearer, or, at least, more classical. In addition, we present a new bound for the convergence rate of the appropriately scaled multiplicative Schwarz method directly in terms of the condition number of the corresponding additive Schwarz operator. These results may be viewed as an appendix to the recent surveys [X], [Ys]. Received February 1, 1994 / Revised version received August 1, 1994     

Minimal length of two intersecting simple closed geodesics

On a hyperbolic Riemann surface, given two simple closed geodesics that intersect n times, we address the question of a sharp lower bound L _n on the length attained by the longest of the two geodesics. We show the existence of a surface S _n on which there exists two simple closed geodesics of length L _n intersecting n times and explicitly find L _n for . The first author was supported in part by SNFS grant number 2100-065270, the second author was supported by SNFS grant number PBEL2-106180.     

Inner Radius of Univalence for a Strongly Starlike Domain

 The inner radius of univalence of a domain D with Poincaré density ρ _D is the possible largest number σ such that the condition ∥ S _f ∥ _D  = sup _{w∈ D} ρ _D (w) ⁻²∥ S _f (z) ∥ ≤ σ implies univalence of f for a nonconstant meromorphic function f on D, where S _f is the Schwarzian derivative of f. In this note, we give a lower bound of the inner radius of univalence for strongly starlike domains of order α in terms of the order α. The author was partially supported by the Ministry of Education, Grant-in-Aid for Encouragement of Young Scientists, 11740088. A part of this work was carried out during his visit to the University of Helsinki under the exchange programme of scientists between the Academy of Finland and the JSPS. Received November 26, 2001; in revised form September 24, 2002 Published online May 9, 2003     

On the regularizing properties of the GMRES method

Summary. The GMRES method is a popular iterative method for the solution of large linear systems of equations with a nonsymmetric nonsingular matrix. However, little is known about the behavior of this method when it is applied to the solution of nonsymmetric linear ill-posed problems with a right-hand side that is contaminated by errors. We show that when the associated error-free right-hand side lies in a finite-dimensional Krylov subspace, the GMRES method is a regularization method. The iterations are terminated by a stopping rule based on the discrepancy principle. Received November 10, 2000 / Revised version received April 11, 2001 / Published online October 17, 2001