A poly-algorithmic approach to simplifying elementary functions

DOI10.1145/1005285.1005292MaRDI QIDQ4657297zbMATH OpenOpenAlexFDO

Authors James C. Beaumont, Nalina Phisanbut, Russell Bradford, James H. Davenport

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• scientific article; zbMATH DE number 2151213
• scientific article; zbMATH DE number 1109070
• Elementary functions. Algorithms and implementation
• scientific article; zbMATH DE number 1929311
• scientific article; zbMATH DE number 1296286
• A polynomial reduction algorithm
• scientific article; zbMATH DE number 1348481
• Reducibility by means of almost polynomial functions
• Simplifying algebraic functional systems
• scientific article; zbMATH DE number 850292

Cited in

(8)

• scientific article; zbMATH DE number 2079837 (Why is no real title available?)
• Reasoning about the elementary functions of complex analysis
• Ten commandments for good default expression simplification
• Automated simplification of large symbolic expressions
• A domain-specific architecture for elementary function evaluation
• Algebraic simplification in computer algebra: an analysis of bottom-up algorithms
• Automated and readable simplification of trigonometric expressions
• Testing elementary function identities using CAD

Describes a project that uses

Uses Software

• QEPCAD

This page was built for publication: A poly-algorithmic approach to simplifying elementary functions

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