Search arXiv⌕ Search

arXiv · math/9709212

Nonlinear equations and weighted norm inequalities

Abstract

We study connections between the problem of the existence of positive solutions for certain nonlinear equations and weighted norm inequalities. In particular, we obtain explicit criteria for the solvability of the Dirichlet problem $$\aligned -& Δu = v \, u^q + w, \quad u \ge 0 \quad \text {on} \quad Ω, \\ &u = 0 \quad \text {on} \quad \partial Ω, \endaligned $$ on a regular domain $Ω$ in $\bold R^n$ in the ``superlinear case'' $q > 1$. The coefficients $v, w$ are arbitrary positive measurable functions (or measures) on $Ω$. We also consider more general nonlinear differential and integral equations, and study the spaces of coefficients and solutions naturally associated with these problems, as well as the corresponding capacities. Our characterizations of the existence of positive solutions take into account the interplay between $v$, $w$, and the corresponding Green's kernel. They are not only sufficient, but also necessary, and are established without any a priori regularity assumptions on $v$ and $w$; we also obtain sharp two-sided estimates of solutions up to the boundary. Some of our results are new even if $v \equiv 1$ and $Ω$ is a ball or half-space. The corresponding weighted norm inequalities are proved for integral operators with kernels satisfying a refined version of the so-called $3 G$-inequality by an elementary ``integration by parts'' argument. This also gives a new unified proof for some classical inequalities including the Carleson measure theorem for Poisson integrals and trace inequalities for Riesz potentials and Green potentials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nigel J. Kalton, Igor Emil Verbitsky. 1997-09-08. Nonlinear equations and weighted norm inequalities. https://arxiv.org/abs/math/9709212

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On a characterization of spaces satisfying open mapping and equivalent theorems

We study open-mapping, continuous-inverse and closed-graph properties for maps whose domain and range belong to the same class of Hausdorff topological vector spaces. Quotient and graph stability imply equivalence of these properties. In the locally convex setting, we characterize barrelled infra-Pták spaces and barrelled Pták spaces as largest classes determined by the closed-graph property, Banach test spaces and appropriate nearly-open image conditions.

math.FA↗

A family of matrix flows converging to normal matrices

The celebrated Antezana-Pujals-Stojanoff Theorem states that the iterated Aluthge transforms of an arbitrary matrix converge to a normal matrix. We introduce a family of matrix flows that share this convergence property by defining them through ordinary differential equations. The family includes a continuous analogue of the Aluthge transform, as well as a differential equation discussed by Haagerup in the context of II$_1$ factors. We also examine the same type of flows in the setting of Hilbert space operators equipped with unitarily invariant norms.

math.FA↗

A Novel Two-Parameter Penalty: Relaxation Degree Analysis and Sparse Signal Recovery

In this article, we introduce a nonconvex two-parameter penalty function $P_{a,p}$, parameterized by $a\in(0,\infty)$ and $p\in(0,1]$, and the relaxation degree RD$_P$ for a separable nonconvex penalty function $P$. Based on $P_{a,p}$, we further propose the $P_{a,p}$ minimization framework for sparse signal recovery. This framework generalizes the TL1 minimization model established by S. Zhang and J. Xin (corresponding to the special case $p=1$) and provides a unified family of nonconvex penalty functions for sparse signal recovery. Using the sparse convex-combination technique, we establish both exact and stable sparse signal recovery under the restricted isometry property (RIP). To efficiently solve the resulting nonconvex optimization problem, we apply a modified iteratively re-weighted least squares method and the difference of convex functions algorithm (DCA) to develop the IRLSTLp algorithm for unconstrained $P_{a,p}$ minimization and prove some convergence results. Finally, numerical experiments compare recovery and runtime against single- and double-loop baselines, examine sensitivity to $(a,p)$, and assess the empirical correlation between RD$_{P_{a,p}}$ and recovery within the proposed family.

math.FA↗