This repository contains implementations of several fundamental linear algebra algorithms in Scilab. These algorithms were developed as part of a course on Numerical Linear Algebra and include detailed reports in PDF format within each respective directory.
Implementation of the Gaussian Elimination method for solving systems of linear equations.
Implementation of the Jacobi iterative method for solving systems of linear equations.
Implementation of the Gauss-Seidel iterative method for solving systems of linear equations.
Implementation of the Power Method for finding the dominant eigenvalue and corresponding eigenvector of a matrix.
Implementation of the Least Squares method for finding the best-fitting solution to over-determined systems of linear equations.
Implementation of the Gram-Schmidt process for orthogonalizing a set of vectors in an inner product space.
Implementation of the Householder Transformation for QR decomposition and orthogonalization of matrices.
Implementation of the QR Algorithm for eigenvalue decomposition of a matrix.
To use these algorithms, you need to have Scilab installed on your system. You can download it from the official Scilab website.
Each algorithm is located in a .sci
file. To run an algorithm, open the .sci
file in Scilab or execute it:
exec('path_to_algorithm.sci');
Replace path_to_algorithm.sci
with the path to the specific .sci
file you want to run.
- Linear algebra implementations from scratch in Scilab
- Detailed PDF reports
- Educational resource for understanding numerical problems
- Scilab
Each folder contains a PDF report that provides detailed implementation details and example numerical problems (portuguese).
- Gustavo Tironi
This project is licensed under the MIT License. See the LICENSE file for details.