457-0532/01 – Linear Algebra with Matlab (LAM)

Gurantor departmentDepartment of Applied MathematicsCredits6
Subject guarantorprof. Ing. Tomáš Kozubek, Ph.D.Subject version guarantorprof. Ing. Tomáš Kozubek, Ph.D.
Study levelundergraduate or graduateRequirementChoice-compulsory
Year2Semesterwinter
Study languageCzech
Year of introduction2007/2008Year of cancellation2009/2010
Intended for the facultiesFEIIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
KOZ75 prof. Ing. Tomáš Kozubek, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2
Part-time Credit and Examination 2+2

Subject aims expressed by acquired skills and competences

To expand the knowledge of the students using Matlab by concepts that are important in understanding of modern methods used in informatics and numerical solution of engineering problems.

Teaching methods

Lectures
Seminars
Project work

Summary

Advanced concepts of linear algenra are key ingredients in solving of many engineering problems such as signal analysis, implemetation of search engins, optimal control or numerical solution of differential equations. In this course, the students can expand their knowledge of linear algebra using Matlab by working knowledge of concepts that are important in understanding of modern methods used in informatics and numerical solution of engineering problems with a special stress on matrix decompositions and the spectral theory.

Compulsory literature:

G. Strang, Linear Algebra and its Application, Academic Press, New York 1980. G. H. Golub, and C. van Loan, Matrix Computations, The John Hopkins University Press, London 1989. L. N. Trefethen and D. Bau, Numerical Linear Algebra, SIAM Philadelphia 1997. ISBN 0-89871-361-7.

Recommended literature:

Příklady z lineární algebry II a materiál k domácímu projektu.

Way of continuous check of knowledge in the course of semester

Conditions for credit: Project (minimum 15 points).

E-learning

Other requirements

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Lectures: Introduction to MATLAB (overview of toolboxes and functions, help, basic elements, editing of the n-dimensional arrays). MATLAB programming (control flow statements, 2D and 3D graphics). Advanced MATLAB functions (graphical user interface). Analytic geometry (computation of the inclinations and distances in 2D and 3D). Sparse matrix structures (band, profile, row compressed, column compressed). Solution of the linear algebraic systems (nonsingular, underdetermined and overdetermined systems). Gauss elimination (row and column versions, pivotization). LU and Choleski decomposition (row and column versions, pivotization). Reordering algorithms (SYMAMD, COLAMD, SLOAN, RCM). QR decomposition (Givens and Householder transforms). Eigenvalues and spectral decomposition (QR and LR algorithms, shift). Singular decomposition, pseudoinverse. Lanczos method and conjugate gradient method. Project presentation. Exercises: Introduction to MATLAB, functions overview, editing of the n-dimensional arrays. MATLAB programming techniques, the use of the control flow statements, 2D and 3D graphic functions). Graphical user interface implementation. Computation of the inclinations and distances in 2D and 3D). Sparse matrix structures implementation (band, profile, row compressed, column compressed). Solvers of the linear algebraic systems (nonsingular, underdetermined and overdetermined systems). Solution of the linear algebraic system using Gauss elimination (row and column versions, pivotization). Solution of the linear algebraic system using LU and Choleski decomposition (row and column versions, pivotization). Application of the reordering algorithms (SYMAMD, COLAMD, SLOAN, RCM). The use of the QR decomposition (implementation, Givens and Householder transforms, applications). Computation of the eigenvalues and spectral decomposition (implementation, QR and LR algorithms, shift, applications). Computation of the singular decomposition and pseudoinverse (implementation, application). Lanczos method and conjugate gradient method (implementation, applications). Project presentation. Projects: Application oriented project in MATLAB (max. 30 points).

Conditions for subject completion

Full-time form (validity from: 1960/1961 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of pointsMax. počet pokusů
Exercises evaluation and Examination Credit and Examination 100 (100) 51 3
        Exercises evaluation Credit 30 (30) 0 3
                Project Project 30  0 3
        Examination Examination 70 (70) 0 3
                Written examination Written examination 70  0 3
Mandatory attendence participation:

Show history

Conditions for subject completion and attendance at the exercises within ISP:

Show history

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2009/2010 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 2 Choice-compulsory study plan
2009/2010 (B2647) Information and Communication Technology (1103R031) Computational Mathematics K Czech Ostrava 2 Choice-compulsory study plan
2008/2009 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 2 Choice-compulsory study plan
2008/2009 (B2647) Information and Communication Technology (1103R031) Computational Mathematics K Czech Ostrava 2 Choice-compulsory study plan
2007/2008 (B2647) Information and Communication Technology (1103R031) Computational Mathematics P Czech Ostrava 2 Choice-compulsory study plan
2007/2008 (B2647) Information and Communication Technology (1103R031) Computational Mathematics K Czech Ostrava 2 Choice-compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction



2009/2010 Winter