Mechanical Engineering > GATE 2023 > Numerical Methods
The initial value problem
dy/dt+2y=0 , y(0)=1
is solved numerically using the forward Euler's method with a constant and positive time step of Δt.
Let yn represent the numerical solution obtained after n steps. The condition |yn+1|≤|yn| is satisfied if and only if Δt does not exceed _______.
(Answer in integer)

Explanation

Correct : 1

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science