LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Rigorous Numerical Enclosures for Positive Solutions of Lane–Emden’s Equation with Sub-Square Exponents

Photo by photoripey from unsplash

The purpose of this paper is to obtain rigorous numerical enclosures for solutions of Lane– Emden’s equation −∆u = |u|p−1u with homogeneous Dirichlet boundary conditions. We prove the existence of… Click to show full abstract

The purpose of this paper is to obtain rigorous numerical enclosures for solutions of Lane– Emden’s equation −∆u = |u|p−1u with homogeneous Dirichlet boundary conditions. We prove the existence of a nondegenerate solution u nearby a numerically computed approximation û together with an explicit error bound, i.e., a bound for the difference between u and û. In particular, we focus on the sub-square case in which 1 < p < 2 so that the derivative p|u|p−1 of the nonlinearity |u|p−1u is not Lipschitz continuous. In this case, it is problematic to apply the classical Newton-Kantorovich theorem for obtaining the existence proof, and moreover several difficulties arise in the procedures to obtain numerical integrations rigorously. We design a method for enclosing the required integrations explicitly, proving the existence of a desired solution based on a generalized Newton-Kantorovich theorem. A numerical example is presented where an explicit solution-enclosure is obtained for p = 3/2 on the unit square domain Ω = (0, 1).

Keywords: numerical enclosures; lane emden; emden equation; rigorous numerical; solutions lane; square

Journal Title: Numerical Functional Analysis and Optimization
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.