MATLAB can solve differential equations using the dsolve command. dsolve Symbolic solution of ordinary differential equations. Example: syms y(x) Dy (x) = diff(y) D2y (x) = diff(y,2) yGs1 = dsolve(D2y+2*Dy+y==8) yGs2 = dsolve(D2y+2*Dy+y==e, y(@)==1, y(8)==2) Problems: Solve the following differential equations, using the initial conditions when applicable 1. yı"+ 8y, + 16y1 = 0, yı(0) = 1, y,(0) = 0 2. y2"- 3y, + 2y2 = 0, yz( 1) = 1, y,(1) = 4 3. ys"+ 8y, + 17y3 = 0 4. +8y" + 16y4 =0 5. y – 729ys = 0 Script e A Save CReset E MATLAB Documentation 1 5olve the given Homogeneous Differential Equations with Constant Coefficients 2 XInitialize the Variables 3 4 5 Solve the equation y"+8y'+16y=e, y(e)=1, y' (8)=0. Save your answer as y1; 6 7 žsolve the equation y"-3y"+2y=e, y_2(1)=1, y_2'(1)=4. Save your answer as y2; 9 Xsolve the equation y"+8y'+17y=e. Save your answer as y3; 10 11 solve the equation y^{IV} + 8y" + 16y=e. Save your answer as y4; 12 13 Xsolve the equation y^{VI}-729y=D. Save your answer as y1;

MATLAB can solve differential equations using the dsolve command. dsolve Symbolic solution of ordinary differential equations. Example: syms y(x) Dy (x) = diff(y) D2y (x) = diff(y,2) yGs1 = dsolve(D2y+2Dy+y==8) yGs2 = dsolve(D2y+2Dy+y==e, y(@)==1, y(8)==2) Problems: Solve the following differential equations, using the initial conditions when applicable 1. yı"+ 8y, + 16y1 = 0, yı(0) = 1, y,(0) = 0 2. y2"- 3y, + 2y2 = 0, yz( 1) = 1, y,(1) = 4 3. ys"+ 8y, + 17y3 = 0 4. +8y" + 16y4 =0 5. y – 729ys = 0 Script e A Save CReset E MATLAB Documentation 1 5olve the given Homogeneous Differential Equations with Constant Coefficients 2 XInitialize the Variables 3 4 5 Solve the equation y"+8y'+16y=e, y(e)=1, y' (8)=0. Save your answer as y1; 6 7 žsolve the equation y"-3y"+2y=e, y_2(1)=1, y_2'(1)=4. Save your answer as y2; 9 Xsolve the equation y"+8y'+17y=e. Save your answer as y3; 10 11 solve the equation y^{IV} + 8y" + 16y=e. Save your answer as y4; 12 13 Xsolve the equation y^{VI}-729y=D. Save your answer as y1;

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

