|
-
Jul 24th, 2010, 03:35 PM
#1
Thread Starter
Hyperactive Member
Multidimensional Root Finders in .NET
I was just wondering if anyone knows of an implementation of a multidimensional root finder in .NET that is free and preferably open source. I have found implementations in C but haven't found anything in .NET. Have any of you guys seen anything?
-
Jul 24th, 2010, 04:46 PM
#2
Re: Multidimensional Root Finders in .NET
I'm sorry, I don't know any. You might have better luck trying to find an external library written in another language. Of course, arbitrary multidimensional root finding is horrifically complicated in general so I wouldn't recommend writing your own routine.
The time you enjoy wasting is not wasted time.
Bertrand Russell
<- Remember to rate posts you find helpful.
-
Jul 24th, 2010, 10:40 PM
#3
Thread Starter
Hyperactive Member
Re: Multidimensional Root Finders in .NET
I'm not surprised. I've seen plenty of implementations in C but nothing in .NET. I am thinking of trying to port one but even that is a pretty big job as there are a lot of utility libraries that most of the implementations rely on. Just to make sure, do you know of anything in Java? At least that would be easier to port.
-
Jul 25th, 2010, 12:44 AM
#4
Lively Member
Re: Multidimensional Root Finders in .NET
 Originally Posted by wy125
I'm not surprised. I've seen plenty of implementations in C but nothing in .NET. I am thinking of trying to port one but even that is a
Why do you want it in .net rather than just calling a C library from .net? Sounds horribly slow.
-
Jul 25th, 2010, 01:41 AM
#5
Re: Multidimensional Root Finders in .NET
 Originally Posted by wy125
Just to make sure, do you know of anything in Java?
Nope, C only for me, and barely. I myself would put a lot of time into a search for (easily...) callable libraries before porting an existing solver to .NET. You might even find an API for a computational package you and your users have access to (Matlab, Mathematica, Maple, many more, methinks).
I'm curious, what's your application for such a solver in .NET? I just wonder because .NET seems to be for heavily UI-driven apps, instead of computation-driven ones (as a gross generalization).
The time you enjoy wasting is not wasted time.
Bertrand Russell
<- Remember to rate posts you find helpful.
-
Jul 25th, 2010, 08:47 AM
#6
Thread Starter
Hyperactive Member
Re: Multidimensional Root Finders in .NET
 Originally Posted by Kallog
Why do you want it in .net rather than just calling a C library from .net? Sounds horribly slow.
Well the application I am working on is a web app and we're using .NET so it's easiest just to use a .NET library. It can be a pain to wrap dll's but I still may end up doing so. My primary concern about this approach is that the app we are developing might possibly be serving multiple simultaneous clients but when you wrap a DLL in .NET the methods must be marked static (this still may be possible but it makes me uncomfortable). As far as speed is concerned, you are most certainly correct about it being slower but I'm not sure exactly how much slower (we'll know if it 'feels' too slow). If we find that it's too slow we'll have to take another approach.
-
Jul 25th, 2010, 08:50 AM
#7
Thread Starter
Hyperactive Member
Re: Multidimensional Root Finders in .NET
 Originally Posted by jemidiah
I'm curious, what's your application for such a solver in .NET? I just wonder because .NET seems to be for heavily UI-driven apps, instead of computation-driven ones (as a gross generalization).
It's part of a web application. It's a simulation of a process. The root solver is for the shooting method portion for solving a boundary value problem for a system of ODEs.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|