반응형 전체 글13 Rotation Matrix in Linear Algebra What is Rotation Matrix? The rotation Matrix refers to the dynamic change of the angle of the vector without affecting the length or magnitude. Normally, the coordinates of the vector are defined by (x, y). x = R.cos(α), y = R.sin(α) After rotating the matrix at any new angle, we can define x and y as: x = R.cos(α + β) y = R.sin(α + β) with the help of the formula, cos(α + β) = cos(α)cos(β) - si.. 2023. 8. 5. Hermitian Matrix in Linear Algebra Introduction to Hermitian matrix A matrix in which the value is remaining the same after being conjugate and transposed in respected order. So in order to find if one matrix is a Hermitian matrix, we must have an understanding of how to conjugate and transpose. Conjugate Matrix The way to conjugate the matrix is to multiply the complex value of the matrix with -1 and keep the non-complex value a.. 2023. 8. 5. Polar coordinates in 2D Introduction to Polar Coordinates When referring to Polar coordinates in Linear Algebra, there is a vector or point on a two-dimensional system whose coordinates comprise magnitude and the angle respected to one direction. This means we can draw one vector on a plane by knowing the magnitude of the vector and its angle. The magnitude is the length of one vector from the pole which represent by R.. 2023. 8. 5. Finding GCD or HCF What is GCD or HCF? GCD (Great Common Devisor) or HCF (High Common Factor) is the biggest common devisor or factor of two or more numbers. There are a few algorithms out there to find GCD or HCF, such as Prime Factor and Euclid's Division Algorithm. Prime Factorization Prime Factorization is a method of finding GCD by calculating the factors of each number and comparing them for matching. For in.. 2023. 7. 31. 이전 1 2 3 4 다음 반응형
