EC > GATE 2016 SET-2 > Numerical Methods
The ordinary differential equation dx/dt=-3x+2, with x(0)=1 is to be solved using the forward Euler method. The largest time step that can be used to solve the equation without making the numerical solution unstable is

Explanation

Correct : 0.667

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