1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
function f = luflop (L, U)
%LUFLOP
%
% f = luflop (L, U)
%
% Given an LU factorization, compute how many flops took to compute it. This
% is the same as (assuming U has a zero-free diagonal):
%
% Lnz = full (sum (spones (L))) - 1 ;
% Unz = full (sum (spones (U')))' - 1 ;
% f = 2*Lnz*Unz + sum (Lnz) ;
%
% except that no extra workspace is allocated for spones (L) and spones (U).
% L and U must be sparse.
%
% Note: the above expression has a subtle undercount when exact numerical
% cancelation occurs. Try [L,U,P] = lu (sparse (ones (10))) and then
% luflop (L,U).
% UMFPACK Version 4.6, Copyright (c) 2005 by Timothy A. Davis.
% All Rights Reserved. Type umfpack_details for License.
help luflop
error ('luflop mexFunction not found! Use umfpack_make to compile luflop.') ;
|
