On the parallelization of triangular decompositions

DOI10.1145/3373207.3404065MaRDI QIDQ5145950zbMATH OpenOpenAlexWikidataFDO

Authors Mohammadali Asadi, Alexander Brandt, Robert H. C. Moir, Marc Moreno Maza, Yuzhen Xie

Publication date 22 January 2021

Published in Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3373207.3404065

zbMATH Keywords

dynamic irregular parallel applicationsfork-join modelparallel processingpolynomial system solvingproducer-consumer problemregular chainstriangular decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited in

(9)

• On designing optimal parallel triangular solvers.
• Subresultant chains using Bézout matrices
• Parallelization of triangular decompositions: techniques and implementation
• Dimension-wise decompositions and their efficient parallelization
• Parallel and Heterogeneous m--Hessenberg--Triangular--Triangular Reduction
• Employing C++ templates in the design of a computer algebra library
• Two new ways to formally prove Dandelin-Gallucci's theorem
• Computational schemes for subresultant chains
• On the complexity and parallel implementation of Hensel's lemma and Weierstrass preparation

This page was built for publication: On the parallelization of triangular decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145950)