Introduction to RankFactorizationProblem
The RankFactorizationProblem package is a Maple implementation
of algorithms developed in
Inria Report 9438 which
focusses on the so-called rank factorization problem.
This problem aims at solving the following problem: Let K be a field,
M ∈ Km × n, and D1, ..., Dr ∈ Km ×
m, find a column vector u ∈ Km × 1 and r row
vectors v1, ..., vr ∈ K1 ×
n such that M =
D1 u v1 + ... + Dr u vr.
The package RankFactorizationProblem is based on OreModules.
The latest version of RankFactorizationProblem is available for download.