Abstract
Summary A golden rectangle is characterized by the fact that if an inscribed square is removed from one end, then the remaining rectangle is similar to the original one. By iterating this process of removing a square, one obtains an infinite sequence of nested golden rectangles which converges to a point. One can construct other sequences of rectangles by starting from arbitrary, not necessarily golden, rectangles. The goal of this paper is to analyze the behavior of these sequences, primarily by modeling the process using linear algebra.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
