[n,sa,sx,incx,sy,incy]=saxpy(n,sa,sx,incx,sy,incy);

function [n,sa,sx,incx,sy,incy]=saxpy(n,sa,sx,incx,sy,incy);
persistent i ix iy m mp1 ns ; 

if isempty(i), i=0; end;
if isempty(ix), ix=0; end;
if isempty(iy), iy=0; end;
if isempty(m), m=0; end;
if isempty(mp1), mp1=0; end;
if isempty(ns), ns=0; end;
%***BEGIN PROLOGUE  SAXPY
%***PURPOSE  Compute a constant times a vector plus a vector.
%***LIBRARY   SLATEC (BLAS)
%***CATEGORY  D1A7
%***TYPE      SINGLE PRECISION (SAXPY-S, DAXPY-D, CAXPY-C)
%***KEYWORDS  BLAS, LINEAR ALGEBRA, TRIAD, 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)
%       SA  single precision scalar multiplier
%       SX  single precision vector with N elements
%     INCX  storage spacing between elements of SX
%       SY  single precision vector with N elements
%     INCY  storage spacing between elements of SY
%
%     --Output--
%       SY  single precision result (unchanged if N .LE. 0)
%
%     Overwrite single precision SY with single precision SA*SX +SY.
%     For I = 0 to N-1, replace  SY(LY+I*INCY) with SA*SX(LX+I*INCX) +
%       SY(LY+I*INCY),
%     where LX = 1 if INCX .GE. 0, else LX = 1+(1-N)*INCX, and LY is
%     defined in a similar way using INCY.
%
%***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)
%   920310  Corrected definition of LX in DESCRIPTION.  (WRB)
%   920501  Reformatted the REFERENCES section.  (WRB)
%***end PROLOGUE  SAXPY
sx_shape=size(sx);sx=reshape(sx,1,[]);
sy_shape=size(sy);sy=reshape(sy,1,[]);
%***FIRST EXECUTABLE STATEMENT  SAXPY
if( n<=0 || sa==0.0e0 )
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
sy_shape=zeros(sy_shape);sy_shape(:)=sy(1:numel(sy_shape));sy=sy_shape;
return;
end;
if( incx==incy )
if( incx<1 )
elseif( incx==1 ) ;
%
%     Code for both increments equal to 1.
%
%     Clean-up loop so remaining vector length is a multiple of 4.
%
m = fix(rem(n,4));
if( m~=0 )
for i = 1 : m;
sy(i) = sy(i) + sa.*sx(i);
end; i = fix(m+1);
if( n<4 )
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
sy_shape=zeros(sy_shape);sy_shape(:)=sy(1:numel(sy_shape));sy=sy_shape;
return;
end;
end;
mp1 = fix(m + 1);
for i = mp1 : 4: n ;
sy(i) = sy(i) + sa.*sx(i);
sy(i+1) = sy(i+1) + sa.*sx(i+1);
sy(i+2) = sy(i+2) + sa.*sx(i+2);
sy(i+3) = sy(i+3) + sa.*sx(i+3);
end; i = fix(n +1);
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
sy_shape=zeros(sy_shape);sy_shape(:)=sy(1:numel(sy_shape));sy=sy_shape;
return;
else;
%
%     Code for equal, positive, non-unit increments.
%
ns = fix(n.*incx);
for i = 1 : incx: ns ;
sy(i) = sa.*sx(i) + sy(i);
end; i = fix(ns +1);
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
sy_shape=zeros(sy_shape);sy_shape(:)=sy(1:numel(sy_shape));sy=sy_shape;
return;
end;
end;
%
%     Code for unequal or nonpositive increments.
%
ix = 1;
iy = 1;
if( incx<0 )
ix =fix((-n+1).*incx + 1);
end;
if( incy<0 )
iy =fix((-n+1).*incy + 1);
end;
for i = 1 : n;
sy(iy) = sy(iy) + sa.*sx(ix);
ix = fix(ix + incx);
iy = fix(iy + incy);
end; i = fix(n+1);
sx_shape=zeros(sx_shape);sx_shape(:)=sx(1:numel(sx_shape));sx=sx_shape;
sy_shape=zeros(sy_shape);sy_shape(:)=sy(1:numel(sy_shape));sy=sy_shape;
return;
end %subroutine saxpy
%DECK SBCG