Computing values of a polynomial with only few multiplications
type: Item
instance of: scholarly article
title: Computing values of a polynomial with only few multiplications
zbMATH Open document ID: 0794.11049
DOI: 10.1016/0020-0190(94)90051-5
published in: Information Processing Letters
publication date: 1994-02-24T00:00:00Z
review text: It is shown that the values of a polynomial can be computed with very few multiplications, if one has a database of Stirling numbers.
Mathematics Subject Classification ID: 11Y99
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 500511
zbMATH Keywords: polynomial
zbMATH Keywords: Stirling numbers
Wikidata QID: Q114215565
author: Darko Veljan
reviewed by: H. J. Godwin
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90051-5
OpenAlex ID: W2083966827
cites work: Q4057549
cites work: Q3748279
Recommended article: Computing polynomials with few multiplications
Recommended article: The computation of multiple roots of a polynomial
Recommended article: Numerical computation of the least common multiple of a set of polynomials
Recommended article: Q3810788
Recommended article: Q4654850
Recommended article: Computing Sparse Multiples of Polynomials
Recommended article: Computing sparse multiples of polynomials
Recommended article: Computers and the Multiplicity of Polynomial Roots
Recommended article: Computing the measure of a polynomial
Recommended article: Computing multiple roots of inexact polynomials
description: scientific article; zbMATH DE number 500511