Jonathan Rampersad c3b3513e79
All checks were successful
Publish Python Package to PyPI / deploy (push) Successful in 18s
feat(ga, api): Implement advanced GA strategy and refactor API for v0.4.0 (#16)
This commit introduces a major enhancement to the genetic algorithm's convergence logic and refactors key parts of the API for better clarity and usability.

- **feat(ga):** Re-implements the GA solver (CPU & CUDA) to use a more robust strategy based on Elitism, Crossover, and Mutation. This replaces the previous, less efficient model and is designed to significantly improve accuracy and convergence speed.

- **feat(api):** Updates `GA_Options` to expose the new GA strategy parameters:
    - Renames `mutation_percentage` to `mutation_strength` for clarity.
    - Adds `elite_ratio`, `crossover_ratio`, and `mutation_ratio`.
    - Includes a `__post_init__` validator to ensure ratios are valid.

- **refactor(api):** Moves `quadratic_solve` from a standalone function to a method of the `Function` class (`f1.quadratic_solve()`). This provides a cleaner, more object-oriented API.

- **docs:** Updates the README, `GA_Options` doc page, and `quadratic_solve` doc page to reflect all API changes, new parameters, and updated usage examples.

- **chore:** Bumps version to 0.4.0.

Reviewed-on: #16
Co-authored-by: Jonathan Rampersad <rampersad.jonathan@gmail.com>
Co-committed-by: Jonathan Rampersad <rampersad.jonathan@gmail.com>
2025-10-27 14:20:56 +00:00
2025-06-30 15:38:24 +00:00
2025-06-16 18:40:06 -04:00
2025-06-16 18:40:06 -04:00
2025-06-17 09:23:26 -04:00
2025-06-17 00:09:09 +00:00

polysolve Logo

PyPI version PyPI pyversions

A Python library for representing, manipulating, and solving polynomial equations using a high-performance genetic algorithm, with optional CUDA/GPU acceleration.


Key Features

  • Create and Manipulate Polynomials: Easily define polynomials of any degree using integer or float coefficients, and perform arithmetic operations like addition, subtraction, multiplication, and scaling.
  • Genetic Algorithm Solver: Find approximate real roots for complex polynomials where analytical solutions are difficult or impossible.
  • CUDA Accelerated: Leverage NVIDIA GPUs for a massive performance boost when finding roots in large solution spaces.
  • Analytical Solvers: Includes standard, exact solvers for simple cases (e.g., quadratic_solve).
  • Simple API: Designed to be intuitive and easy to integrate into any project.

Installation

Install the base package from PyPI:

pip install polysolve

CUDA Acceleration

To enable GPU acceleration, install the extra that matches your installed NVIDIA CUDA Toolkit version. This provides a significant speedup for the genetic algorithm.

For CUDA 12.x users:

pip install polysolve[cuda12]

Quick Start

Here is a simple example of how to define a quadratic function, find its properties, and solve for its roots.

from polysolve import Function, GA_Options

# 1. Define the function f(x) = 2x^2 - 3x - 5
#    Coefficients can be integers or floats.
f1 = Function(largest_exponent=2)
f1.set_coeffs([2, -3, -5])

print(f"Function f1: {f1}")
# > Function f1: 2x^2 - 3x - 5

# 2. Solve for y at a given x
y_val = f1.solve_y(5)
print(f"Value of f1 at x=5 is: {y_val}")
# > Value of f1 at x=5 is: 30.0

# 3. Get the derivative: 4x - 3
df1 = f1.derivative()
print(f"Derivative of f1: {df1}")
# > Derivative of f1: 4x - 3

# 4. Get the 2nd derivative: 4
ddf1 = f1.nth_derivative(2)
print(f"2nd Derivative of f1: {ddf1}")
# > Derivative of f1: 4

# 5. Find roots analytically using the quadratic formula
#    This is exact and fast for degree-2 polynomials.
roots_analytic = f1.quadratic_solve()
print(f"Analytic roots: {sorted(roots_analytic)}")
# > Analytic roots: [-1.0, 2.5]

# 6. Find roots with the genetic algorithm (CPU)
#    This can solve polynomials of any degree.
ga_opts = GA_Options(num_of_generations=20)
roots_ga = f1.get_real_roots(ga_opts, use_cuda=False)
print(f"Approximate roots from GA: {roots_ga[:2]}")
# > Approximate roots from GA: [-1.000..., 2.500...]

# If you installed a CUDA extra, you can run it on the GPU:
# roots_ga_gpu = f1.get_real_roots(ga_opts, use_cuda=True)
# print(f"Approximate roots from GA (GPU): {roots_ga_gpu[:2]}")


Tuning the Genetic Algorithm

The GA_Options class gives you fine-grained control over the genetic algorithm's performance, letting you trade speed for accuracy.

The default options are balanced, but for very complex polynomials, you may want a more exhaustive search.

from polysolve import GA_Options

# Create a config for a much deeper, more accurate search
# (slower, but better for high-degree, complex functions)
ga_accurate = GA_Options(
    num_of_generations=50,  # Run for more generations
    data_size=500000,       # Use a larger population
    elite_ratio=0.1,        # Keep the top 10%
    mutation_ratio=0.5      # Mutate 50%
)

# Pass the custom options to the solver
roots = f1.get_real_roots(ga_accurate)

For a full breakdown of all parameters, including crossover_ratio, mutation_strength, and more, please see the full GA_Options API Documentation.


Development & Testing Environment

This project is automatically tested against a specific set of dependencies to ensure stability. Our Continuous Integration (CI) pipeline runs on an environment using CUDA 12.5 on Ubuntu 24.04.

While the code may work on other configurations, all contributions must pass the automated tests in our reference environment. For detailed information on how to replicate the testing environment, please see our Contributing Guide.

Contributing

PRs Welcome GitHub issues GitHub pull requests

Contributions are welcome! Whether it's a bug report, a feature request, or a pull request, please feel free to get involved.

Please read our CONTRIBUTING.md file for details on our code of conduct and the process for submitting pull requests.

Contributors

Jonathan Rampersad
Jonathan Rampersad

🚧 💻 📖 🚇
Add your contributions

License

This project is licensed under the MIT License - see the LICENSE file for details.

Description
A Python polynomial solver using a genetic algorithm with optional CUDA/GPU acceleration.
https://polysolve.jono-rams.work/
Readme MIT 502 KiB
Languages
Python 100%