Displaying similar documents to “On limiting directions of Julia sets.”

An application of the Fourier transform to optimization of continuous 2-D systems

Vitali Dymkou, Michael Dymkov (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper uses the theory of entire functions to study the linear quadratic optimization problem for a class of continuous 2D systems. We show that in some cases optimal control can be given by an analytical formula. A simple method is also proposed to find an approximate solution with preassigned accuracy. Some application to the 1D optimization problem is presented, too. The obtained results form a theoretical background for the design problem of optimal controllers for relevant processes. ...

Large dimensional sets not containing a given angle

Viktor Harangi (2011)

Open Mathematics

Similarity:

We say that a set in a Euclidean space does not contain an angle α if the angle determined by any three points of the set is not equal to α. The goal of this paper is to construct compact sets of large Hausdorff dimension that do not contain a given angle α ∈ (0,π). We will construct such sets in ℝn of Hausdorff dimension c(α)n with a positive c(α) depending only on α provided that α is different from π/3, π/2 and 2π/3. This improves on an earlier construction (due to several authors)...

Uniformly convex functions II

Wancang Ma, David Minda (1993)

Annales Polonici Mathematici

Similarity:

Recently, A. W. Goodman introduced the class UCV of normalized uniformly convex functions. We present some sharp coefficient bounds for functions f(z) = z + a₂z² + a₃z³ + ... ∈ UCV and their inverses f - 1 ( w ) = w + d w ² + d w ³ + . . . . The series expansion for f - 1 ( w ) converges when | w | < ϱ f , where 0 < ϱ f depends on f. The sharp bounds on | a n | and all extremal functions were known for n = 2 and 3; the extremal functions consist of a certain function k ∈ UCV and its rotations. We obtain the sharp bounds on | a n | and all extremal functions for...