The sparsity challenges

James H Davenport, Jacques Carette

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. This is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose
Original languageEnglish
Title of host publication2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)
PublisherIEEE
Pages3-7
Number of pages5
ISBN (Electronic)9781424459117
ISBN (Print)9781424459100
DOIs
Publication statusPublished - 2009
Event11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing: SYNASC 2009 - Timisoara, Romania
Duration: 26 Sep 200929 Sep 2009

Conference

Conference11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
CountryRomania
CityTimisoara
Period26/09/0929/09/09

Fingerprint

Polynomials
Algebra

Cite this

Davenport, J. H., & Carette, J. (2009). The sparsity challenges. In 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009) (pp. 3-7). IEEE. https://doi.org/10.1109/SYNASC.2009.62

The sparsity challenges. / Davenport, James H; Carette, Jacques.

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009). IEEE, 2009. p. 3-7.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Davenport, JH & Carette, J 2009, The sparsity challenges. in 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009). IEEE, pp. 3-7, 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, 26/09/09. https://doi.org/10.1109/SYNASC.2009.62
Davenport JH, Carette J. The sparsity challenges. In 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009). IEEE. 2009. p. 3-7 https://doi.org/10.1109/SYNASC.2009.62
Davenport, James H ; Carette, Jacques. / The sparsity challenges. 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009). IEEE, 2009. pp. 3-7
@inproceedings{722a97d9aa4f4014b82e7d6bb795cdc8,
title = "The sparsity challenges",
abstract = "While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. This is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose",
author = "Davenport, {James H} and Jacques Carette",
year = "2009",
doi = "10.1109/SYNASC.2009.62",
language = "English",
isbn = "9781424459100",
pages = "3--7",
booktitle = "2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)",
publisher = "IEEE",
address = "USA United States",

}

TY - GEN

T1 - The sparsity challenges

AU - Davenport, James H

AU - Carette, Jacques

PY - 2009

Y1 - 2009

N2 - While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. This is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose

AB - While much is written about the importance of sparse polynomials in computer algebra, much less is known about the complexity of advanced (i.e. anything more than multiplication!) algorithms for them. This is due to a variety of factors, not least the problems posed by cyclotomic polynomials. In this paper we state a few of the challenges that sparse polynomials pose

UR - http://www.scopus.com/inward/record.url?scp=77953046992&partnerID=8YFLogxK

UR - http://synasc09.info.uvt.ro/

UR - http://dx.doi.org/10.1109/SYNASC.2009.62

U2 - 10.1109/SYNASC.2009.62

DO - 10.1109/SYNASC.2009.62

M3 - Conference contribution

SN - 9781424459100

SP - 3

EP - 7

BT - 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)

PB - IEEE

ER -