Function Intersection

I have a java program that does function graphing among other things and the next thing i wanted to put in was finding intersections of functions on the cartesian plane. I have some ideas of how to go about it but they arent working too well. Does anyone know of an algorithm for finding the intersection of two functions?

[329 byte] By [lpunderground64a] at [2007-11-27 7:28:31]

«« New to SJSWS7
»» Java Memory Leaks

# 1

if your functions are f(x) and g(x), define:h(x) = f(x) - g(x)and find the roots of h: http://en.wikipedia.org/wiki/Root_finding

Hippolytea at 2007-7-12 19:08:39 >

top of Java-index,Java Essentials,Java Programming...

# 2

Do you know of a good site that explains how to use the Newton-Raphson algorithm in java?

lpunderground64a at 2007-7-12 19:08:39 >

# 3

> Do you know of a good site that explains how to use

> the Newton-Raphson algorithm in java?

It's a straightforward algorithm -- where does Java come into it?

Anyway, I don't know of a specific web page for that, but I've

heard there's a way to search the Internet ;-)

Hippolytea at 2007-7-12 19:08:39 >

Java programming resources: FAQs, tutorials, compiler and browser download sites, documentation, books lists, IDEs, etc.

Function Intersection

Java Essentials New Topic

Java Essentials Hot Topic

Java Essentials

All Classified