- Hands-On Mathematics for Deep Learning
- Jay Dawani
- 262字
- 2021-06-18 18:55:08
Solving linear equations in n-dimensions
Now that we've dealt with linear equations in 2-dimensions and have developed an understanding of them, let's go a step further and look at equations in 3-dimensions.
Earlier, our equations produced curves in the 2-dimensional space (xy-plane). Now, the equations we will be dealing with will produce planes in 3-dimensional space (xyz-plane).
Let's take an arbitrary 3x3 matrix, as follows:

We know from earlier in having dealt with linear equations in two dimensions that our solution b, as before, is a linear combination of the three column vectors, so that .
The equation (equation 1) produces a plane, as do
(equation 2), and
(equation 3).
When two planes intersect, they intersect at a line; however, when three planes intersect, they intersect at a point. That point is the vector , which is the solution to our problem.
However, if the three planes do not intersect at a point, there is no solution to the linear equation. This same concept of solving linear equations can be extended to many more dimensions.
Suppose now that we have a system with 15 linear equations and 15 unknown variables. We can use the preceding method and, according to it, we need to find the point that satisfies all the 15 equations—that is, where they intersect (if it exists).
It will look like this:

As you can tell, that's a lot of equations we have to deal with, and the greater the number of dimensions, the harder this becomes to solve.
- 我們都是數據控:用大數據改變商業、生活和思維方式
- Microsoft SQL Server企業級平臺管理實踐
- Python數據挖掘:入門、進階與實用案例分析
- Game Development with Swift
- 新型數據庫系統:原理、架構與實踐
- 區塊鏈通俗讀本
- 算法與數據中臺:基于Google、Facebook與微博實踐
- 辦公應用與計算思維案例教程
- Hadoop集群與安全
- 跨領域信息交換方法與技術(第二版)
- SQL Server深入詳解
- Hands-On Deep Learning for Games
- AndEngine for Android Game Development Cookbook
- 企業級大數據項目實戰:用戶搜索行為分析系統從0到1
- 成功之路:ORACLE 11g學習筆記