Skip to main content
placeholder image

A linear time complexity solver for lattice quantum field theory computations

Conference Paper


Download full-text (Open Access)

Abstract


  • Lattice Quantum Chromodynamics is used to investigate the behavior of quarks under the influence of the Strong Nuclear force. The computer implementation requires the solution of square sparse matrices with the number of rows up to the lOO's of millions, and this represents the major computational factor with regards to overall runtime. In this paper we present verification of an algorithm that grows only linearly with respect to matrix size in terms of the computing resources required. Once realistically sized calculations can be done on commonly available hardware, this opens the door to the investigation of quantum fields in other areas such as condensed matter physics and nanotechnology.

UOW Authors


  •   Beaven, Dieter (external author)
  •   Fulcher, John A. (external author)
  •   Zhang, C

Publication Date


  • 2012

Citation


  • Beaven, D., Fulcher, J. & Zhang, C. (2012). A linear time complexity solver for lattice quantum field theory computations. Proceedings of the International MultiConference of Engineers and Computer Scientists 2012 (pp. 1641-1646). Hong Kong: Newswood Ltd.

Scopus Eid


  • 2-s2.0-84867473372

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=8040&context=engpapers

Ro Metadata Url


  • http://ro.uow.edu.au/engpapers/5109

Start Page


  • 1641

End Page


  • 1646

Abstract


  • Lattice Quantum Chromodynamics is used to investigate the behavior of quarks under the influence of the Strong Nuclear force. The computer implementation requires the solution of square sparse matrices with the number of rows up to the lOO's of millions, and this represents the major computational factor with regards to overall runtime. In this paper we present verification of an algorithm that grows only linearly with respect to matrix size in terms of the computing resources required. Once realistically sized calculations can be done on commonly available hardware, this opens the door to the investigation of quantum fields in other areas such as condensed matter physics and nanotechnology.

UOW Authors


  •   Beaven, Dieter (external author)
  •   Fulcher, John A. (external author)
  •   Zhang, C

Publication Date


  • 2012

Citation


  • Beaven, D., Fulcher, J. & Zhang, C. (2012). A linear time complexity solver for lattice quantum field theory computations. Proceedings of the International MultiConference of Engineers and Computer Scientists 2012 (pp. 1641-1646). Hong Kong: Newswood Ltd.

Scopus Eid


  • 2-s2.0-84867473372

Ro Full-text Url


  • http://ro.uow.edu.au/cgi/viewcontent.cgi?article=8040&context=engpapers

Ro Metadata Url


  • http://ro.uow.edu.au/engpapers/5109

Start Page


  • 1641

End Page


  • 1646