sicmutils.calculus.form-field — net.littleredcomputer/sicmutils 0.13.0

components->oneform-field clj/s

(components->oneform-field components coordinate-system & [name])

coordinate-basis-oneform-field clj/s

(coordinate-basis-oneform-field coordinate-system name & i)

coordinate-basis-oneform-field-procedure clj/s

(coordinate-basis-oneform-field-procedure coordinate-system & i)

coordinate-basis-oneform-fields clj/s

(coordinate-basis-oneform-fields coordinate-system)

coordinate-name->ff-name clj/s

(coordinate-name->ff-name n)

From the name of a coordinate, produce the name of the coordinate basis one-form field (as a symbol)

d clj/s

exterior-derivative-procedure clj/s

(exterior-derivative-procedure kform)

form-field? clj/s

(form-field? f)

function->oneform-field clj/s

(function->oneform-field f)

get-rank clj/s

(get-rank f)

literal-oneform-field clj/s

(literal-oneform-field name coordinate-system)

oneform-field->components clj/s

(oneform-field->components form coordinate-system)

oneform-field-procedure clj/s

(oneform-field-procedure components coordinate-system)

oneform-field? clj/s

(oneform-field? f)

permutation-sequence clj/s

(permutation-sequence as)

This is an unusual way to go about this in a functional language, but it's fun. Produces an iterable sequence developing the permutations of the input sequence of objects (which are considered distinct) in church-bell-changes order, that is, each permutation differs from the previous by a transposition of adjacent elements (Algorithm P from §7.2.1.2 of Knuth). This has the side-effect of arranging for the parity of the generated permutations to alternate; the first permutation yielded is the identity permutation (which of course is even). Inside, there is a great deal of mutable state, but this cannot be observed by the user.

procedure->nform-field clj/s

(procedure->nform-field proc n name)

procedure->oneform-field clj/s

(procedure->oneform-field fp name)

wedge clj/s

(wedge & fs)