A recipe for symbolic geometric computing: long geometric product, BREEFS and Clifford factorization

zbMATH Open1190.68092arXivmath/0701762MaRDI QIDQ5301680FDOQ5301680

Authors: Hongbo Li 

Publication date: 20 January 2009

Full work available at URL: https://arxiv.org/abs/math/0701762

Recommendations

• scientific article; zbMATH DE number 5733428
• On geometric theorem proving with null geometric algebra
• Symbolic computation in the homogeneous geometric model with clifford algebra
• scientific article; zbMATH DE number 2128063
• Complex brackets, balanced complex differences, and applications in symbolic geometric computing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects related to convexity (52B55)

Cited In (4)

• Automated theorem proving practice with null geometric algebra
• On geometric theorem proving with null geometric algebra
• Complex brackets and balanced complex 1st-order difference polynomials in 4-dimensional Minkowski space
• Complex brackets, balanced complex differences, and applications in symbolic geometric computing

This page was built for publication: A recipe for symbolic geometric computing: long geometric product, BREEFS and Clifford factorization

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