The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On radially symmetric solutions of some chemotaxis system”

Existence and asymptotics of solutions of the Debye-Nernst-Planck system in ℝ²

Agnieszka Herczak, Michał Olech (2009)

Banach Center Publications

Similarity:

We investigate a system describing electrically charged particles in the whole space ℝ². Our main goal is to describe large time behavior of solutions which start their evolution from initial data of small size. This is achieved using radially symmetric self-similar solutions.

Self-similarity in chemotaxis systems

Yūki Naito, Takashi Suzuki (2008)

Colloquium Mathematicae

Similarity:

We consider a system which describes the scaling limit of several chemotaxis systems. We focus on self-similarity, and review some recent results on forward and backward self-similar solutions to the system.

On Tucker's key theorem.

Berman, Abraham, Tarsy, Michael (1978)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The Lukacs-Olkin-Rubin theorem on symmetric cones through Gleason's theorem

Bartosz Kołodziejek (2013)

Studia Mathematica

Similarity:

We prove the Lukacs characterization of the Wishart distribution on non-octonion symmetric cones of rank greater than 2. We weaken the smoothness assumptions in the version of the Lukacs theorem of [Bobecka-Wesołowski, Studia Math. 152 (2002), 147-160]. The main tool is a new solution of the Olkin-Baker functional equation on symmetric cones, under the assumption of continuity of respective functions. It was possible thanks to the use of Gleason's theorem.

On Farkas-type theorems

Winfried Schirotzek (1981)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Numerical behavior of the method of projection onto an acute cone with level control in convex minimization

Robert Dylewski (2000)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

Similarity:

We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski [1]. The method is a modification of the Polyak subgradient projection method [6] and of variable target value subgradient method of Kim, Ahn and Cho [2]. In each iteration of the method an obtuse cone is constructed. The obtuse cone is generated by a linearly independent system of subgradients. The next approximation of a solution is the projection onto a translated...