📄 toon0563.m
字号:
% toon0563 -- Fast Algorithm for Matrix Multiplication
%
% The Beylkin-Coifman-Rokhlin method is to
% 1. Take the 2-d Wavelet Transform of the matrix
% -> 2. ``compress'' the 2-d wavelet transform
% 3. ``stretch'' it into a nonstandard form
% 4. apply the nonstandard form by matrix multiplication.
%
% How many non-negligible vales in WT ?
%
figure;
worder = sort(abs(wmat(:)));
plot(log(reverse(worder)+eps))
title('log(sort(abs(NS[Matrix])))')
xlabel('Ordered Coefficient'); ylabel('log(size(coefficient))');
%% Part of Wavelab Version 850% Built Tue Jan 3 13:20:43 EST 2006% This is Copyrighted Material% For Copying permissions see COPYING.m% Comments? e-mail wavelab@stat.stanford.edu
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -