HomotopyContinuation.jl - a package for solving systems of polynomial equations in Julia

11/28/2017
by   Paul Breiding, et al.
0

This paper is gives a short introduction into HomotopyContinuation.jl, a polynomial equations solver for Julia [1]. It present excerpts from the comprehensive documentation available at https://juliahomotopycontinuation.github.io/latest/. The aim of this project is twofold: establishing a fast numerical polynomial solver in Julia and at the same time providing a highly customizable algorithmic environment for researchers for designing and performing individual experiments. [1] J. Bezanson, A. Edelman, S. Karpinski and V. Shah: Julia: A fresh approach to numerical computing, SIAM Review, 59(1) (2017), 65-98.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

Solving polynomial equations and applications

These notes accompany an introductory lecture given by the author at the...
research
06/12/2017

Beyond Polyhedral Homotopies

We present a new algorithmic framework which utilizes tropical geometry ...
research
04/25/2013

Euclidean Upgrade from a Minimal Number of Segments

In this paper, we propose an algebraic approach to upgrade a projective ...
research
11/16/2019

New Polynomial Preconditioned GMRES

A new polynomial preconditioner is given for solving large systems of li...
research
06/28/2019

Solving Polynomial Systems with phcpy

The solutions of a system of polynomials in several variables are often ...
research
08/02/2016

Rational Solutions of Underdetermined Polynomial Equations

In this paper we report on an application of computer algebra in which m...
research
05/14/2020

Reproducibility of Parallel Preconditioned Conjugate Gradient in Hybrid Programming Environments

The Preconditioned Conjugate Gradient method is often employed for the s...

Please sign up or login with your details

Forgot password? Click here to reset