semvec/pypi-packages huggingface dataset:
eigentools 2.2112
A toolkit for solving eigenvalue problems with Dedalus
Requires Python: >=3.5

# Eigentools

Eigentools is a set of tools for studying linear eigenvalue problems. The underlying eigenproblems are solved using [Dedalus](http://dedalus-project.org), which provides a domain-specific language for partial differential equations. Eigentools extends Dedalus's `EigenvalueProblem` object and provides

* automatic rejection of unresolved eigenvalues
* simple plotting of specified eigenmodes
* simple plotting of spectra
* computation of pseudospectra for any Differential-Algebraic Equations with **user-specifiable norms**
* tools to find critical parameters for linear stability analysis
* ability to project eigenmode onto 2- or 3-D domain for visualization
* ability to output projected eigenmodes as Dedalus-formatted HDF5 file to be used as initial conditions for Initial Value Problems
* simple plotting of drift ratios (both ordinal and nearest) to evaluate tolerance for eigenvalue rejection

## Installation

Eigentools can be `pip` installed, though it requires [Dedalus](http://dedalus-project.org/), which has non-`pip` installable dependencies. See the [installation instructions](https://eigentools.readthedocs.io/en/latest/pages/installation.html) for details.

## Documentation

Documentation (including detailed API documentation) can be found at [Read the Docs](https://eigentools.readthedocs.io/).

If you are upgrading from version 1 to version 2, you can find a guide to API changes [here](https://eigentools.readthedocs.io/en/latest/pages/upgrading.html)

## Contributing

Eigentools welcomes community contributions from issue reports to code contributions. For details, please see [our contribution policy](CONTRIBUTING.md).

## Developers
The core development team consists of 

* Jeff Oishi (<jsoishi@gmail.com>)
* Keaton Burns (<keaton.burns@gmail.com>)
* Susan Clark (<susanclark19@gmail.com>)
* Evan Anders (<evan.anders@northwestern.edu>)
* Ben Brown (<bpbrown@gmail.com>)
* Geoff Vasil (<geoffrey.m.vasil@gmail.com>)
* Daniel Lecoanet (<daniel.lecoanet@northwestern.edu>)

## Support 
Eigentools was developed with support from the Research Corporation under award Scialog Collaborative Award (TDA) ID# 24231.


<!--  LocalWords:  Eigentools eigenproblems Dedalus EigenvalueProblem
 -->
<!--  LocalWords:  eigenmodes pseudospectra eigenmode HDF conda Oishi
 -->
<!--  LocalWords:  eigentools Anders Geoff Vasil Lecoanet Scialog TDA
 -->
tusc 0.0.2
a Python library providing tools for combinatorial maths
Requires Python: >=3.8

[![Documentation Status](https://readthedocs.org/projects/tusc/badge/?version=latest)](https://tusc.readthedocs.io/en/latest/?badge=latest)
[![Build Status](https://app.travis-ci.com/lucasmccabe/tusc.svg?branch=main)](https://app.travis-ci.com/lucasmccabe/tusc)
[![MIT license](https://img.shields.io/badge/License-MIT-blue.svg)](https://lbesson.mit-license.org/)

# TUSC 🐘: Toolbox for Understanding Some things in Combinatorics

> WIP Python library providing tools for combinatorial maths (partially-ordered sets, graph polynomials, etc.).

![elephant_header](assets/elephant_header.png)

## Table of Contents
* [Table of Contents](#table-of-contents)
* [Setup](#setup)
* [Example Usage](#example-usage)
* [Repo Organization](#repo-organization)
* [Requirements](#requirements)
* [Contact](#contact)
* [License](#license)


<!-- ## Setup

1. Clone this repo
2. cd into the `tusc` directory and run the following in your shell: ```pip install -r requirements.txt``` -->


## Example Usage

Retrieving the Tutte polynomial for the five-vertex cycle graph (C<sub>5</sub>):

```python
import tusc
import networkx as nx

C5 = nx.cycle_graph(5)
tutte_C5 = tusc.graph.polynomial.Tutte(C5)
tutte_C5.polynomial
```

```bash
'x^4 + x^3 + x^2 + x + y'
```

Evaluating the polynomial to find the number of acyclic orientations of C<sub>5</sub>:

```python
tutte_C5.evaluate(2, 0)
```

```bash
30
```

## Repo Organization

This repo is organized as follows:

```bash
tusc
├── tusc
│   ├── general  # general utilities, e.g. OEIS lookup
│   │   ├── utils
│   ├── graph  # graph problems, retrieving graph polynomials
│   │   ├── distance
│   │   ├── enumeration  # enumerative problems, e.g. counting spanning trees
│   │   ├── manipulation
│   │   ├── matching
│   │   ├── polynomial  # retrieving graph polynomials (e.g. Tutte, chromatic)
│   ├── posets    # constructing and analyzing partially-ordered sets
│   │   ├── utils
│   │   ├── example_posets
│   │   ├── poset
├── tests
│   ├── general
├── assets
├── docs
```


## Requirements
This project was created with:

- `requests==2.24.0`
- `numpy==1.19.5`
- `sympy==1.6.2`
- `networkx==2.5`


## Contact
- Lucas Hurley McCabe ([email](mailto:lucasmccabe@gwu.edu))

## License
[MIT](https://choosealicense.com/licenses/mit/)