Code covered by the BSD License  

Highlights from
slatec

from slatec by Ben Barrowes
The slatec library converted into matlab functions.

[scasumresult,n,cx,incx]=scasum(n,cx,incx);
function [scasumresult,n,cx,incx]=scasum(n,cx,incx);
scasumresult=[];
persistent i ix scasum ; 

if isempty(scasumresult), scasumresult=0; end;
%***BEGIN PROLOGUE  SCASUM
%***PURPOSE  Compute the sum of the magnitudes of the real and
%            imaginary elements of a complex vector.
%***LIBRARY   SLATEC (BLAS)
%***CATEGORY  D1A3A
%***TYPE      COMPLEX (SASUM-S, DASUM-D, SCASUM-C)
%***KEYWORDS  BLAS, LINEAR ALGEBRA, SUM OF MAGNITUDES OF A VECTOR
%***AUTHOR  Lawson, C. L., (JPL)
%           Hanson, R. J., (SNLA)
%           Kincaid, D. R., (U. of Texas)
%           Krogh, F. T., (JPL)
%***DESCRIPTION
%
%                B L A S  Subprogram
%    Description of Parameters
%
%     --Input--
%        N  number of elements in input vector(s)
%       CX  complex vector with N elements
%     INCX  storage spacing between elements of CX
%
%     --Output--
%   SCASUM  single precision result (zero if N .LE. 0)
%
%     Returns sums of magnitudes of real and imaginary parts of
%     components of CX.  Note that this is not the L1 norm of CX.
%     CASUM = sum from 0 to N-1 of ABS(REAL(CX(IX+I*INCX))) +
%             ABS(IMAG(CX(IX+I*INCX))),
%     where IX = 1 if INCX .GE. 0, else IX = 1+(1-N)*INCX.
%
%***REFERENCES  C. L. Lawson, R. J. Hanson, D. R. Kincaid and F. T.
%                 Krogh, Basic linear algebra subprograms for Fortran
%                 usage, Algorithm No. 539, Transactions on Mathematical
%                 Software 5, 3 (September 1979), pp. 308-323.
%***ROUTINES CALLED  (NONE)
%***REVISION HISTORY  (YYMMDD)
%   791001  DATE WRITTEN
%   890831  Modified array declarations.  (WRB)
%   890831  REVISION DATE from Version 3.2
%   891214  Prologue converted to Version 4.0 format.  (BAB)
%   900821  Modified to correct problem with a negative increment.
%           (WRB)
%   920501  Reformatted the REFERENCES section.  (WRB)
%***end PROLOGUE  SCASUM
cx_shape=size(cx);cx=reshape(cx,1,[]);
if isempty(i), i=0; end;
if isempty(ix), ix=0; end;
%***FIRST EXECUTABLE STATEMENT  SCASUM
scasumresult = 0.0e0;
if( n<=0 )
cx_shape=zeros(cx_shape);cx_shape(:)=cx(1:numel(cx_shape));cx=cx_shape;
csnil=dbstack(1); csnil=csnil(1).name(1)~='@';
if csnil&&~isempty(inputname(1)), assignin('caller','FUntemp',n); evalin('caller',[inputname(1),'=FUntemp;']); end
if csnil&&~isempty(inputname(3)), assignin('caller','FUntemp',incx); evalin('caller',[inputname(3),'=FUntemp;']); end
if csnil&&~isempty(inputname(2)), assignin('caller','FUntemp',cx); evalin('caller',[inputname(2),'=FUntemp;']); end
return;
end;
%
if( incx==1 )
%
%     Code for increment equal to 1.
%
for i = 1 : n;
scasumresult = scasumresult + abs(real(cx(i))) + abs(imag(cx(i)));
end; i = fix(n+1);
else;
%
%     Code for increment not equal to 1.
%
ix = 1;
if( incx<0 )
ix =fix((-n+1).*incx + 1);
end;
for i = 1 : n;
scasumresult = scasumresult + abs(real(cx(ix))) + abs(imag(cx(ix)));
ix = fix(ix + incx);
end; i = fix(n+1);
cx_shape=zeros(cx_shape);cx_shape(:)=cx(1:numel(cx_shape));cx=cx_shape;
csnil=dbstack(1); csnil=csnil(1).name(1)~='@';
if csnil&&~isempty(inputname(1)), assignin('caller','FUntemp',n); evalin('caller',[inputname(1),'=FUntemp;']); end
if csnil&&~isempty(inputname(3)), assignin('caller','FUntemp',incx); evalin('caller',[inputname(3),'=FUntemp;']); end
if csnil&&~isempty(inputname(2)), assignin('caller','FUntemp',cx); evalin('caller',[inputname(2),'=FUntemp;']); end
return;
end;
cx_shape=zeros(cx_shape);cx_shape(:)=cx(1:numel(cx_shape));cx=cx_shape;
csnil=dbstack(1); csnil=csnil(1).name(1)~='@';
if csnil&&~isempty(inputname(1)), assignin('caller','FUntemp',n); evalin('caller',[inputname(1),'=FUntemp;']); end
if csnil&&~isempty(inputname(3)), assignin('caller','FUntemp',incx); evalin('caller',[inputname(3),'=FUntemp;']); end
if csnil&&~isempty(inputname(2)), assignin('caller','FUntemp',cx); evalin('caller',[inputname(2),'=FUntemp;']); end
end
%DECK SCG

Contact us at files@mathworks.com