geometric_algebra
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
geometric_algebra [2020/04/23 07:59] – [Articles] pbk | geometric_algebra [2020/06/05 14:51] – [Wikipedia links] pbk | ||
---|---|---|---|
Line 157: | Line 157: | ||
* [[https:// | * [[https:// | ||
* [[https:// | * [[https:// | ||
+ | * [[https:// | ||
==== Personalities ==== | ==== Personalities ==== | ||
Line 514: | Line 515: | ||
Recently suggested scheme of quantum computing uses g-qubit states as circular polarizations from the solution of Maxwell equations in terms of geometric algebra, along with clear definition of a complex plane as bivector in three dimensions. Here all the details of receiving the solution, and its polarization transformations are analyzed. The results can particularly be applied to the problems of quantum computing and quantum cryptography. The suggested formalism replaces conventional quantum mechanics states as objects constructed in complex vector Hilbert space framework by geometrically feasible framework of multivectors. | Recently suggested scheme of quantum computing uses g-qubit states as circular polarizations from the solution of Maxwell equations in terms of geometric algebra, along with clear definition of a complex plane as bivector in three dimensions. Here all the details of receiving the solution, and its polarization transformations are analyzed. The results can particularly be applied to the problems of quantum computing and quantum cryptography. The suggested formalism replaces conventional quantum mechanics states as objects constructed in complex vector Hilbert space framework by geometrically feasible framework of multivectors. | ||
- | * [[https:// | + | * [[https:// |
Maxwell equation in geometric algebra formalism with equally weighted basic solutions is subjected to continuously acting Clifford translation. The received states, operators acting on observables, | Maxwell equation in geometric algebra formalism with equally weighted basic solutions is subjected to continuously acting Clifford translation. The received states, operators acting on observables, | ||
Line 1231: | Line 1232: | ||
* [[https:// | * [[https:// | ||
Geometric Algebra is considered as a very intuitive tool to deal with geometric problems and it appears to be increasingly efficient and useful to deal with computer graphics problems. The Conformal Geometric Algebra includes circles, spheres, planes and lines as algebraic objects, and intersections between these objects are also algebraic objects. More complex objects such as conics, quadric surfaces can also be expressed and be manipulated using an extension of the conformal Geometric Algebra. However due to the high dimension of their representations in Geometric Algebra, implementations of Geometric Algebra that are currently available do not allow efficient realizations of these objects. In this thesis, we first present a Geometric Algebra implementation dedicated for both low and high dimensions. | Geometric Algebra is considered as a very intuitive tool to deal with geometric problems and it appears to be increasingly efficient and useful to deal with computer graphics problems. The Conformal Geometric Algebra includes circles, spheres, planes and lines as algebraic objects, and intersections between these objects are also algebraic objects. More complex objects such as conics, quadric surfaces can also be expressed and be manipulated using an extension of the conformal Geometric Algebra. However due to the high dimension of their representations in Geometric Algebra, implementations of Geometric Algebra that are currently available do not allow efficient realizations of these objects. In this thesis, we first present a Geometric Algebra implementation dedicated for both low and high dimensions. | ||
+ | |||
+ | * [[https:// | ||
+ | Grassmannians are of fundamental importance in projective geometry, algebraic geometry, and representation theory. A vast literature has grown up utilizing using many different languages of higher mathematics, | ||
* [[https:// | * [[https:// | ||
Line 1274: | Line 1278: | ||
In this paper, we address the stability of a broad class of discrete-time hypercomplex-valued Hopfield-type neural networks. To ensure the neural networks belonging to this class always settle down at a stationary state, we introduce novel hypercomplex number systems referred to as real-part associative hypercomplex number systems. Real-part associative hypercomplex number systems generalize the well-known Cayley-Dickson algebras and real Clifford algebras and include the systems of real numbers, complex numbers, dual numbers, hyperbolic numbers, quaternions, | In this paper, we address the stability of a broad class of discrete-time hypercomplex-valued Hopfield-type neural networks. To ensure the neural networks belonging to this class always settle down at a stationary state, we introduce novel hypercomplex number systems referred to as real-part associative hypercomplex number systems. Real-part associative hypercomplex number systems generalize the well-known Cayley-Dickson algebras and real Clifford algebras and include the systems of real numbers, complex numbers, dual numbers, hyperbolic numbers, quaternions, | ||
- | * [[https:// | + | * [[https:// |
+ | Quadratic surfaces gain more and more attention among the Geometric Algebra community and some frameworks were proposed in order to represent, transform, and intersect these quadratic surfaces. As far as the authors know, none of these frameworks support all the operations required to completely handle these surfaces. Some frameworks do not allow the construction of quadratic surfaces from control points when others do not allow to transform these quadratic surfaces. However , if we consider all the frameworks together, then all the required operations over quadratic are covered. This paper presents a unification of these frameworks that enables to represent any quadratic surfaces either using control points or from the coefficients of its implicit form. The proposed approach also allows to transform any quadratic surfaces and to compute their intersection and to easily extract some geometric properties. | ||
+ | |||
+ | | ||
A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet operations; compact, polymorphic syntax for euclidean formulas and constructions; | A tutorial introduction to projective geometric algebra (PGA), a modern, coordinate-free framework for doing euclidean geometry. PGA features: uniform representation of points, lines, and planes; robust, parallel-safe join and meet operations; compact, polymorphic syntax for euclidean formulas and constructions; | ||
+ | |||
+ | * [[https:// | ||
+ | Many important mathematical formulations in GA can be expressed as outermorphisms such as versor products, linear projection operators, and mapping between related coordinate frames. (...) This work attempts to shed some light on the problem of optimizing software implementations of outermorphisms for practical prototyping applications using geometric algebra. The approach we propose here for implementing outermorphisms requires orders of magnitude less memory compared to other common approaches, while being comparable in time performance, | ||
* [[http:// | * [[http:// |
geometric_algebra.txt · Last modified: 2023/12/30 00:23 by pbk