This project is part of Scientific Computing compulsory course in Computer Engineering & Informatics Department of University of Patras for Winter Semester 2023 (Semester 7).
-
Notifications
You must be signed in to change notification settings - Fork 0
This project consists of three tasks: 1) analyzing the execution time of chol(A) for Cholesky decomposition to verify cubic complexity. 2) working with sparse matrices stored efficiently using few vectors, similar to the LAPACK format, to solve tridiagonal systems, 3) implementing tensor operations with multidimensional arrays, such as ttt or ttv.
miltiadiss/CEID_NY343-Scientific-Computing
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project consists of three tasks: 1) analyzing the execution time of chol(A) for Cholesky decomposition to verify cubic complexity. 2) working with sparse matrices stored efficiently using few vectors, similar to the LAPACK format, to solve tridiagonal systems, 3) implementing tensor operations with multidimensional arrays, such as ttt or ttv.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published