M.petrishchev: Created page with "= Analytical Geometry & Linear Algebra – II = * '''Course name''': Analytical Geometry & Linear Algebra – II * '''Code discipline''': CSE204 * '''Subject area''': Math ==..."

2022-06-28T10:46:41Z

Created page with "= Analytical Geometry & Linear Algebra – II = * '''Course name''': Analytical Geometry & Linear Algebra – II * '''Code discipline''': CSE204 * '''Subject area''': Math ==..."

New page

= Analytical Geometry & Linear Algebra – II =
* '''Course name''': Analytical Geometry & Linear Algebra – II
* '''Code discipline''': CSE204
* '''Subject area''': Math
== Short Description ==
This course covers matrix theory and linear algebra, emphasizing topics useful in other disciplines. Linear algebra is a branch of mathematics that studies systems of linear equations and the properties of matrices. The concepts of linear algebra are extremely useful in physics, data sciences, and robotics. Due to its broad range of applications, linear algebra is one of the most widely used subjects in mathematics.

== Course Topics ==
{| class="wikitable"
|+ Course Sections and Topics
|-
! Section !! Topics within the section
|-
| Linear equation system solving by using the vector-matrix approach ||
# The geometry of linear equations. Elimination with matrices
# Matrix operations, including inverses
# LU and LDU factorization
# Transposes and permutations
# Vector spaces and subspaces
# The null space: Solving Ax=0 and Ax=b
# Row reduced echelon form. Matrix rank
# Numerical methods for solving systems of linear algebraic equations
|-
| Linear regression analysis, QR-decomposition ||
# Independence, basis and dimension
# The four fundamental subspaces
# Orthogonal vectors and subspaces
# Projections onto subspaces Projection matrices
# Least squares approximations
# Gram-Schmidt orthogonalization and A = QR
|-
| Matrix Diagonalization ||
# Complex Numbers
# Hermitian and Unitary Matrices
# Eigenvalues and eigenvectors
# Matrix diagonalization
|-
| Symmetric, positive definite and similar matrices. Singular value decomposition ||
# Linear differential equations.
# Symmetric matrices.
# Positive definite matrices
# Similar matrices.
# Left and right inverses, pseudoinverse
# Singular value decomposition (SVD)
|}

== Intended Learning Outcomes (ILOs) ==

=== ILOs defined at three levels ===

We specify the intended learning outcomes at three levels: conceptual knowledge, practical skills, and comprehensive skills.

==== Level 1: What concepts should a student know/remember/explain? ====
By the end of the course, the students should be able to ...
* explain the geometrical interpretation of the basic operations of vector algebra,
* restate equations of lines and planes in different forms,
* interpret the geometrical meaning of the conic sections in the mathematical expression,
* give the examples of the surfaces of revolution,
* understand the value of geometry in various fields of science and techniques.

==== Level 2: What basic practical skills should a student be able to perform? ====
By the end of the course, the students should be able to ...
* perform the basic operations of vector algebra,
* use different types of equations of lines and planes to solve the plane and space problems,
* represent the conic section in canonical form,
* compose the equation of quadric surface.

==== Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios? ====
By the end of the course, the students should be able to ...
* list basic notions of vector algebra,
* recite the base form of the equations of transformations in planes and spaces,
* recall equations of lines and planes,
* identify the type of conic section,
* recognize the kind of quadric surfaces.

== Grading ==

=== Course grading range ===
{| class="wikitable"
|+
|-
! Grade !! Range !! Description of performance
|-
| A. Excellent || 85-100 || -
|-
| B. Good || 65-84 || -
|-
| C. Satisfactory || 50-64 || -
|-
| D. Fail || 0-49 || -
|}

=== Course activities and grading breakdown ===
{| class="wikitable"
|+
|-
! Activity Type !! Percentage of the overall course grade
|-
| Midterm || 30
|-
| Tests|| 20 (10 for each)
|-
| Final exam || 50
|-
| In-class participation || 5 extras
|}

=== Recommendations for students on how to succeed in the course ===
* Participation is important. Attending lectures is the key to success in this course.
* Review lecture materials before classes to do well.
* Reading the recommended literature is obligatory, and will give you a deeper understanding of the material.

== Resources, literature and reference materials ==

=== Open access resources ===
* Gilbert Strang. Linear Algebra and Its Applications, 4th Edition, Brooks Cole, 2006. ISBN: 9780030105678
* Gilbert Strang. Introduction to Linear Algebra, 4th Edition, Wellesley, MA: Wellesley-Cambridge Press, 2009. ISBN: 9780980232714
* Gilbert Strang, Brett Coonley, Andrew Bulman-Fleming. Student Solutions Manual for Strang’s Linear Algebra and Its Applications, 4th Edition, Thomson Brooks, 2005. ISBN-13: 9780495013259

