Skip to content

improved implementations of composition of polynomials #511

@nsajko

Description

@nsajko
  1. it seems that algorithms with less computational complexity than mere Horner's scheme exist, for example (covers some background in the introduction): https://ens-lyon.hal.science/ensl-00546102/document
  2. There should be special code for the case where one or both polynomials have their (small) degree in the type domain (ImmutablePolynomial)

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions