monotonic

# monotonic - Solving Monotonic Functions - - - The...

This preview shows pages 1–2. Sign up to view the full content.

Sheet1 Page 1 Solving Monotonic Functions ------- --------- --------- The Department of Monotonic Functions (DMF) will, among other things, solve equations of the form F(x) = 0, where F is a strictly monotonic function. `F(x) is strictly monotonic' means that whenever x < y, F(x) < F(y). You are asked to write a program to perform this task for fairly arbitrary F. F is input in polish notation. That is, F(x) is calculated by a stack machine as follows. The stack machine has a stack of double precision floating point numbers. Initially the stack is empty. The function is a sequence of symbols and numbers. A number means: push the number into the top of the stack. All numbers begin with a digit: there are no signed numbers. The following are the possible symbols and their meanings: xpush x into the stack +pop the top 2 members of the stack, and push their sum onto the stack -pop the top 2 members of the stack, and push the second value popped minus the first value popped onto the stack *pop the top 2 members of the stack,

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/29/2011 for the course IT 201 taught by Professor K.v.arya during the Spring '11 term at IIT Kanpur.

### Page1 / 2

monotonic - Solving Monotonic Functions - - - The...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online