Official government website of the Government of the Kingdom of Saudi ArabiaHow is it achieved?

The Saudi official educational websites' links end with edu.sa

Check the domain's scope in the browser's address bar before sharing your data.

Trusted government websites use a protocol HTTPS

Check that the site uses HTTPS protocol to encrypt the connection.

Digital Government Authority Registered with the Digital Government Authority with no: 20260416249

What are you looking for?

Colleges

Numerical Linear Algebra

The course description: The course includes the following topics: matrix analysis (primitive operations on rows, inverse of the square matrix, determinants and their properties - classical companion matrix, eigenvalues and eigenvectors, distillation/transformation to a diagonal matrix, Schur analysis, Jordan analysis and singular value (skew) analysis, standard matrix multiplication - matrix norm - matrix dominant diagonally), direct solution methods (linear systems of triangles, Gauss method and analysis of upper and lower matrix, Cholesky method, Hausdorff method, QR analysis), iterative methods (Jacobi method - Gauss-Seidel method, relaxation method, Krylov space iteration methods - sequential gradient method), group projects related to one or more research areas of the course, computational calculations and error analysis.
Credit hours: 4
Objectives of the course :

The goal of the course is to enable students to do the following:
• Definition of multiple types of matrices and their properties, with the formulation of various examples.
• Describe the direct and indirect methods, and identify the advantages and disadvantages of each.
• Comparison between direct and indirect methods for solving linear systems based on error analysis and the number of computational operations.
• Derivation of the formulas of: the “Jacobi” method, the “Gaus-Siedel” method, and the “supra-continuous relaxation” method.
• Applying multiple iterative methods to solve real-world problems in diverse scientific fields.
• Studying the effectiveness of iterative methods in solving real-world problems involving large systems of equations, through group projects.
• Demonstrate the importance and effectiveness of iterative methods in solving real-world problems through teamwork.
• Using the repetition methods based on the “Krylovian space of particles” to solve more advanced problems.

Course outputs :

1.0 Knowledge and Understanding:
1.1 Upon successful completion of the course, students will be able to define and write various examples of multiple types of matrices.
1.2 Upon successful completion of the course, students will be able to describe direct and indirect methods and identify the advantages and disadvantages of each.
2.0 Skills:
2.1 Upon successful completion of the course, students will be able to compare the direct and indirect methods for solving linear systems using error analysis and the number of computational operations.
2.2 Upon successful completion of the course, students will be able to derive formulas for the Jacobi method, the Gauss-Seidel method, and the successive relaxation method. .
2.3 Upon successful completion of the course, students will be able to apply several iterative methods to solve real-world problems in diverse scientific fields.
2.4 Upon successful completion of the course, students will be able to study the effectiveness of iterative methods in solving real-world problems involving large systems of equations, through a group project.
3.0 Values, Independence, and Responsibility
3.1 Upon successful completion of the course, students will be able to demonstrate the importance and efficiency of iterative methods in solving real-world problems through teamwork.
3.2 Upon successful completion of the course, students will be able to use the iterative methods in the Krylov space to solve more advanced problems.

Additional information:

Last update date of the page content:

survey_v2

Cookies

This website uses special cookies to ensure ease of use, improve your browsing experience, and clarify the terms and policies related to About user privacy. By continuing to browse this website, you acknowledge that you accept the use of cookies and the terms of the Privacy Policy