IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v270y2015icp401-412.html
   My bibliography  Save this article

Second order expansion for the solution to a singular Dirichlet problem

Author

Listed:
  • Mi, Ling
  • Liu, Bin

Abstract

In this paper, we analyze the second order expansion for the unique solution near the boundary to the singular Dirichlet problem −▵u=b(x)g(u),u>0,x∈Ω,u|∂Ω=0, where Ω is a bounded domain with smooth boundary in RN,g ∈ C1((0, ∞), (0, ∞)), g is decreasing on (0, ∞) with lims→0+g(s)=∞ and g is normalized regularly varying at zero with index −γ (γ > 1), b∈Clocα(Ω) (0 < α < 1), is positive in Ω, may be vanishing or singular on the boundary and belongs to the Kato class K(Ω). Our analysis is based on the sub-supersolution method and Karamata regular variation theory.

Suggested Citation

  • Mi, Ling & Liu, Bin, 2015. "Second order expansion for the solution to a singular Dirichlet problem," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 401-412.
    • Handle: RePEc:eee:apmaco:v:270:y:2015:i:c:p:401-412
    DOI: 10.1016/j.amc.2015.08.036
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315010917
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.08.036?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(4), pages 691-705, August.
    2. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(1), pages 225-228, February.
    3. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(3), pages 427-432, June.
    4. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(4), pages 629-637, August.
    5. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(5), pages 777-788, October.
    6. ,, 1999. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 15(1), pages 151-160, February.
    7. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(5), pages 879-883, October.
    8. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(6), pages 1195-1198, December.
    9. ,, 2003. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 19(2), pages 411-413, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wong, Patricia J.Y., 2015. "Eigenvalues of a general class of boundary value problem with derivative-dependent nonlinearity," Applied Mathematics and Computation, Elsevier, vol. 259(C), pages 908-930.
    2. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    3. Chein-Shan Liu & Zhuojia Fu & Chung-Lun Kuo, 2017. "Directional Method of Fundamental Solutions for Three-dimensional Laplace Equation," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 9(6), pages 112-123, December.
    4. B. S. C. Campello & C. T. L. S. Ghidini & A. O. C. Ayres & W. A. Oliveira, 2022. "A residual recombination heuristic for one-dimensional cutting stock problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 194-220, April.
    5. Krzysztof C. Kiwiel, 2010. "An Inexact Bundle Approach to Cutting-Stock Problems," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 131-143, February.
    6. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    7. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    8. Dauylbayev, M.K. & Uaissov, B., 2020. "Integral boundary-value problem with initial jumps for a singularly perturbed system of integrodifferential equations," Chaos, Solitons & Fractals, Elsevier, vol. 141(C).
    9. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. Peeters, Marc & Degraeve, Zeger, 2006. "Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem," European Journal of Operational Research, Elsevier, vol. 170(2), pages 416-439, April.
    11. Afrouzi, G.A. & Moghaddam, M. Khaleghy, 2006. "Existence and multiplicity results for a class of p-Laplacian problems with Neumann–Robin boundary conditions," Chaos, Solitons & Fractals, Elsevier, vol. 30(4), pages 967-973.
    12. Hamacher, Horst W. & Pedersen, Christian Roed & Ruzika, Stefan, 2007. "Multiple objective minimum cost flow problems: A review," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1404-1422, February.
    13. Marcelo Fernandes Furtado & Karla Carolina Vicente de Sousa, 2021. "Elliptic problems in the half-space with nonlinear critical boundary conditions," Partial Differential Equations and Applications, Springer, vol. 2(6), pages 1-16, December.
    14. Masatoshi Sakawa & Hideki Katagiri, 2012. "Stackelberg solutions for fuzzy random two-level linear programming through level sets and fractile criterion optimization," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 101-117, March.
    15. Marin, Liviu & Cipu, Corina, 2017. "Non-iterative regularized MFS solution of inverse boundary value problems in linear elasticity: A numerical study," Applied Mathematics and Computation, Elsevier, vol. 293(C), pages 265-286.
    16. Yakut, Oguz, 2021. "Implementation of hydraulically driven barrel shooting control by utilizing artificial neural networks," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 190(C), pages 1206-1223.
    17. X. Qin & G. Huang, 2009. "An Inexact Chance-constrained Quadratic Programming Model for Stream Water Quality Management," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 23(4), pages 661-695, March.
    18. Md. Yousuf Gazi & Khandakar Tahmida Tafhim, 2019. "Investigation of Heavy-mineral Deposits Using Multispectral Satellite Imagery in the Eastern Coastal Margin of Bangladesh," Earth Sciences Malaysia (ESMY), Zibeline International Publishing, vol. 3(2), pages 16-22, October.
    19. Billionnet, Alain, 2011. "Solving the probabilistic reserve selection problem," Ecological Modelling, Elsevier, vol. 222(3), pages 546-554.
    20. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:270:y:2015:i:c:p:401-412. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.