Halaman

Selasa, 05 Juni 2012

Linear Algebra


Linear algebra is the branch of mathematics concerning finite or countably infinite dimensional vector spaces, as well as linear mappings between such spaces. Such an investigation is initially motivated by a system of linear equations in several unknowns. Such equations are naturally represented using the formalism of matrices and vectors.[1]
Linear algebra is central to both pure and applied mathematics. For instance abstract algebra arises by relaxing the axioms leading to a number of generalizations. Functional analysis studies the infinite-dimensional version of the theory of vector spaces. Combined with calculus linear algebra facilitates the solution of linear systems of differential equations. Techniques from linear algebra are also used in analytic geometry, engineering, physics, natural sciences, computer science, and the social sciences (particularly in economics). Because linear algebra is such a well-developed theory, nonlinear mathematical models are sometimes approximated by linear ones.

Linear equations can be expressed as a matrix. For example, the equation:
3 x 1 + 4 x 2-2 x 3 = 5
x 1-5 x 2 + 2 x 3 = 7
2 x 1 + x 2 - 3 x 3 = 9
can be expressed in the following matrix teraugmentasi
 

Completion of linear equations in matrix form can be done in several ways, namely by Gaussian elimination or can also by Gauss-Jordan elimination. However, a system of linear equations can be solved by Gaussian elimination to transform the matrix into echelon form teraugmentasi-line without simplifying it. This method is called back substitution.
A sisitem homogeneous linear equations can be said if has the form:
a 11 x 1 + a 12 x 2 + ... + A 1n x n = 0
a 21 x 1 + a 22 x 2 + ... + A 2n x n = 0
a m1 x 1 + a m2 x 2 + ... + A mn x n = 0
Every system of linear equations is homogeneous if all systems are still mepunyai x 1 = 0, x 2 = 0, ... , X n = 0 as a solution. This settlement is called the trivial solution. Where else have a solution is called nontrivial solutions.

 

Completion of Linear Equations with Matrices


row-echelon form

The matrix can be said of Echelon-line if it meets the following requirements:
A.) In each row, the first number other than 0 must be 1 (leading 1).
2.) If there is a line that all its elements zero, then it should be grouped at the end of the row of the matrix.
3.) If there is a leading line 1 below the leading one, number one it should be more right than the leading one on it.
4.) If the column has a number other than one leading zero then the matrix is called row-reduced echelon
Example: condition 1: The first line is called the leading 1
 

condition 2: row-3-4 and the second eligible
 

three terms: the first line and the 3-2 eligible
 

condition 4: the matrix below are eligible for 4 and is called the reduced row-echelon
 

Operation Gaussian Elimination

Gaussian elimination is a way of operating the values ​​in the matrix so that it becomes a simple matrix (invented by Carl Friedrich Gauss ). The trick is to do the surgery so that the lines of the matrix to row-echelon matrix. This can be used as one method of solution of linear equations using matrices. You do this by changing the linear equations into the matrix teraugmentasi and operate it. After a row-echelon matrix, do back substitution to get the values ​​of these variables.
Example: Given the linear equation
Determine the value of x, y and z
Answer:
Form into a matrix equation:
 

Operate the matrix
 B1 x 1,. To change a 11 to 1
B2 - 1.B1. To change a 21 to 0

B3 - 2.B1. To change a 31 t 
B2 x 1,. To change a 22 to 1

B3 + 3.B2. To change a 32 to 0
 
B3 x 1/3,. To change a 33 to 1

Operations in Matrix


Two matrices are equal if these matrices have the same order and each element of the seletak same.
If A and B is a matrix that has the same order, then the sum of A + B is the matrix element results from the sum of A and B are seletak. Similarly, the results of the difference. Matrices that have different orders can not be added or subtracted.
Number of k matrix A is a matrix that berordo with A and each element of the element A is k times the seletak. Defined: If k is any scalar k A = A k is the matrix obtained from A by multiplying each element by k. Negative of A or-A is the matrix obtained from A by multiplying all elements by -1. For every A true A + (-A) = 0. Applicable law in addition and subtraction matrices:
a.) A + B = B + A
b.) A + (B + C) = (A + B) + C
c.) k (A + B) = kA + kB = (A + B) k, k = scalar
Product matrix A is air-orders MXP with berordo pxn matrix B can be written as a matrix C = [c ij] berordo mxn where c ij = a i1 b 1j + a i2 b 2j + ... A + b ip pj