Structuring problems for analysis with electronic spreadsheets
| dc.contributor.author | Archer, Norman P. | |
| dc.contributor.author | McMaster University, Faculty of Business | |
| dc.contributor.department | None | en_US |
| dc.date.accessioned | 2015-06-29T14:32:43Z | |
| dc.date.available | 2015-06-29T14:32:43Z | |
| dc.date.issued | 1987-01 | |
| dc.description | 26 p. ; Includes bibliographical references (p. 25-26). ; "January, 1987."; This work was supported by a grant from the Natural Sciences and Engineering Research Council of Canada. | en_US |
| dc.description.abstract | This paper discusses a method which uses directed graphs to reveal the underlying structure spreadsheet problems. Advantage is taken of the fact that there is a great deal of similarity among the two main classes of spreadsheet problems: those which are acyclic, and those involving cycles. For acyclic problems, a logical numbering can be assigned to cells, and the cell relationships may be shown in the form of a Cell Relationship Diagram (CRD . For cyclic problems, a pseudo CRD is used in order to break the cycles and derive pseudo-logical numberings for the cells. Cyclic spreadsheets are shown to contain fixed point problems, and three iterative numerical solution techniques (successive substitution, Newton-Raphson, and Gauss-Seidel) are described in terms of implementation and convergence properties, and demonstrated with several examples. | en_US |
| dc.identifier.uri | http://hdl.handle.net/11375/17645 | |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | Research and working paper series (McMaster University. Faculty of Business) | |
| dc.relation.ispartofseries | no. 267 | |
| dc.title | Structuring problems for analysis with electronic spreadsheets | en_US |
| dc.type | Article | en_US |