[英]linear Independence testing by LP
We have a set of vectors P1,...,Pk. 我们有一组向量P1,...,Pk。 Each vector has n dimension.
每个向量具有n维。 These vectors are linearly independent if the only solution to the following problem is lambda(i) = 0 for each 0 <= i <= k:
如果对于以下问题的唯一解决方案是lambda(i)= 0,则每个0 <= i <= k,这些向量是线性无关的:
lambda(1)P1 + lambda(2)P2 + ... + lambda(k)Pk = 0; lambda(1)P1 + lambda(2)P2 + ... + lambda(k)Pk = 0;
where lambda(i) is a real number. lambda(i)是一个实数。 More rigorous formulation is available in https://en.wikipedia.org/wiki/Linear_independence
https://en.wikipedia.org/wiki/Linear_independence中提供了更严格的配方
I am dealing with modeling this problem with an LP for a long while and so far no answer achieved. 我正在处理用LP建模这个问题很长一段时间,到目前为止还没有实现答案。 Would you please help me with this?
你能帮我解决这个问题吗? Thanks.
谢谢。
Suppose you are dealing with a vector space of dimension n
. 假设您正在处理维度为
n
的向量空间。 If there are more vectors P1,...,Pk
, then the input is not linearly independet; 如果有更多的向量
P1,...,Pk
,则输入不是线性独立的; so suppose that k<=n
. 所以假设
k<=n
。 The goal is to determine the dimension of the linear hull of the input. 目标是确定输入的线性外壳的尺寸。 Solve
n
linear programs of the form 解决形式的
n
线性程序
max e_{i}x s. t. Ax = e_{i}
for each i
in {1,...,n}
where e_{i}
denotes the i
-th unit vector. 对于
{1,...,n}
中的每个i
,其中e_{i}
表示第i
个单位向量。 The number of solvable linear programs should yield the dimension of the input's linear hull, which means that these number equals k
if and only if the input is linearly independent. 可解线性程序的数量应该产生输入线性外壳的尺寸,这意味着当且仅当输入线性独立时,这些数字等于
k
。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.