A fish-finder is a device used by anglers to find fish in a lake. If the fish-finder finds a fish, it will sound an alarm. It uses depth readings to determine whether to sound an alarm. For our purposes, the fish-finder will decide that a fish is swimming past if:there are four consecutive depth readings which form a strictly increasing sequence (such as 3 4 7 9) (which we will call "Fish Rising"), orthere are four consecutive depth readings which form a strictly decreasing sequence (such as 9 6 5 2) (which we will call "Fish Diving"), orthere are four consecutive depth readings which are identical (which we will call "Constant Depth").All other readings will be considered random noise or debris, which we will call "No Fish."Create a Python program called "fishfinder_firstname_lastname" that takes 1 input of string of 4 numbers separated with comma. Your program must display "Fish Rising", "Fish Diving.", "Fish At Constant Depth" or "No Fish".Example:30,10,20,20 Must display No…
Answer in C++ Only The Company has announced for his staff to have a free Ride service. The City of Jamshedpur has a different structure - all of its N rides are arranged in a circle, counting from 1 to N in a clockwise direction. The Company restaurant is located at Rider number 1. There is a single ring road that runs over the perimeter of this circle and connects all the rides. There are also N - 1 different travel agencies available in Bhiwani. For all the different ride points A and B there is a single connector that connects these points and belongs to the Kth shuttle agency where the K distance between A and B is clockwise, that is, there are K-1 boarding points between points A and B according to by clock. Name the shuttle as (A, B). So if N = 4, the first agency has shuttles (1,2), (2,3), (3,4), (4,1), the second agency has shuttles (1,3)), (2,4) and third-party shuttles are (1,4), (2,1), (3,2), (4,3). If the shuttle connects points A and B, it is possible to move from A to B…
Write a program that uses a User-Defined Function (UDF) that solves for the value of Y as a function of X in the equation shown below:
In C program Given a set of numbers representing the customers visiting the store and a number n, print all the customer numbers that has visited the store n times. If there isn't any, print "No lucky customer" instead. Input The first number represents the count of customers visiting the store.The succeeding numbers are the customers of the store represented by numbers 0 to 99.The last number is the lucky number n. 56015115153Output The customers that have visited the store n times. If there's more than one customer, print them numerically in new lines. If there isn't any, print "No lucky customer". 15
Using C++ Language, Write a program that uses a User-Defined Function (UDF) that solves for the value of Y as a function of X in the equation shown below:
Let A = {a, b, c}, B = {x, y}, and C = {0, 1}.
Write a program in C to compute the roots of a quadratic equation (ax² + bx + c = 0). The roots of the equation can be calculated using the following formulae: x1 = (-b + sqrt(b? – 4ac))/2a x2 = (-b – sqrt(b? - 4ac ))/2a Note: If b? – 4ac is negative, the roots are complex. Write your program in the space provided. Using text editor, type and save your program. Test your program to solve the following equations: (a) x + 2x – 15 = 0 (b) 4x +x+3 =0 (c) x? – 8x + 16 = 0 (d) 7x – 5 = 0 Use CodeBlocks. Take a picture of the code and results. A flow chart to solve the problem is shown below. Start Input a,b,c True a -- 0 False X = -/b disc = b2 - 4ac Print Not a Quadratic Equation Print x False True disc --0 False X = -b/2a X = -b/2a disc >0 True ximg, - sort(disc)/2a ximag, - sgrt(disc)/2a xr = -b/(2*a) X - (-b + sgrt(disc)/2a X, - (-b - sart(disc) y2a Print x, X2 Print x, X Print xr, ximg, ximg Stop
Computer Science Write a Java program that reads a line and a line segment and then determines whether they intersect or not. When they overlap completely, consider that as intersecting. Use variables ((lp1x, lp1y), (lp2x, lp2y)) to represent a line and ((sp1x, sp1y), (sp2x, sp2y)) to represent a line segment
Write a program that calculate the values of (X + Y) x (X – Y) where X, Y = 0, 1, 2, …, 9and prints the following table:X|Y 0 1 2 3 4 5 6 7 8 90| 0 -1 -4 -9 -16 -25 -36 -49 -64 -811| 1 0 -3 -8 -15 -24 -35 -48 -63 -802| 4 3 0 -5 -12 -21 -32 -45 -60 -773| 9 8 5 0 -7 -16 -27 -40 -55 -724| 16 15 12 7 0 -9 -20 -33 -48 -655| 25 24 21 16 9 0 -11 -24 -39 -566| 36 35 32 27 20 11 0 -13 -28 -457| 49 48 45 40 33 24 13 0 -15 -328| 64 63 60 55 48 39 28 15 0 -179| 81 80 77 72 65 56 45 32 17 0
Program a simplified Galton board in python. It is required that: The user must select the number of rows n of the board The distribution resulting from dropping the beads should be displayed on the screen. Display an animation where the number of rows n increases over time.All resulting distributions must be scaled to the interval [0, 1], so that it is possible toappreciate the convergence to the normal distribution. Consider n from 1 to 80.
function result = result = ''; 1 tokens_to_str_code(token_mat, time_unit) 3 for i =1:size(token_mat,1) 4 5 if(token_mat (i,1) if(token_mat(i,2) > 4*time_unit) result = strcat(result,"-"); elseif((token_mat(i,2) > time_unit) && (token_mat(i,2) 8*time_unit) result = strcat(result,"/"); elseif((token_mat(i,2) 11 == 0) 12 13 14 4*time_unit) && (token_mat(i,2) < 8*time_unit)) 15 result strcat(result," "); %3D 16 end 17 end 18 end 19 end 20 21 Check Test Expected Got tokens %3D [1 4; е 3; 1 3; е 1; 1 3; е 1; 1 1; ө 1; 1 1 ]; time_unit = .5; disp( tokens_to_str_code( tokens, time_unit )) tokens = [ 0 4; 1 1457; 0 463; 1 1457; 0 463; 1 497; 0 1423; 1 1457; ---/..--.. --.---/..--.. о 463; 1 1457; 0 463; 1 1457; ө 3343; 1 497; ө 463; 1 497; 0 463; 1 1457; 0 1423; 1 1457; 0 463; 1 497; 0 463; 1 497; e 379 ]; time_unit = 240; disp( tokens_to_str_code( tokens, time_unit ))
Write code for a full application that contains all of the code for determining the shortest routes using Dijkstra's method, as well as a test programme: