Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb
From MaRDI portal
Publication:2204138
DOI10.1007/s00006-020-01085-5zbMath1457.68321OpenAlexW3081023667MaRDI QIDQ2204138
Publication date: 15 October 2020
Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00006-020-01085-5
Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance geometry (51K99) Clifford algebras, spinors (15A66) Euclidean analytic geometry (51N20)
Related Items (4)
Quantum register algebra: the mathematical language for quantum computing ⋮ Unnamed Item ⋮ GAALOPWeb ⋮ New applications of Clifford's geometric algebra
Uses Software
Cites Work
- Unnamed Item
- The discretizable molecular distance geometry problem
- Foundations of geometric algebra computing.
- Clifford algebra and the discretizable molecular distance geometry problem
- Minimal NMR distance information for rigidity of protein graphs
- Oriented conformal geometric algebra and the molecular distance geometry problem
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
- Geometric algebra computing for heterogeneous systems
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Boolean combination of circular arcs using orthogonal spheres
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Clifford algebra and discretizable distance geometry
- Euclidean Distance Geometry and Applications
This page was built for publication: Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb
