High-Performance Linear Algebra & FFT implementations in C++20 and Rust
This project implements high-performance operations with Toeplitz matrices, specifically focusing on matrix-vector products and the solution of Toeplitz systems. A core component of this research is the exploration of Fast Fourier Transform (FFT) algorithms as the primary mechanism for reducing computational complexity to
All implementations are benchmarked against state-of-the-art baselines to evaluate language-specific optimization capabilities in C++ and Rust.
This research is conducted under the supervision of Professor Jeremy Johnson and Kartik Ohlan.
- Lead Researcher: Kartik Ohlan
- Email: Kartik7ohlan@gmail.com
convolution/
βββ Makefile
βββ README.md
βββ data/
βββ src/
β βββ cpp_impl/
β β βββ toeplitz.hpp
β β βββ toeplitz.cpp
β βββ rust_impl/
β βββ Cargo.toml
β βββ src/
β βββ lib.rs
β βββ main.rs
βββ utils/
β βββ cpp_utils/
β β βββ bench_harness.cpp
β β βββ io_helpers.hpp
β βββ rust_utils/
β βββ mod.rs