--%>

Problem on Maple

(a) Solve the following  by:

(i) First reducing the system of first order differentiat equations to a second order differential equation.

(ii) Decoupling the following linear system of equations

1230_maple.jpg

(b) Using the eigenvalue approach, determine  the asymptotic behaviour of solution for t.

(c) Using Maple:

(i) Check your solution that you have  found in (above) and graph your solution with respect to time.

(ii) Graph the components of X(t) against each other and identify the direction of solution as t → infinity

   Related Questions in Mathematics

  • Q : Properties of a group How can we say

    How can we say that the pair (G, o) is a group. Explain the properties which proof it.

  • Q : Profit-loss based problems A leather

    A leather wholesaler supplies leather to shoe companies. The manufacturing quantity requirements of leather differ depending upon the amount of leather ordered by the shoe companies to him. Due to the volatility in orders, he is unable to precisely predict what will b

  • Q : Probability and Stochastic assignment

    Introduction to Probability and Stochastic Assignment 1: 1. Consider an experiment in which one of three boxes containing microchips is chosen at random and a microchip is randomly selected from the box.

  • Q : Who firstly discovered mathematical

    Who firstly discovered mathematical theory for random walks, that rediscovered later by Einstein?

  • Q : How do it? integral e^(-t)*e^(tz) t

    integral e^(-t)*e^(tz) t between 0 and infinity for Re(z)<1

  • Q : Explain trading of call options Explain

    Explain trading of call options.

  • Q : Explain Black–Scholes model Explain

    Explain Black–Scholes model.

  • Q : Row-echelon matrix Determine into which

    Determine into which of the following 3 kinds (A), (B) and (C) the matrices (a) to (e) beneath can be categorized:       Type (A): The matrix is in both reduced row-echelon form and row-echelon form. Type (B): The matrix

  • Q : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the a

  • Q : Set Theory & Model of a Boolean Algebra

    II. Prove that Set Theory is a Model of a Boolean Algebra The three Boolean operations of Set Theory are the three set operations of union (U), intersection (upside down U), and complement ~.  Addition is set