Billiards, scattering by rough obstacles, and optimal mass transportation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Billiards, scattering by rough obstacles and optimal mass transportation

This article presents a brief exposition of recent results of the author on billiard scattering by rough obstacles. We define the notion of a rough body and give a characterization of scattering by rough bodies. Then we define the resistance of a rough body; it can be interpreted as the aerodynamic resistance of the somersaulting body moving through a rarefied medium. We solve the problems of m...

متن کامل

Optimal mass transportation and Mather theory

We study the Monge transportation problem when the cost is the action associated to a Lagrangian function on a compact manifold. We show that the transportation can be interpolated by a Lipschitz lamination. We describe several direct variational problems the minimizers of which are these Lipschitz laminations. We prove the existence of an optimal transport map when the transported measure is a...

متن کامل

Acoustic Scattering by Inhomogeneous Obstacles

Acoustic scattering problems are considered when the material parameters (density and speed of sound) are functions of position within a bounded region. An integro-differential equation for the pressure in this region is obtained. It is proved that solving this equation is equivalent to solving the scattering problem. Problems of this kind are often solved by regarding the effects of the inhomo...

متن کامل

Optimal networks by mass transportation via points allocation

It is shown that optimal network plans can be obtain, naturally, as a limit of easier problems of points allocations. These point allocation problem are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of atoms, each can be solved by linear programming.

متن کامل

Optimal networks by mass transportation via point allocation

It is shown that optimal network plans can be obtained, naturally, as a limit of easier problems of point allocations. These problems are obtained by minimizing the mass transportation on the set of atomic measures of prescribed number of atoms. Each of these problems can be solved by minimizing a function of a finite, prescribed number of variables.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Sciences

سال: 2012

ISSN: 1072-3374,1573-8795

DOI: 10.1007/s10958-012-0744-0