𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On harnack type inequalities and their application to quasilinear elliptic equations

✍ Scribed by Neil S. Trudinger


Publisher
John Wiley and Sons
Year
1967
Tongue
English
Weight
987 KB
Volume
20
Category
Article
ISSN
0010-3640

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Double Fourier Series on a Sphere: Appli
✍ Hyeong-Bin Cheong πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 197 KB

The solution of elliptic and vorticity equations on a sphere is studied using double Fourier series as orthogonal basis functions. The basis functions incorporate sine series weighted by cosine latitude as meridional basis functions for even zonal wavenumbers other than zero to meet the pole conditi

On Iterations of Non–Negative Operators
✍ Alexander Shlapunov πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 172 KB

H 0 and one can use the Neumann series ∞ ν=0 (I -L L) ν L f in order to study solvability of the operator equation Lu = f . In particular, applying this method to the ill -posed Cauchy problem for solutions to an elliptic system P u = 0 of linear PDE's of order p with smooth coefficients we obtain

Interpolation inequality of logarithmic
✍ Toshitaka Matsumoto; Takayoshi Ogawa πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 193 KB

## Abstract An abstract version of Besov spaces is introduced by using the resolvent of nonnegative operators. Interpolation inequalities with respect to abstract Besov spaces and generalized Lorentz spaces are obtained. These inequalities provide a generalization of Sobolev inequalities of logarit

On tree types of competitive learning al
✍ Miin-Shen Yang; Kuo-Lung Wu; Karen Chia-Ren Lin; Hsiu-Chih Liu; Jiing-Feng Lirng πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 378 KB

This paper considers competitive learning networks using three types of hard, soft, and fuzzy learning schemes. The hard competitive learning algorithm is with the winner-take-all. The soft competition learning algorithm is with a stochastic relaxation technique using the Gibbs distribution as a dyn