Skip to content

A recusive algorithm to calculate high order diagrammatic expansions

Notifications You must be signed in to change notification settings

iintSjds/ParquetMC

 
 

Repository files navigation

ParquetMC

Parquet algorithm to calculate high order diagrammatic expansions

This algorithm will be useful for the following tasks: i) Calculate the bare diagrammatic expansion. ii) Solve the parquet equations in a systematic way. iii) Solve functional RG equations in a systematic way.

About

A recusive algorithm to calculate high order diagrammatic expansions

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C++ 67.0%
  • Jupyter Notebook 25.9%
  • Python 4.0%
  • C 2.9%
  • Other 0.2%