add up a sequence of values

mul

multiply a sequence of values

 Calling Sequence add(f, i = m..n) add(f, i = m..n, step) add(f, i = x) add(f, i in x) add(x) add[pairwise]( .. ) add[pairwise=p]( .. ) mul(f, i = m..n) mul(f, i = m..n, step) mul(f, i = x) mul(f, i in x) mul(x)

Parameters

 f - expression i - name m, n - numerical values x - expression step - (optional) numerical value p - positive integer value or false

Description

 • The add function is used to add up an explicit sequence of values, and the mul function multiply together an explicit sequence of values.
 • The descriptions that follow will all refer to add, but everything also applies to mul, except that addition is replaced by multiplication.
 • The simplest form is add(m..n) or mul(m..n), which operates on the sequence m, m+1, ..., M, producing the sum or product of those values respectively. If n-m is an integer, them M equals n, otherwise n-1 < M < n.
 • A more typical invocation is add(f(i), i = m..n) which computes the sum or product of f(m), f(m+1), ..., f(M), where M is as described above. Note that add(i, i = m..n) is equivalent to the simpler form add(m..n).
 • If the expression f does not contain the iteration variable i, then a sequence of identical values is operated on. In this case, the iteration variable can also be omitted from the range argument. That is, add(y, i=m..n) is equivalent to add(y, m..n), and computes y * (floor(n-m)+1) (or y ^ (floor(n-m)+1) for mul).
 • All of the above invocations of add and mul can take an optional last argument, step, which can take one of two forms:
 – If step is a numeric value, the sequence to be added or multiplied consists of the values m, m+step, ..., M where n-step < M <= n.
 – If step is of the form numelems=N, where N is an integer, the sequence consists of the values m, m+q, ..., n, where q = (n - m) / (N - 1).
 • The add(f(i), i = x) form, where x is not a range operates on a sequence by applying f to each operand or entry of x. Here, x would most commonly be a set or list, but it could be any other data structure to which op can be applied, such as a sum or product. For tables Arrays, Vectors, and Matrices, the entries of x are scanned rather than the operands.
 • The form add(f(i), i in x) is equivalent to add(f(i), i = x).
 • The add function, when called in the form add(f(i), i=m..n), performs pairwise summation to minimize the accumulated round-off error when adding floating-point values. This is done using a divide-and-conquer approach, where the sequence of values to be added is split in half, each half added separately (perhaps using pairwise summation), and then the two results added together.
 • By default, sequences of 50 or fewer elements, whether the original input, or the result of splitting a larger input, are not split further. This threshold can be changed using the pairwise option.
 • If specified in the form pairwise=N, where N is an integer greater than or equal to 4, splitting is not done for subsequences of fewer than N elements.
 • Specifying the option as just pairwise is equivalent to pairwise=4.
 • A smaller value of the pairwise option may result in less rounding error, but will increase time and space overhead due to recursive calls to add. For most applications, omitting the pairwise option (equivalent to pairwise=51) is preferred.
 • Pairwise summation can be disabled entirely by using the option pairwise=false.
 • The add and mul functions are related to performing similar operations via a for-loop. The semantics can best be understood by defining them in terms of the for-loop as follows. In this description, the expression f is typically a function of i.

 add(f, i=m..n) ==  S := 0; old := i; for i from m to n do S := S + f end do; i := old; S; # the result add(f, i=x)    ==  S := 0; old := i; for i in x do S := S + f end do; i := old; S; # the result mul(f, i=m..n) ==  P := 1; old := i; for i from m to n do P := P * f end do; i := old; P; # the result mul(f, i=x)    ==  P := 1; old := i; for i in x do P := P * f end do; i := old; P; # the result

 Note: In either form, the add and mul commands are generally more efficient than the for-loop versions because the for-loop versions construct many intermediate sums and products.
 Note: The limits m and n must evaluate to numerical constants, that is, integers, fractions, or floating-point numbers. To compute a symbolic sum or product expression in terms of a symbolic limit, use the sum and product functions. As a special case, m may evaluate to infinity, or n may evaluate to -infinity. If m is greater than n, add returns 0 and mul returns 1.
 • The index variable i refers to the instance of the variable that is in scope in the context where the call to add or mul occurs. At the top-level (outside of any procedure or module), the global variable is used. Within a procedure or module, the local variable of that name is used. If the procedure or module does not explicitly declare a local variable with that name, an implicit local declaration is quietly generated.
 Regardless of whether the index variable is local or global, the value that the variable had before the invocation of add or mul is restored afterwards. Thus the value of that variable is not affected.
 • When x is a sparse Matrix, Vector or Array, only the non-zero entries are scanned.  Otherwise, regardless of the indexing function, or storage, the entire index-space of the object is scanned.
 • See also the sum and product functions for computing symbolic sums and products.  These functions return an expression for an indefinite (or definite) sum or product, rather than an explicit sum or product.

 • The add and mul commands are thread safe as of Maple 15, provided that evaluating the expression f is thread safe.  Further the index variable i must not be shared between threads.  Using a procedure local is advised.

