grpfpy 0.1.21

the Global complex Root and Pole Finding (GRPF) algorithm.

grpfc: Global complex Roots and Poles Finding in C++

Description

grpfc attempts to find all the zeros and poles of a complex valued function with complex arguments in a fixed region. These types of problems are frequently encountered in electromagnetics, but the algorithm can also be used for similar problems in e.g. optics, acoustics, etc.

The GRPF algorithm first samples the function on a triangular mesh through Delaunay triangulation. Candidate regions to search for roots and poles are determined and the discretized Cauchy's argument principle is applied without needing the derivative of the function or integration over the contour. To improve the accuracy of the results, a self-adaptive mesh refinement occurs inside the identified candidate regions.

grpfpy: Global complex Roots and Poles Finding binding in Python

We also provide grpfpy, a Python binding for grpfc, which is a convenient and high-performance solution for your research. A set of pre-compiled wheels could be installed directly via

  pip install grpfpy

Additionally, if your platform has not been supported, you can clone the sources and build them yourself using pip or cmake:

  pip install .

Installation

• Pull source codes

  git clone --recurse-submodules [e-mail]:allegro0132/grpfc.git

Linux

• Install gcc complier

  apt install build-essential

MacOS

• Install clang compiler

  brew install cmake llvm

Windows

• Install MinGW gcc compiler

  choco install mingw

Common steps

• Prepare building directory

  mkdir build&&cd build

• Prepare compile flags using cmake

  cmake ..

For windows user, you should type it instead:

  cmake -G "MinGW Makefiles" ..

• Compile the library

  make

• Run the Roots and Poles solver

  ./main