Ground state solution of a Kirchhoff type equation with singular potentials

• URL: http://arxiv.org/abs/2212.07955v1
• Date: Thu, 15 Dec 2022 16:40:48 GMT
• Title: Ground state solution of a Kirchhoff type equation with singular potentials
• Authors: Thanh Viet Phan
• Abstract summary: We study the existence and blow-up behavior of minimizers for $E(b)=infBigmathcalE_b(u),|, uin H1(R2), |u|_L2=1Big,$ here $mathcalE_b(u)$ is the Kirchhoff energy functional defined by $mathcalE_b(u)= int_R2.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the existence and blow-up behavior of minimizers for $E(b)=\inf\Big\{\mathcal{E}_b(u) \,|\, u\in H^1(R^2), \|u\|_{L^2}=1\Big\},$ here $\mathcal{E}_b(u)$ is the Kirchhoff energy functional defined by $\mathcal{E}_b(u)= \int_{R^2} |\nabla u|^2 dx+ b(\int_{R^2} |\nabla u|^2d x)^2+\int_{R^2} V(x) |u(x)|^2 dx - \frac{a}{2} \int_{R^2} |u|^4 dx,$ where $a>0$ and $b>0$ are constants. When $V(x)= -|x|^{-p}$ with $0<p<2$, we prove that the problem has (at least) a minimizer that is non-negative and radially symmetric decreasing. For $a\ge a^*$ (where $a^*$ is the optimal constant in the Gagliardo-Nirenberg inequality), we get the behavior of $E(b)$ when $b\to 0^+$. Moreover, for the case $a=a^*$, we analyze the details of the behavior of the minimizers $u_b$ when $b\to 0^+$.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Efficient Continual Finite-Sum Minimization [52.5238287567572]
  We propose a key twist into the finite-sum minimization, dubbed as continual finite-sum minimization. Our approach significantly improves upon the $mathcalO(n/epsilon)$ FOs that $mathrmStochasticGradientDescent$ requires. We also prove that there is no natural first-order method with $mathcalOleft(n/epsilonalpharight)$ complexity gradient for $alpha 1/4$, establishing that the first-order complexity of our method is nearly tight.
  arXiv  Detail & Related papers  (2024-06-07T08:26:31Z)
• On the quantum Guerra-Morato Action Functional [0.0]
  Given a smooth potential $W:mathrmTn to mathbbR$ on the torus, the Quantum Guerra-Morato action functional is given by smallskip. We show that the expression for the second variation of a critical solution is given by smallskip.
  arXiv  Detail & Related papers  (2024-03-09T10:30:21Z)
• Dimension-free Remez Inequalities and norm designs [48.5897526636987]
  A class of domains $X$ and test sets $Y$ -- termed emphnorm -- enjoy dimension-free Remez-type estimates. We show that the supremum of $f$ does not increase by more than $mathcalO(log K)2d$ when $f$ is extended to the polytorus.
  arXiv  Detail & Related papers  (2023-10-11T22:46:09Z)
• Fitting an ellipsoid to a quadratic number of random points [10.208117253395342]
  We consider the problem $(mathrmP)$ of fitting $n$ standard Gaussian random vectors in $mathbbRd$ to the boundary of a centered ellipsoid, as $n, d to infty$. This problem is conjectured to have a sharp feasibility transition: for any $varepsilon > 0$, if $n leq (1 - varepsilon) d2 / 4$ then $(mathrmP)$ has a solution with high probability.
  arXiv  Detail & Related papers  (2023-07-03T17:46:23Z)
• Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization [54.29685789885059]
  We introduce efficient $(1+varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem. The goal is to approximate $mathbfA$ as a product of low-rank factors. Our techniques generalize to other common variants of the BMF problem.
  arXiv  Detail & Related papers  (2023-06-02T18:55:27Z)
• On the Optimality of Misspecified Kernel Ridge Regression [13.995944403996566]
  We show that KRR is minimax optimal for any $sin (0,1)$ when the $mathcalH$ is a Sobolev RKHS.
  arXiv  Detail & Related papers  (2023-05-12T04:12:12Z)
• An Optimal Algorithm for Strongly Convex Min-min Optimization [79.11017157526815]
  Existing optimal first-order methods require $mathcalO(sqrtmaxkappa_x,kappa_y log 1/epsilon)$ of computations of both $nabla_x f(x,y)$ and $nabla_y f(x,y)$. We propose a new algorithm that only requires $mathcalO(sqrtkappa_x log 1/epsilon)$ of computations of $nabla_x f(x,
  arXiv  Detail & Related papers  (2022-12-29T19:26:12Z)
• The Quantum Mechanical Problem of a Particle on a Ring with Delta Well [0.0]
  The problem of a spin-free electron with mass $m$, charge $e$ confined onto a ring of radius $R_0 and with an attractive Dirac delta potential with scaling factor (depth) $kappa$ in non-relativistic theory has closed form analytical solutions. The single bound state function is of the form of a hyperbolic cosine that however contains a parameter $d>0$ which is the single positive real solution of the transcendental equation $coth(d) = lambda d$ for non zero real.
  arXiv  Detail & Related papers  (2022-11-29T12:24:19Z)
• On the Regularization Effect of Stochastic Gradient Descent applied to Least Squares [0.0]
  We study the behavior of gradient descent applied to $|Ax -b |2 rightarrow min$ for invertible $A in mathbbRn times n$. We show that there is an explicit constant $c_A$ depending (mildly) on $A$ such that $$ mathbbE left| Ax_k+1-bright|2_2 leq.
  arXiv  Detail & Related papers  (2020-07-27T03:01:09Z)
• On the Complexity of Minimizing Convex Finite Sums Without Using the Indices of the Individual Functions [62.01594253618911]
  We exploit the finite noise structure of finite sums to derive a matching $O(n2)$-upper bound under the global oracle model. Following a similar approach, we propose a novel adaptation of SVRG which is both emphcompatible with oracles, and achieves complexity bounds of $tildeO(n2+nsqrtL/mu)log (1/epsilon)$ and $O(nsqrtL/epsilon)$, for $mu>0$ and $mu=0$
  arXiv  Detail & Related papers  (2020-02-09T03:39:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.