Examples

The add and mul commands are used to add up or multiply an explicit sequence of values.

 > $\mathrm{mul}\left(i,i=1..5\right)$
 ${120}$ (1)
 > $\mathrm{add}\left({i}^{2},i=1..5\right)$
 ${55}$ (2)
 > $\mathrm{add}\left(a\left[i\right]{x}^{i},i=0..5\right)$
 ${{a}}_{{5}}{}{{x}}^{{5}}{+}{{a}}_{{4}}{}{{x}}^{{4}}{+}{{a}}_{{3}}{}{{x}}^{{3}}{+}{{a}}_{{2}}{}{{x}}^{{2}}{+}{{a}}_{{1}}{}{x}{+}{{a}}_{{0}}$ (3)

The add and mul commands can be used on matrices.

 > $M≔\mathrm{Matrix}\left(\left[\left[1,2\right],\left[3,4\right]\right]\right)$
 ${M}{≔}\left[\begin{array}{cc}{1}& {2}\\ {3}& {4}\end{array}\right]$ (4)
 > $\mathrm{add}\left(M,k=1..2\right)$
 $\left[\begin{array}{cc}{2}& {4}\\ {6}& {8}\end{array}\right]$ (5)
 > $\mathrm{mul}\left(M,k=1..3\right)$
 $\left[\begin{array}{cc}{37}& {54}\\ {81}& {118}\end{array}\right]$ (6)

The "in" and "=" notations produce the same result for both add and mul.

 > $L≔\left[\mathrm{seq}\left(i,i=1..5\right)\right]$
 ${L}{≔}\left[{1}{,}{2}{,}{3}{,}{4}{,}{5}\right]$ (7)
 > $\mathrm{add}\left(i,i=L\right)$
 ${15}$ (8)
 > $\mathrm{add}\left(i,i\phantom{\rule[-0.0ex]{0.3em}{0.0ex}}\mathbf{in}\phantom{\rule[-0.0ex]{0.3em}{0.0ex}}L\right)$
 ${15}$ (9)
 > $\mathrm{mul}\left(x-i,i=L\right)$
 $\left({x}{-}{1}\right){}\left({x}{-}{2}\right){}\left({x}{-}{3}\right){}\left({x}{-}{4}\right){}\left({x}{-}{5}\right)$ (10)
 > $\mathrm{mul}\left(x-i,i\phantom{\rule[-0.0ex]{0.3em}{0.0ex}}\mathbf{in}\phantom{\rule[-0.0ex]{0.3em}{0.0ex}}L\right)$
 $\left({x}{-}{1}\right){}\left({x}{-}{2}\right){}\left({x}{-}{3}\right){}\left({x}{-}{4}\right){}\left({x}{-}{5}\right)$ (11)

The add command works only for numeric ranges.

 > $\mathrm{add}\left({i}^{2},i=0..n\right)$
 > $\mathrm{sum}\left({i}^{2},i=0..n\right)$
 $\frac{{\left({n}{+}{1}\right)}^{{3}}}{{3}}{-}\frac{{\left({n}{+}{1}\right)}^{{2}}}{{2}}{+}\frac{{n}}{{6}}{+}\frac{{1}}{{6}}$ (12)
 > $\mathrm{add}\left(i,i=\mathrm{\infty }..0\right)$
 ${0}$ (13)
 > $\mathrm{mul}\left(i,i=0..-\mathrm{\infty }\right)$
 ${1}$ (14)
 > $\mathrm{product}\left(i,i=1..\mathrm{\infty }\right)$
 ${\mathrm{\infty }}$ (15)

The pairwise option has the potential to reduce round-off error. In the following example, calculations are being done to 10 significant digits, for which the correct result is 21097.45589.

 > $\mathrm{Digits}≔10:$
 > $\mathrm{add}\left(\mathrm{sqrt}\left(i\cdot 1.0\right),i=1..1000\right)$
 ${21097.45588}$ (16)
 > $\mathrm{add}\left[\mathrm{pairwise}=4\right]\left(\mathrm{sqrt}\left(i\cdot 1.0\right),i=1..1000\right)$
 ${21097.45589}$ (17)

Disabling pairwise summation introduces significant round-off error.

 > $\mathrm{add}\left[\mathrm{pairwise}=\mathrm{false}\right]\left(\mathrm{sqrt}\left(i\cdot 1.0\right),i=1..1000\right)$
 ${21097.45585}$ (18)

Compatibility

 • The mul command was updated in Maple 2015.
 • The step parameter was introduced in Maple 2015.
 • The add command was updated in Maple 2021.
 • The p parameter was introduced in Maple 2021.
 • The pairwise option was introduced in Maple 2021.