Clustering in the Lazard method for Cylindrical Algebraic Decomposition

Tereso del Río; AmirHosein Sadeghimanesh; Matthew England

doi:10.1145/3637529.3637533

Clustering in the Lazard method for Cylindrical Algebraic Decomposition

Tereso del Río, AmirHosein Sadeghimanesh, Matthew England

Research Centre for Computational Science and Mathematical Modelling

Research output: Contribution to journal › Article › peer-review

31 Downloads (Pure)

Abstract

Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.

Original language	English
Pages (from-to)	126-129
Number of pages	4
Journal	ACM Communications in Computer Algebra
Volume	57
Issue number	3
DOIs	https://doi.org/10.1145/3637529.3637533
Publication status	Published - 13 Dec 2023

Bibliographical note

Copyright © 2023 Copyright is held by the owner/author(s)

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Keywords

Cylindrical algebraic decomposition

Access to Document

10.1145/3637529.3637533

del Río2023AAMAccepted author manuscript, 680 KB

Cite this

@article{83b793aea60f4839a8c46ea523ed2765,

title = "Clustering in the Lazard method for Cylindrical Algebraic Decomposition",

abstract = "Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.",

keywords = "Cylindrical algebraic decomposition",

author = "{del R{\'i}o}, Tereso and AmirHosein Sadeghimanesh and Matthew England",

note = "Copyright {\textcopyright} 2023 Copyright is held by the owner/author(s) Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.",

year = "2023",

month = dec,

day = "13",

doi = "10.1145/3637529.3637533",

language = "English",

volume = "57",

pages = "126--129",

journal = "ACM Communications in Computer Algebra",

issn = "1932-2240",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Clustering in the Lazard method for Cylindrical Algebraic Decomposition

AU - del Río, Tereso

AU - Sadeghimanesh, AmirHosein

AU - England, Matthew

N1 - Copyright © 2023 Copyright is held by the owner/author(s) Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

PY - 2023/12/13

Y1 - 2023/12/13

N2 - Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.

AB - Cylindrical Algebraic Decomposition (CAD) is an algorithm originally proposed by Collins in [4]. Given a set of multivariate polynomials, CAD decomposes the multidimensional real space into connected subsets called cells, within which those polynomials are sign-invariant.

KW - Cylindrical algebraic decomposition

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

U2 - 10.1145/3637529.3637533

DO - 10.1145/3637529.3637533

M3 - Article

SN - 1932-2240

VL - 57

SP - 126

EP - 129

JO - ACM Communications in Computer Algebra

JF - ACM Communications in Computer Algebra

IS - 3

ER -

Clustering in the Lazard method for Cylindrical Algebraic Decomposition

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this