IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v95y1979i3p547-560.html
   My bibliography  Save this article

Remarks on the density functional approach to the inhomogeneous electron gas

Author

Listed:
  • Tomášek, M.
  • Mikoláš, V.

Abstract

The density functional approach is reformulated by using the most general form of the Hohenberg-Kohn theorem based on p-particle densities. Comparison with the reduced density matrix theory is made, exhibiting fully the p-particle hierarchy of both theories. Some advantages and drawbacks of the generalized density functional approach are discussed. The 1-particle spin-polarized case is presented to indicate the place of the usual DFA within the framework of the generalized theory.

Suggested Citation

  • Tomášek, M. & Mikoláš, V., 1979. "Remarks on the density functional approach to the inhomogeneous electron gas," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 95(3), pages 547-560.
    • Handle: RePEc:eee:phsmap:v:95:y:1979:i:3:p:547-560
    DOI: 10.1016/0378-4371(79)90031-1
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0378437179900311
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/0378-4371(79)90031-1?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. Sartaj Sahni, 1977. "General Techniques for Combinatorial Approximation," Operations Research, INFORMS, vol. 25(6), pages 920-936, December.
    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. Imed Kacem & Hans Kellerer & Yann Lanuel, 2015. "Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 403-412, October.
    2. Perrot, F., 1979. "Zero-temperature equation of state of metals in the statistical model with density gradient correction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 98(3), pages 555-565.
    3. Safer, Hershel M. & Orlin, James B., 1953-, 1995. "Fast approximation schemes for multi-criteria combinatorial optimization," Working papers 3756-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    4. Halman, Nir & Kellerer, Hans & Strusevich, Vitaly A., 2018. "Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints," European Journal of Operational Research, Elsevier, vol. 270(2), pages 435-447.
    5. Dolgui, Alexandre & Kovalev, Sergey & Pesch, Erwin, 2015. "Approximate solution of a profit maximization constrained virtual business planning problem," Omega, Elsevier, vol. 57(PB), pages 212-216.
    6. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2007. "Approximation of min-max and min-max regret versions of some combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 179(2), pages 281-290, June.
    7. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    8. Cheng, T. C. Edwin & Gordon, Valery S. & Kovalyov, Mikhail Y., 1996. "Single machine scheduling with batch deliveries," European Journal of Operational Research, Elsevier, vol. 94(2), pages 277-283, October.
    9. Evgeny Gurevsky & Dmitry Kopelevich & Sergey Kovalev & Mikhail Y. Kovalyov, 2023. "Integer knapsack problems with profit functions of the same value range," 4OR, Springer, vol. 21(3), pages 405-419, September.
    10. Wei Ding & Guoliang Xue, 2014. "Minimum diameter cost-constrained Steiner trees," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 32-48, January.
    11. Safer, Hershel M. & Orlin, James B., 1953-, 1995. "Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems," Working papers 3757-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    12. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.

    More about this item

    Statistics

    Access and download statistics

    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:phsmap:v:95:y:1979:i:3:p:547-560. 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: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.