== Activities and Teaching Methods ==
{| class="wikitable"
|+ Teaching and Learning Methods within each section
|-
! Teaching Techniques !! Section 1 !! Section 2 !! Section 3 !! Section 4
|-
| Problem-based learning (students learn by solving open-ended problems without a strictly-defined solution) || 0 || 0 || 0 || 0
|-
| Project-based learning (students work on a project) || 0 || 0 || 0 || 0
|-
| Modular learning (facilitated self-study) || 0 || 0 || 0 || 0
|-
| Differentiated learning (provide tasks and activities at several levels of difficulty to fit students needs and level) || 1 || 1 || 1 || 1
|-
| Contextual learning (activities and tasks are connected to the real world to make it easier for students to relate to them) || 0 || 0 || 0 || 0
|-
| Business game (learn by playing a game that incorporates the principles of the material covered within the course) || 0 || 0 || 0 || 0
|-
| Inquiry-based learning || 0 || 0 || 0 || 0
|-
| Just-in-time teaching || 0 || 0 || 0 || 0
|-
| Process oriented guided inquiry learning (POGIL) || 0 || 0 || 0 || 0
|-
| Studio-based learning || 0 || 0 || 0 || 0
|-
| Universal design for learning || 0 || 0 || 0 || 0
|-
| Task-based learning || 0 || 0 || 0 || 0
|}
{| class="wikitable"
|+ Activities within each section
|-
! Learning Activities !! Section 1 !! Section 2 !! Section 3 !! Section 4
|-
| Lectures || 1 || 1 || 1 || 1
|-
| Interactive Lectures || 1 || 1 || 1 || 1
|-
| Lab exercises || 1 || 1 || 1 || 1
|-
| Experiments || 0 || 0 || 0 || 0
|-
| Modeling || 0 || 0 || 0 || 0
|-
| Cases studies || 0 || 0 || 0 || 0
|-
| Development of individual parts of software product code || 0 || 0 || 0 || 0
|-
| Individual Projects || 0 || 0 || 0 || 0
|-
| Group projects || 0 || 0 || 0 || 0
|-
| Flipped classroom || 0 || 0 || 0 || 0
|-
| Quizzes (written or computer based) || 1 || 1 || 1 || 1
|-
| Peer Review || 0 || 0 || 0 || 0
|-
| Discussions || 1 || 1 || 1 || 1
|-
| Presentations by students || 0 || 0 || 0 || 0
|-
| Written reports || 0 || 0 || 0 || 0
|-
| Simulations and role-plays || 0 || 0 || 0 || 0
|-
| Essays || 0 || 0 || 0 || 0
|-
| Oral Reports || 0 || 0 || 0 || 0
|}

== Formative Assessment and Course Activities ==

=== Ongoing performance assessment ===

==== Section 1 ====
# How to perform Gauss elimination?
# How to perform matrices multiplication?
# How to perform LU factorization?
# How to find complete solution for any linear equation system Ax=b?

==== Section 2 ====
# What is linear independence of vectors?
# Define the four fundamental subspaces of a matrix?
# How to define orthogonal vectors and subspaces?
# How to define orthogonal complements of the space?
# How to find vector projection on a subspace?
# How to perform linear regression for the given measurements?
# How to find an orthonormal basis for the subspace spanned by the given vectors?

==== Section 3 ====

# Give the definition of Hermitian Matrix.
# Give the definition of Unitary Matrix.
# How to find matrix for the Fourier transform?
# When we can make fast Fourier transform?
# How to find eigenvalues and eigenvectors of a matrix?
# How to diagonalize a square matrix?

==== Section 4 ====

# How to solve linear differential equations?
# Make the definition of symmetric matrix?
# Make the definition of positive definite matrix?
# Make the definition of similar matrices?
# How to find left and right inverses matrices, pseudoinverse matrix?
# How to make singular value decomposition of the matrix?

