Suppose we need to solve the problem of computing expression is: ∫(X³ + X² + 2X + 3sinx)dx
We can solve this problem very intelligently by breaking down it into smaller sub problems, each of which
we can then solve by using a small collection of specific rules. Above figure shows the problem tree which is generated by using this technique of problem decomposition, we can solve very large problems very easily.
Here we can use recursive integration program that works as follow :-
Check whether the given problem immediately solvable (Yes or No).
If "Yes", then the solution is returned directly.
If "No", then the integrator check whether the given problem can decompose into smaller problem (Yes or No).
If "Yes", then create sub smaller problems and call itself recursively.
If "No", then problem is not solvable and decompose able.
Please subscribe, like, share and comment.
we can then solve by using a small collection of specific rules. Above figure shows the problem tree which is generated by using this technique of problem decomposition, we can solve very large problems very easily.
Here we can use recursive integration program that works as follow :-
Check whether the given problem immediately solvable (Yes or No).
If "Yes", then the solution is returned directly.
If "No", then the integrator check whether the given problem can decompose into smaller problem (Yes or No).
If "Yes", then create sub smaller problems and call itself recursively.
If "No", then problem is not solvable and decompose able.
Please subscribe, like, share and comment.
Comments
Post a Comment