{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/92687"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/92687","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Optimizing tensor contractions for nuclear correlation functions","abstract":"Nuclear correlation functions reveal interesting physical properties of atomic nuclei, including ground state energies and scattering potentials. However, calculating their values is computationally intensive due to the fact that the number of terms from quantum chromodynamics in a nuclear wave function scales exponentially with atomic number. In this thesis, we demonstrate two methods for speeding up this computation. First, we represent a correlation function as a sum of the determinants of many small matrices, and exploit similarities between the matrices to speed up the calculations of the determinants. We also investigate representing a correlation function as a sum of functions of bipartite graphs, and use isomorph-free exhaustive generation techniques to find a minimal set of graphs that represents the computation.","abstract_html":"Nuclear correlation functions reveal interesting physical properties of atomic nuclei, including ground state energies and scattering potentials. However, calculating their values is computationally intensive due to the fact that the number of terms from quantum chromodynamics in a nuclear wave function scales exponentially with atomic number. In this thesis, we demonstrate two methods for speeding up this computation. First, we represent a correlation function as a sum of the determinants of many small matrices, and exploit similarities between the matrices to speed up the calculations of the determinants. We also investigate representing a correlation function as a sum of functions of bipartite graphs, and use isomorph-free exhaustive generation techniques to find a minimal set of graphs that represents the computation.","abstract_has_math":false,"creators":["Vachaspati, Pranjal"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Physics.","school":null,"contributors":[],"advisors":["William Detmold."],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014","date_published":"2014","updated_at":"2026-07-22T22:21:39Z","subjects":["Physics."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/92687","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["William Detmold."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Physics."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Physics."]},{"key":"dc:creator","label":"Author","values":["Vachaspati, Pranjal"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2015-01-05T20:05:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2015-01-05T20:05:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2014"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Physics."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/92687"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: S.B., Massachusetts Institute of Technology, Department of Physics, 2014.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 37-38)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Nuclear correlation functions reveal interesting physical properties of atomic nuclei, including ground state energies and scattering potentials. However, calculating their values is computationally intensive due to the fact that the number of terms from quantum chromodynamics in a nuclear wave function scales exponentially with atomic number. In this thesis, we demonstrate two methods for speeding up this computation. First, we represent a correlation function as a sum of the determinants of many small matrices, and exploit similarities between the matrices to speed up the calculations of the determinants. We also investigate representing a correlation function as a sum of functions of bipartite graphs, and use isomorph-free exhaustive generation techniques to find a minimal set of graphs that represents the computation."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.B."]},{"key":"dc:title","label":"Title","values":["Optimizing tensor contractions for nuclear correlation functions"]}]}],"canonical_facts":{"dc:contributor.advisor":["William Detmold."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Physics."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Physics."],"dc:creator":["Vachaspati, Pranjal"],"dc:date.accessioned":["2015-01-05T20:05:59Z"],"dc:date.available":["2015-01-05T20:05:59Z"],"dc:date.issued":["2014"],"dc:description":["Thesis: S.B., Massachusetts Institute of Technology, Department of Physics, 2014.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 37-38)."],"dc:description.abstract":["Nuclear correlation functions reveal interesting physical properties of atomic nuclei, including ground state energies and scattering potentials. However, calculating their values is computationally intensive due to the fact that the number of terms from quantum chromodynamics in a nuclear wave function scales exponentially with atomic number. In this thesis, we demonstrate two methods for speeding up this computation. First, we represent a correlation function as a sum of the determinants of many small matrices, and exploit similarities between the matrices to speed up the calculations of the determinants. We also investigate representing a correlation function as a sum of functions of bipartite graphs, and use isomorph-free exhaustive generation techniques to find a minimal set of graphs that represents the computation."],"dc:description.degree":["S.B."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/92687"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Physics."],"dc:title":["Optimizing tensor contractions for nuclear correlation functions"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:39Z"}