=== Final assessment ===
==== Section 1 ====
# Find linear independent vectors (exclude dependent): <math display="inline">\overrightarrow{a}=[4,0,3,2]^T</math>, <math display="inline">\overrightarrow{b}=[1,-7,4,5]^T</math>, <math display="inline">\overrightarrow{c}=[7,1,5,3]^T</math>, <math display="inline">\overrightarrow{d}=[-5,-3,-3,-1]^T</math>, <math display="inline">\overrightarrow{e}=[1,-5,2,3]^T</math>. Find <math display="inline">rank(A)</math> if <math display="inline">A</math> is a composition of this vectors. Find <math display="inline">rank(A^T)</math>.
# Find <math display="inline">E</math>: <math display="inline">EA=U</math> (<math display="inline">U</math> – upper-triangular matrix). Find <math display="inline">L=E^-1</math>, if <math display="inline">A=\left(
\begin{array}{ccc}
2 & 5 & 7 \\
6 & 4 & 9 \\
4 & 1 & 8 \\
\end{array}
\right)</math>.
# Find complete solution for the system <math display="inline">Ax=b</math>, if <math display="inline">b=[7,18,5]^T</math> and <math display="inline">A=\left(
\begin{array}{cccc}
6 & -2 & 1 & -4 \\
4 & 2 & 14 & -31 \\
2 & -1 & 3 & -7 \\
\end{array}
\right)</math>. Provide an example of vector b that makes this system unsolvable.
==== Section 2 ====
# Find the dimensions of the four fundamental subspaces associated with <math display="inline">A</math>, depending on the parameters <math display="inline">a</math> and <math display="inline">b</math>: <math display="inline">A=\left(
\begin{array}{cccc}
7 & 8 & 5 & 3 \\
4 & a & 3 & 2 \\
6 & 8 & 4 & b \\
3 & 4 & 2 & 1 \\
\end{array}
\right)</math>.
# Find a vector <math display="inline">x</math> orthogonal to the Row space of matrix <math display="inline">A</math>, and a vector <math display="inline">y</math> orthogonal to the <math display="inline">C(A)</math>, and a vector <math display="inline">z</math> orthogonal to the <math display="inline">N(A)</math>: <math display="inline">A=\left(
\begin{array}{ccc}
1 & 2 & 2 \\
3 & 4 & 2 \\
4 & 6 & 4 \\
\end{array}
\right)</math>.
# Find the best straight-line <math display="inline">y(x)</math> fit to the measurements: <math display="inline">y(-2)=4</math>, <math display="inline">y(-1)=3</math>, <math display="inline">y(0)=2</math>, <math display="inline">y(1)-0</math>.
# Find the projection matrix <math display="inline">P</math> of vector <math display="inline">[4,3,2,0]^T</math> onto the <math display="inline">C(A)</math>: <math display="inline">A=\left(
\begin{array}{cc}
1 & -2 \\
1 & -1 \\
1 & 0 \\
1 & 1 \\
\end{array}
\right)</math>.
# Find an orthonormal basis for the subspace spanned by the vectors: <math display="inline">\overrightarrow{a}=[-2,2,0,0]^T</math>, <math display="inline">\overrightarrow{b}=[0,1,-1,0]^T</math>, <math display="inline">\overrightarrow{c}=[0,1,0,-1]^T</math>. Then express <math display="inline">A=[a,b,c]</math> in the form of <math display="inline">A=QR</math>
==== Section 3 ====
# Find eigenvector of the circulant matrix <math display="inline">C</math> for the eigenvalue = <math display="inline">{c}_1</math>+<math display="inline">{c}_2</math>+<math display="inline">{c}_3</math>+<math display="inline">{c}_4</math>: <math display="inline">C=\left(
\begin{array}{cccc}
{c}_1 & {c}_2 & {c}_3 & {c}_4 \\
{c}_4 & {c}_1 & {c}_2 & {c}_3 \\
{c}_3 & {c}_4 & {c}_1 & {c}_2 \\
{c}_2 & {c}_3 & {c}_4 & {c}_1 \\
\end{array}
\right)</math>.
# Diagonalize this matrix: <math display="inline">A=\left(
\begin{array}{cc}
2 & 1-i \\
1+i & 3 \\
\end{array}
\right)</math>.
# <math display="inline">A</math> is the matrix with full set of orthonormal eigenvectors. Prove that <math display="inline">AA=A^HA^H</math>.
# Find all eigenvalues and eigenvectors of the cyclic permutation matrix <math display="inline">P=\left(
\begin{array}{cccc}
0 & 1 & 0 & 0 \\
0 & 0 & 1 & 0 \\
0 & 0 & 0 & 1 \\
1 & 0 & 0 & 0 \\
\end{array}
\right)</math>.
==== Section 4 ====
<ol>
<li>Find <math display="inline">det(e^A)</math> for <math display="inline">A=\left(
\begin{array}{cc}
2 & 1 \\
2 & 3 \\
\end{array}
\right)</math>.</li>
<li>Write down the first order equation system for the following differential equation and solve it:
<math display="inline">d^3y/dx+d^2y/dx-2dy/dx=0</math>
<math display="inline">y''(0)=6</math>, <math display="inline">y'(0)=0</math>, <math display="inline">y(0)=3</math>.
Is the solution of this system will be stable?</li>
<li>For which <math display="inline">a</math> and <math display="inline">b</math> quadratic form <math display="inline">Q(x,y,z)</math> is positive definite:
<math display="inline">Q(x,y,z)=ax^2+y^2+2z^2+2bxy+4xz</math></li>
<li>Find the SVD and the pseudoinverse of the matrix <math display="inline">A=\left(
\begin{array}{ccc}
1 & 0 & 0 \\
0 & 1 & 1 \\
\end{array}
\right)</math>.</li></ol>

=== The retake exam ===
Exams will be paper-based and will be conducted in a form of problem solving, where the problems will be similar to those mentioned above. Students will be given 1-2 hours to complete the exam.
First retake will be conducted in the same form as the midterm and final exams. The weight of the retake exam will be the same as the all course.
Second retake will be conducted in the same form as the midterm and final exams. The weight of the retake exam will be the same as the all course.

BSc: Analytic Geometry And Linear Algebra II.s23.previous version - Revision history

M.petrishchev: Created page with "= Analytical Geometry & Linear Algebra – II = * '''Course name''': Analytical Geometry & Linear Algebra – II * '''Code discipline''': CSE204 * '''Subject area''': Math ==..."