IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v31y2020i11ns0129183120501661.html
   My bibliography  Save this article

Space-time collocation method: Loop quantum Hamiltonian constraints

Author

Listed:
  • A. Yonika

    (Department of Physics & Center for Scientific Computing and Visualization Research, University of Massachusetts Dartmouth, 285 Old Westport Road, North Dartmouth, MA 02747, USA)

  • A. Heryudono

    (Department of Mathematics & Center for Scientific Computing and Visualization Research, University of Massachusetts Dartmouth, 285 Old Westport Road, North Dartmouth, MA 02747, USA)

  • G. Khanna

    (Department of Physics & Center for Scientific Computing and Visualization Research, University of Massachusetts Dartmouth, 285 Old Westport Road, North Dartmouth, MA 02747, USA)

Abstract

A space-time collocation method (STCM) using asymptotically-constant basis functions is proposed and applied to the quantum Hamiltonian constraint for a loop-quantized treatment of the Schwarzschild interior. Canonically, these descriptions take the form of a partial difference equation (PDE). The space-time collocation approach presents a computationally efficient, convergent, and easily parallelizable method for solving this class of equations, which is the main novelty of this study. Results of the numerical simulations will demonstrate the benefit from a parallel computing approach; and show general flexibility of the framework to handle arbitrarily-sized domains. Computed solutions will be compared, when applicable, to a solution computed in the conventional method via iteratively stepping through a predefined grid of discrete values, computing the solution via a recursive relationship.

Suggested Citation

  • A. Yonika & A. Heryudono & G. Khanna, 2020. "Space-time collocation method: Loop quantum Hamiltonian constraints," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 31(11), pages 1-17, November.
  • Handle: RePEc:wsi:ijmpcx:v:31:y:2020:i:11:n:s0129183120501661
    DOI: 10.1142/S0129183120501661
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183120501661
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183120501661?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.

    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:wsi:ijmpcx:v:31:y:2020:i:11:n:s0129183120501661. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.