9600-1011/02 – Parallel Numerical Libraries (PNK)

Gurantor departmentIT4InnovationsCredits6
Subject guarantordoc. Mgr. Vít Vondrák, Ph.D.Subject version guarantordoc. Mgr. Vít Vondrák, Ph.D.
Study levelundergraduate or graduateRequirementCompulsory
Year1Semestersummer
Study languageEnglish
Year of introduction2016/2017Year of cancellation
Intended for the facultiesFAST, FEI, USP, FSIntended for study typesFollow-up Master
Instruction secured by
LoginNameTuitorTeacher giving lectures
VON15 doc. Mgr. Vít Vondrák, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2

Subject aims expressed by acquired skills and competences

Upon the successful completion of the course students will be able to actively use new terms in the field of parallel libraries.

Teaching methods

Lectures
Tutorials
Project work

Summary

Students are introduced to efficient parallel implementations of numerical methods and their application for parallel solutions to large-scale problems. These problems cannot be solved on common personal computers as they require supercomputers. Students will learn about the most frequently used, mainly open-source, libraries for numerical computations. Within the practical trainings the emphasis will be put on implementation in C/C++ or FORTRAN.

Compulsory literature:

1. Gene H. Golub and Charles F. Van Loan, Matrix Computations (Johns Hopkins Studies in the Mathematical Sciences), Dec 27, 2012 2. Manuals to all taught parallel numerical libraries.

Recommended literature:

Other appropriate resources available on the Internet.

Way of continuous check of knowledge in the course of semester

E-learning

Other requirements

No other requirements.

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

1. Introduction to FORTRAN Programming Language 2. Set of Tools for Numerical Computing o Trilinos, Eigen, Armadillo, MKL o PETSc a nadstavby (SLEPc, TAO, libMesh, Deal.II, FEniCS) 3. BLAS Specification (Basic linear algebra subroutines) o Existing Implementations (ATLAS, GotoBLAS, MKL, CUBLAS) 4. Methods for Solving Dense Systems of Linear Equations o Storage of Dense Matrices o Blocking for Efficient Utilization of Processor Cache Memory o Indefinite or Singular Matrix Systems of Linear Equations and Their Solution o Stabilization through Pivotization and RBT (Random Butterfly Transformation) method o Existing Implementations (LINPACK, LAPACK, ScaLAPACK, MKL, CULA, PLASMA, MAGMA) 5. Methods for Solving Sparse Systems of Linear Equations o Storage of Sparse Matrices (CSR, CSC, …) o Recasting for Retaining Sparsity o Graph Methods (METIS and other) o Multi-frontal Method o Super-nodal Method o Existing Implementations (MUMPS, SuperLU, PaStiX, PARDISO) 6. Methods for Solving Large-scale Eigenvalue Problems o QR decomposition, Connection with Cholesky Decomposition o Spectral and Singular Value Decomposition o Iterative Methods o Existing Implementations (e.g. ARPACK, BLOPEX, FEAST, MKL) 7. Preconditioning, Domain Decomposition, and Multigrid Methods o Existing Implementations (Hypre, Trilinos, PETSc) 8. Methods of Discretization in HPC Context o FDM, FEM o Existing Implementations (libMesh, Deal.II, FEniCS)

Conditions for subject completion

Full-time form (validity from: 2017/2018 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of pointsMax. počet pokusů
Credit and Examination Credit and Examination 100 (100) 51
        Credit Credit 30  15
        Examination Examination 70  36 3
Mandatory attendence participation: - obligatory participation at all exercises, 2 apologies are accepted - defended 3 semestral projects

Show history

Conditions for subject completion and attendance at the exercises within ISP: Completion of all mandatory tasks within individually agreed deadlines.

Show history

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2024/2025 (N0541A170008) Computational and Applied Mathematics (S02) Computational Methods and HPC VM P English Ostrava 1 Compulsory study plan
2023/2024 (N0541A170008) Computational and Applied Mathematics (S02) Computational Methods and HPC VM P English Ostrava 1 Compulsory study plan
2022/2023 (N0541A170008) Computational and Applied Mathematics (S02) Computational Methods and HPC VM P English Ostrava 1 Compulsory study plan
2021/2022 (N0541A170008) Computational and Applied Mathematics (S02) Computational Methods and HPC VM P English Ostrava 1 Compulsory study plan
2020/2021 (N0541A170008) Computational and Applied Mathematics (S02) Computational Methods and HPC VM P English Ostrava 1 Compulsory study plan
2019/2020 (N0541A170008) Computational and Applied Mathematics (S02) Computational Methods and HPC VM P English Ostrava 1 Compulsory study plan
2018/2019 (N2658) Computational Sciences (2612T078) Computational Sciences P English Ostrava 2 Compulsory study plan
2017/2018 (N2658) Computational Sciences (2612T078) Computational Sciences P English Ostrava 2 Compulsory study plan
2016/2017 (N2658) Computational Sciences (2612T078) Computational Sciences P English Ostrava 2 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction

Předmět neobsahuje žádné hodnocení.