Composition Orderings for Linear Functions and Matrix Multiplication Orderings
CoRR(2024)
摘要
We consider composition orderings for linear functions of one variable. Given
n linear functions f_1,…,f_n and a constant c, the objective is to
find a permutation σ that minimizes/maximizes
f_σ(n)∘…∘ f_σ(1)(c). It was first studied in the
area of time-dependent scheduling, and known to be solvable in O(nlog n)
time if all functions are nondecreasing. In this paper, we present a complete
characterization of optimal composition orderings for this case, by regarding
linear functions as two-dimensional vectors. We also show several interesting
properties on optimal composition orderings such as the equivalence between
local and global optimality. Furthermore, by using the characterization above,
we provide a fixed-parameter tractable (FPT) algorithm for the composition
ordering problem for general linear functions, with respect to the number of
decreasing linear functions. We next deal with matrix multiplication orderings
as a generalization of composition of linear functions. Given n matrices
M_1,…,M_n∈ℝ^m× m and two vectors w,y∈ℝ^m,
where m denotes a positive integer, the objective is to find a permutation
σ that minimizes/maximizes w^⊤ M_σ(n)… M_σ(1) y.
The problem is also viewed as a generalization of flow shop scheduling through
a limit. By this extension, we show that the multiplication ordering problem
for 2× 2 matrices is solvable in O(nlog n) time if all the matrices
are simultaneously triangularizable and have nonnegative determinants, and FPT
with respect to the number of matrices with negative determinants, if all the
matrices are simultaneously triangularizable. As the negative side, we finally
prove that three possible natural generalizations are NP-hard: 1) when m=2,
2) when m≥ 3, and 3) the target version of the problem.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要