/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q7.6-42E We quote from a text on computer... [FREE SOLUTION] | 91影视

91影视

We quote from a text on computer graphics (M. Beeler et al., 鈥淗AKMEM,鈥 MIT Artificial Intelligence Report AIM-239, 1972):

Here is an elegant way to draw almost circles on a point-plotting display.

CIRCLE ALGORITHM:

NEW X = OLD X - K*OLD Y;

NEW Y = OLD Y + K*NEW X.

This makes a very round ellipse centered at the origin with its size determined by the initial point. The circle algorithm was invented by mistake when I tried to save a register in a display hack!

(In the preceding formula, k is a small number.) Here, a dynamical system is defined in 鈥渃omputer lingo.鈥 In our terminology, the formulas are

x(t+1)=x(t)-ky(t)y(t+1)=y(t)+kx(t+1)

a. Find the matrix of this transformation. [Note the entryx(t+1)in the second formula.]

b. Explain why the trajectories are ellipses, as claimed.

Short Answer

Expert verified

(a). The matrix isA=1-kk1-k2

(b). An eliptic rotation matrix, but the ellipse that it concerns has semi axes that aren't parallel to the coordinate axes.

Step by step solution

01

Define stability:

Stability is one of the most basic requirements for numerical models, which extends to mostly linear problems. If every solution that was initially close to it is always close to it. It is said to be stable and asymptotically stable although initially every solution close to it meets t

02

Find the matrix:(a)

Given,

x(t+1)=x(t)-ky(t)y(t+1)=y(t)+kx(t+1)=y(t)+k(x(t)-ky(t))=kx(t)+1-k2y(t)

The matrix isA=1-kk1-k2

03

Explain the trajectories are ellipses:(b)

We can see that,

detA=1A=1-sinsincos2

We can assume,

0,2

This is an eliptic rotation matrix, but the ellipse that it concerns has semiaxes that aren't parallel to the coordinate axes. Still, we can conclude that the given equations will form an ellipse.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91影视!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

If v鈬赌is an eigenvector of matrix A, show that is in the image of A.or in the kernel ofA.

Arguing geometrically, find all eigenvectors and eigenvalues of the linear transformations in Exercises 15 through 22. In each case, find an eigenbasis if you can, and thus determine whether the given transformation is diagonalizable.

Orthogonal projection onto a line L in R3.

True or false? If the determinant of a 2 脳 2 matrix A is negative, then A has two distinct real eigenvalues.

Three holy men (let鈥檚 call them Anselm, Benjamin, and Caspar) put little stock in material things; their only earthly possession is a small purse with a bit of gold dust. Each day they get together for the following bizarre bonding ritual: Each of them takes his purse and gives his gold away to the two others, in equal parts. For example, if Anselm has 4 ounces one day, he will give 2 ounces each to Benjamin and Caspar.

(a) If Anselm starts out with 6 ounces, Benjamin with 1 ounce, and Caspar with 2 ounces, find formulas for the amounts a(t), b(t), and c(t) each will have after tdistributions.

Hint: The vector [111],[1-10]and[10-1], and will be useful.

(b) Who will have the most gold after one year, that is, after 365 distributions?

Arguing geometrically, find all eigenvectors and eigenvalues of the linear transformations in Exercises 15 through 22. In each case, find an eigenbasis if you can, and thus determine whether the given transformation is diagonalizable.

Orthogonal projection onto a line L inR3.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.