
02330239
a
1999f.04345
Hvorecky, Jozef
Trencansky, Ivan
Recursive computations in spreadsheets.
Yang, WeiChi et al., Proceedings of the third Asian technology conference in mathematics. Springer, Singapore (ISBN 9814021156). 290299 (1998).
1998
Springer, Singapore
EN
R20
In the paper two methods of implementation of recursive formulas in spreadsheets are presented. Both methods use (rectangular) fields of cells for their computations. The first method is ``direct'': initial values (corresponding to trivial cases of recursion) are written in selected fields. Then, the recursive formula to other(s). Finally, the formula is spread along a necessary large area  until the required result is reached. Second method allows to compute ``recursive tables''  tables where the results of a twoargument recursive function is located on the intersection of the corresponding rows and columns. In this case each field in the area must contain the complete recursive formula. The computation is iterative  all values in the table are computed ``simultaneously''. Actually, the number of iterations equals to the maximum depth of recursion. Examples of such computations as well as sufficient conditions for the success of the method will also be presented. (Authors' abstract)