News for hackers. Stuff that matters.
Re:Clifford Algebra: A visual introduction (2014) by jacobolus on Saturday June 20, 2015 @12:47AM (#9749021)
The real problem is that it takes quite a bit of practical problem-solving experience to get used to a mathematical language, months or years of work, to really become fluent with it. The same is equally true of trigonometry, vectors, complex analysis, quaternions, calculus, matrices, spinors, group theory, differential forms, manifolds, etc. etc.

But with a mainstream bit of technology, you can go to any good university math department and sign up for a course on the subject. You can take your pick of 100 textbooks. You can read resources aimed at applying specific tools to any number of concrete practical uses. You can often assume that people with a math, science, or engineering degree are already familiar with the technology and understand how it works. You can go find open source implementations of tools built using that technology. Etc.

As a result, we don’t remember how hard all those tools were to learn, and how much work went into building up the conceptual ecosystem.

With a non-mainstream bit of technology, you get to choose from a small handful of resources, often aimed at an audience you aren’t properly a member of or aimed at uses you don’t care about and missing parts that you need. Often best approaches for solving particular problems haven’t been worked out yet. From one source to another, notation conventions and choices of model details can vary, making it hard to compare sources, notice errors, or communicate ideas. Concrete code implementations have seen little scrutiny and so are likely to be incomplete, inefficient, and buggy.

This is a problem with any difficult new bit of technology. Sometimes it takes decades or even centuries for a piece of mathematical technology to go from introduction to wide adoption. Sometimes they don’t make it or sit abandoned on the shelf for a while.

As far as I can tell mathematicians haven’t adopted Geometric Algebra for a simple reason: Mathematicians make their living proving new theorems, and GA is equally/less powerful (in a theoretical sense) than existing abstractions they have, so as a result isn’t particularly useful for their proofs. Its advantages are as a sort of “refactoring” of a bunch of existing technology, and it’s usually a career limiting move in any field to spend too much of your time refactoring, however advantageous it might be for humanity in the long run.

If you’re interested in physics applications, you should check out Hestenes’s book New Foundations for Classical Mechanics, which is pretty good. I’m particularly impressed with the completeness of the treatment of rotations and rigid body mechanics in chapters 5 and 7. General relativity is a field where Geometric Algebra already sees a fair amount of use in the academic literature. Hestenes has also written papers which sketch promising approaches to electrodynamics, quantum mechanics, etc., and the guys at Cambridge have been working on those a bit, but it’ll probably take a large group of others to really flesh it out.

> On the contrary, when I've tried to use it, the complexity of GA just makes it impractical. The problem with 4 or 5 dimensional GA for doing work in 3D, is that we end up dealing with 16 or 32 values per object (if you unify vectors, bivectors, etc), or else having five or six specialised forms of object plus their combinations (if you keep them separate), with potentially hundreds of specialisations of basic operation. This isn't just me, the GA libraries around have this bloat.

This is two tricky problems:

(1) In most cases Geometric Algebra solutions to problems don’t essentially require more computation than other approaches, but figuring out how to write efficient practical implementations (especially against our current hardware and software which is heavily optimized for solving matrix problems) is non-trivial and hasn’t really seen that much work yet.

(2) Existing programming languages really aren’t optimized syntactically for interacting with multidimensional objects in a natural way. Trying to cram a GA system into C++ or Java (e.g.) is just asking for a bloated and confusing syntactic nightmare. You see the same problem with trying to write code for doing matrix algebra in those languages, but at least we have a lot of experience with the domain and there are languages like Matlab or Julia or libraries like NumPy that make things much nicer. Nothing like those exist for Geometric Algebra, and it’s a non-trivial problem to solve.

Re:Clifford Algebra: A visual introduction (2014) by sago on Saturday June 20, 2015 @01:28AM (#9749112)
I agree on all fronts. I think GA is a poor choice for practical programming for the same reasons you identify: nobody knows how to do it well, tools / architectures are not made for it, and nobody has publicly demonstrated its utility on a practical problem in my domain yet (I intended to, and failed).

The second issue, about performance, makes me slightly skeptical of the 'made with GA' claims of Geomeric's engine. I don't doubt there's a GA system in there doing something, but I wonder how much of the actual hard problems in global illumination it is handling, given that global illumination is primarily compute-bound.

As I said, I'd like to be proven wrong. The math does have nice features in the abstract (as you point out).

Re:Clifford Algebra: A visual introduction (2014) by jacobolus on Saturday June 20, 2015 @01:32AM (#9749121)
By the way, it’s totally off topic (I’d email but you don’t have an email listed in your HN profile), but on the subject of new mathematical technologies with practical application, I’ve really been enjoying learning about this thing for the last month or two:

http://www.chebfun.org

Here are a couple of hour-long lecture videos https://www.youtube.com/watch?v=cQp-kB9EOQs http://downloads.sms.cam.ac.uk/1160831/1160835.mp4 and the first 6 chapters of a book explaining the basics of the underlying theory are freely available online (the rest of the book is great too) http://www.chebfun.org/ATAP/

Basic concept is to approximate functions as high-degree polynomials, to within machine precision, and then do operations on those approximations instead of on the original functions, at each step chucking out any coefficients which are smaller than machine precision. This in many cases provides a dramatic speed boost over existing methods for taking integrals/derivatives, finding roots, solving differential equations, convolution, etc. etc., while staying extremely accurate, much better than discrete solutions.

It’s not universally applicable to all functions (for obvious reasons) or all problems, but the team responsible has really done an incredible amount of solid work on the project.

Apparently it’s 10+ years old now, but nobody I’ve asked has ever heard of it before. Which is kind of surprising, because it seems amazing to me so far.

Unfortunately stuck as a Matlab library for the moment (there are partial ports to NumPy and Julia but they are very feature poor compared to the Matlab version).

Re:Clifford Algebra: A visual introduction (2014) by sago on Saturday June 20, 2015 @02:15AM (#9749186)
That sound? That was my weekend going poof! Thank you.

A worthwhile OT. Maybe you could submit it as a link?

Re:Clifford Algebra: A visual introduction (2014) by jacobolus on Saturday June 20, 2015 @03:04AM (#9749259)
It was submitted as a link a few times 2–4 years ago but got no traction: few votes and no comments https://news.ycombinator.com/item?id=3350754 https://news.ycombinator.com/item?id=9463006 https://news.ycombinator.com/item?id=6352216 https://news.ycombinator.com/item?id=5324400

I want to write some examples (as long blog posts or similar) in a few concrete science fields showing how to use these tools in practice and submit those. I feel like the chebfun guys haven’t really figured out some good introductory hooks yet, or done much marketing/outreach: most of their output is papers about approximation theory which takes some amount of effort to figure out and only get seen by academics working in the same subfield, and the practical examples on their site are pretty small pieces (and don’t have comparisons vs. alternative approaches) so it’s hard to see the big picture. Those lecture videos are pretty good, but an hour long lecture is a somewhat big commitment and hard to skim.

BTW, I’m serious about the email thing: shoot me a note (address in my profile) and I’d love to hear about your attempts to implement Geometric Algebra in code. One of my goals for the next few years is to at some point sit down and write a nice web-based introduction to GA filled with interactive diagrams.

Re:Clifford Algebra: A visual introduction (2014) by mc808 on Saturday June 20, 2015 @02:06AM (#9749178)
I happened upon this presentation just a couple days ago - compile-time geometric algebra in C++ via metaprogramming. https://www.youtube.com/watch?v=W4p-e-g37tg

Not sure how useful it is in day-to-day reality, but at the very least it might make other GA implementations seem simple by comparison.

Re:Clifford Algebra: A visual introduction (2014) by cschwan on Saturday June 20, 2015 @07:02AM (#9749642)
Compile time is the most efficient way (IMO) to deal with all the types that can appear (also in intermediate steps of a calculation). I found this idea first realized in this implementation: https://github.com/JaapSuter/Vital. According to the comments in the code is from 2004 so it did could not make use of C++0x, which is why I adopted it rewrote it for C++11. This was motivated by an actual problem I had to solve but, sadly, it turned out GA isn't fit for it.
Re:Clifford Algebra: A visual introduction (2014) by eggy on Saturday June 20, 2015 @11:13AM (#9750147)
I think GA allows for fewer symbols to express similar mathematical ideas, just as J or APL allow for more concise programs. The whole 'Notation as a Tool of Thought' thing by Ken Iverson. I believe new notations require time to sink in to usage for thinking, and then implemented in to the things of the world. We are heading towards concurrent and parallel hardware, distributed systems, GPUs, array languages, and vector processing machines. Maybe a GA implementation will work at a more basic level when we step away from the archaic hardware architecture we have grown so accustomed to and speak GA at a more native level. Lisp machines that speak native GA! Call me a convert or a 'gusher'. I like the beauty of the GA as written, although I plead ignorance to any of the attempts to render it in today's software/hardware. I did read of a company trying to embed it into a graphics processor chip vs. a software library. I'll have to find the reference again.

[EDIT] Here's the link for the chip: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6...