Mentions légales du service

Skip to content
Snippets Groups Projects
Commit 89ba0e72 authored by hhakim's avatar hhakim
Browse files

Minor change.

Fix matfaust.Faust API doc indentation.
parent fb21f452
No related branches found
No related tags found
No related merge requests found
...@@ -7,7 +7,7 @@ ...@@ -7,7 +7,7 @@
% the project : <http://Faust.gforge.inria.fr> % the project : <http://Faust.gforge.inria.fr>
% %
%% License: %% License:
% Copyright (2019): Hakim Hadj-djilani, Nicolas Bellot, Adrien Leman, Thomas Gautrais, Luc Le Magoarou, Remi Gribonval % Copyright (2018): Hakim Hadj-djilani, Nicolas Bellot, Adrien Leman, Thomas Gautrais, Luc Le Magoarou, Remi Gribonval
% INRIA Rennes, FRANCE % INRIA Rennes, FRANCE
% http://www.inria.fr/ % http://www.inria.fr/
% %
...@@ -47,9 +47,9 @@ ...@@ -47,9 +47,9 @@
%> %>
%> This class provides a Matlab array-like interface for operations with FAµST data structures, which correspond to matrices that can be written exactly as the product of sparse matrices. %> This class provides a Matlab array-like interface for operations with FAµST data structures, which correspond to matrices that can be written exactly as the product of sparse matrices.
%> %>
%>A FAµST data structure is designed to allow fast matrix-vector multiplications together with reduced memory storage compared to what would be obtained by manipulating directly the corresponding (dense) Matlab array. %> A FAµST data structure is designed to allow fast matrix-vector multiplications together with reduced memory storage compared to what would be obtained by manipulating directly the corresponding (dense) Matlab array.
%> %>
%>A particular example is the matrix associated to the discrete Fourier transform, which can be represented exactly as a FAµST, leading to a fast and compact implementation (see FaustFactory.dft()). %> A particular example is the matrix associated to the discrete Fourier transform, which can be represented exactly as a FAµST, leading to a fast and compact implementation (see FaustFactory.dft()).
%> %>
%> Although sparse matrices are more interesting for optimization it's not forbidden to define a Faust as a product of dense matrices or a mix of dense and sparse matrices. %> Although sparse matrices are more interesting for optimization it's not forbidden to define a Faust as a product of dense matrices or a mix of dense and sparse matrices.
%> %>
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment