1 citations · 1 across the 1 of their papers we have counts for
5 papers
Free (rational) Derivation
Konrad Schrempf
By representing elements in free fields (over a commutative field and a finite alphabet) using Cohn and Reutenauer's linear representations, we provide an algorithmic construction…
Horner Systems: How to efficiently evaluate non-commutative polynomials (by matrices)
Konrad Schrempf
By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (mult…
Primal-dual interior-point Methods for Semidefinite Programming from an algebraic point of view, or: Using Noncommutativity for Optimization
Konrad Schrempf
Since more than three decades, interior-point methods proved very useful for optimization, from linear over semidefinite to conic (and partly beyond non-convex) programming; despit…
Free Fractions: An Invitation to (applied) Free Fields
Konrad Schrempf
Long before we learn to construct the field of rational numbers (out of the ring of integers) at university, we learn how to calculate with fractions at school. When it comes to "n…
A Standard Form in (some) Free Fields: How to construct Minimal Linear Representations
Konrad Schrempf
We describe a standard form for the elements in the universal field of fractions of free associative algebras (over a commutative field). It is a special version of the normal form…