Reflections on Linear Algebra - Range and Nullspace
This article assumes readers have grasped the basic concepts of linear algebra (e.g. inner product space, subspace, rank of matrix, solving linear equations with Gaussian elimination etc.).
When I was learning about convex optimization, I encountered a statement about feasibility: given constraint $Ax=b$, if $b\notin R(A)$, then this problem is not feasible. I was wondering what $R(A)$ was. After reading this article, hope that the answer will be trivial to you!
To view this article, please download:
Reflections on Linear Algebra: Range and Nullspace
本文作者： lucainiaoge
本文链接： https://lucainiaoge.github.io.git/2020/01/13/Linear_Algebra_Reflection_Range_and_Nullspace/
版权声明： 本作品采用 Creative Commons authorship - noncommercial use - same way sharing 4.0 international license agreement 进行许可。转载请注明出处！
