exactly like white noise.
So these are workarounds. We would love to have a real implementation
of non-linear constraints optimization (KKT conditions, Lagrange
multipliers, all this stuff). As always, contributions are welcome ...
b
submit bug reports, patches, or suggestions for improvement,
see the Apache Commons Math website:
http://commons.apache.org/proper/commons-math/
Luc Maisonobe, on behalf of the Apache Commons community
-
To unsubscribe, e-mail
is far better to use a solver that uses
only the values (like BracketingNthOrderBrentSolver) rather than to
compute an approximate value of the derivative and then use a solver
that relies on derivatives. In fact BracketingNthOrderBrentSolver is
in any case more efficient than Newton-Raphson.
best
esources. This parser uses the constructor defined above as the PLY
file format uses vertices and facets to represent 3D shapes.
Hope this helps,
Luc
>
> Thanks,
>
> M
>
-
To unsubscribe, e-mail: user-unsub
t problems), but you will have to extract the values on one
side and the partial derivatives on the other side, using getValue()
and getPartialDerivatives(). If you want some help on this, you can ask
here a more specific questions, I'll try to provide an answer.
best regards,
Luc
>
>
for this. I will attempt some documentation improvements.
Sorry for that
Luc
>
> Thanks!
>
> Nigel
>
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h...@commons.apache.org
Le 2015-06-23 22:44, Luc Maisonobe a écrit :
Hi Andrew,
Le 23/06/2015 19:08, Andrew E. Davidson a écrit :
sorry if this has been asked many times before. (maybe this can be
added to the FAQ?)
has anyone done any bench marking?
Yes.
The idea of having a math package that is implemented
o be slow.
I am not aware of any benchmarks relative to Dfp (of course it would
depend on the number of digits you would use) with respecto to
primitive double numbers. If you want to do some benchmarks, we would
be happy to see the results.
best regards,
Luc
>
> Thanks.
>
>
es there have been some benchmarks. Yes
Java can be fast (and it can also be slow depending on how
well it is developed, just like all other languages).
best regards,
Luc
>
>
> Kind Regards
>
> Andy
>
>
>
t; On Tue, 09 Jun 2015 23:19:35 +0200, Thomas Neidhart wrote:
>>>>>> On 06/01/2015 09:36 PM, Thomas Neidhart wrote:
>>>>>>> On 06/01/2015 03:52 PM, luc wrote:
>>>>>>>> Le 2015-06-01 15:27, Gilles a écrit :
>>>>>&g
Le 2015-06-01 15:27, Gilles a écrit :
Hello.
On Mon, 01 Jun 2015 15:03:47 +0200, luc wrote:
Le 2015-06-01 14:38, Gilles a écrit :
Hi.
Hi Gilles,
I have a question regarding
public Region createRegion() throws
InsufficientDataException
in ConvexHull2D.
It throws the exception when the
computing
the hull of n >= 3 aligned points, but n < 3 points is something
different to me.
best regards
Luc
Regards,
Gilles
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-
oIndex.get(name)];
System.arraycopy(precomputed, 0, dFdP, 0, precomputed.length);
}
}
Hope this helps,
Luc
>
>
> Thank you,
>
> Kind regards,
>
>
> Bernard Godard
>
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h...@commons.apache.org
website:
http://commons.apache.org/proper/commons-math/
Luc Maisonobe, on behalf of the Apache Commons community
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h
che.org/proper/commons-math/userguide/fitting.html#a17.2_Implemented_Functions>
for an example of how
to fit a polynomial to observed data.
>
> Any advice if very appreciated.
Hope this helps,
Luc
>
> Thanks a ton,
> Andrea
>
> -
Commons Math, including
instructions on how to submit bug reports, patches, or suggestions for
improvement, see the Apache Commons Math website:
http://commons.apache.org/proper/commons-math/
Luc Maisonobe, on behalf of the Apache Commons community
Hello,
There is a bug in 1.4.0 that is fixed in 1.4.1 that affecting my software.
What does it need to be done to move the release forward?
Thank you.
--
Cordialement,
Pier-Luc
um = values[0].getField().getZero();
for (int i = 0; i < values.length; i++) {
sum = sum.add(values[i]);
}
return sum;
}
All field instances provide a getZero() and a getOne() method, so
you can do a similar trick for initializing a multiplicativ
start value or the max number of iterations. I
don't know if you need this level of flexibility in your case.
Hope this helps,
Luc
>
> Many thanks for all your feedback.
>
>
> Thanks a lot
> .
>
>
>
> 2014-08-14 13:47 GMT-03:00 Thomas Vandahl :
>
&
ty class.
You are right, helper methods would be good.
Could you open a Jira issue with this idea so we don't forget it?
best regards,
Luc
>
> With best regards, Alexander Nozik.
>
> -
> To
sidered to be out of Apache Commons Math scope. They belong
to higher level projects that could implement them for their own
specific syntax, and rely on Apache Commons Math to sovle the problem
once it has been translated from strings to structured number
release.
For complete information on Apache Commons Math, including
instructions on how to submit bug reports, patches, or suggestions for
improvement, see the Apache Commons Math website:
http://commons.apache.org/proper/commons-math
Luc Maisonobe, on behalf of the Apache Commons Team
ion, and
the value reamins the same. Then the solver is lost, as its caller told
it there was a zero between t3 and t4, and in fact it finds the value is
always negative.
Your g function should be well behaved, and depend mainly in the t and
functions, hyperbolic
functions, roots, power ... In fact, everything you would find in the
java.util.Math (or org.apache.commons.math3.util.FastMath) for primitive
double is also available in the Dfp class, and in all the classes that
implement org.apache.commons.math3.RealFieldElement.
Hope this h
Le 06/12/2013 15:26, andrea antonello a écrit :
> Hi Luc,
> thanks a ton for your example code, much appreciated.
>
> It took me a little while to understand that this works only with the
> development version :)
>
> I was able to get it working on a small sample of data
us code in the mail, it certainly has
syntax errors and missing parts, it should only be seen as a skeleton.
best regards,
Luc
>
> Cheers,
> Andrea
>
>
>
>>
>>
>>
>> On Thu, Dec 5, 2013 at 5:31 AM, andrea antonello >> wrote:
>>
>>&
erywhere in one big move.
best regards,
Luc
>
> Emmanuel
>
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h...@commons.apache.org
Le 11/10/2013 09:48, Luc Maisonobe a écrit :
> Hi Li Li,
>
> First of all, please note that this mailing list is shared among many
> Apache Commons components, so the name of the component (here [math])
> must be included in the subject line as I did when answering your
> ques
sitionSolver solver =
new LUDecomposition(coefficients, 1.0e-12).getSolver();
However, I would not suggest it. LU decomposition is simply not the way
to handle such matrices. QR decomposition on the other hand is much more
robust and should be privileged in many cases.
Also note that Apache Commons Ma
e boundary. Extra points may occur here.
For now, we don't renormalize the boundary representation after building it.
best regards,
Luc
>
> Thanks,
> Curtis
>
> -
> To unsubscribe,
hat should be equalt to dTheta is the angle between result
and rotate.getCartesian(), not the angle between result and
init.getCartesian(). The latter can take any value between 0 and 2 * dTheta.
best regards,
Luc
> return Math.acos(result.getZ());
>
> }
>
> Thanks in adva
able fix. Could you open a JIRA issue and attache
your patch
including a test case?
Thanks a lot
Luc
double r1 = 1.0 / (r0 - a0);
long a1 = (long)FastMath.floor(r1);
p2 = (a1 * p1) + p0;
q2 = (a1 * q1) + q0;
if (q2 >= max
Le 25/05/2013 21:27, Luc Maisonobe a écrit :
> Hi Christoph,
>
> Le 23/05/2013 10:39, Christoph Höger a écrit :
>> Am 22.05.2013 22:50, schrieb Luc Maisonobe:
>>
>>> I am not sure I understood your use case properly. I'll look at it further
>>> in t
Hi Christoph,
Le 23/05/2013 10:39, Christoph Höger a écrit :
> Am 22.05.2013 22:50, schrieb Luc Maisonobe:
>
>> I am not sure I understood your use case properly. I'll look at it further
>> in the next few days.
>>
>> A first very quick answer is that the
own benchmarks. One very important feature
is that with an automated framework, maintainance of the code is much
easier when the complexity of the function increases.
best regards,
Luc
>
> Best regards,
> Franz
>
>
>
> Am Mittwoch, den 22.05.2013, 14:51 +0200 schrieb Thom
rst element, so I think you expanded the content of what should be a
single DerivativeStructure instance as a double array.
Are you sure you should not use a univariate function ? The DerivativeStructure
argument you would get
would contain all the partia
cobian(jacobian),
new Target(target),
new Weight(weight),
new InitialGuess(initial));
hope this helps.
Luc
>
> I tried to change the imports, but that does not work.
>
> Any help will be appreciated.
> Thanks.
> Eric
&g
this answer). The list is shared among all
Apache Commons components, and it helps filtering mail.
best regards,
Luc
> Eric.
>
>
> Le 17 avr. 2013 à 07:52, Eric HENON a écrit :
>
>> Hello,
>>
>> I need to perform a non linear regression using this
>> func
this release can be found in the
release notes;
http://www.apache.org/dist/commons/math/RELEASE-NOTES.txt
Best regards,
Luc, on behalf of the Apache Commons community
-
To unsubscribe, e-mail: user-unsubscr
ariances.
best regards,
Luc
>
> Regards,
>
> Adrien
>
> -
> To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
> For additional
un any java programs from the
command
line. The problems you encounter are not specific to Apache Commons
Math, they
correspond to general Java usage.
best regards,
Luc
George
On Mon, Jan 7, 2013 at 4:45 PM, Mat Jaggard
wrote:
You need to use -classpath when you run java as well as wh
tion.Acosh;
With this change, your program runs and displays the following output:
Hello World!
E @ i: 5
acosh: 1.5667992369724109
E @ i: 1
acosh: 1.5667992369724109
E @ i: 2
acosh: 1.5667992369724109
E @ i: 3
acosh: 1.5667992369724109
E @ i: 4
acosh: 1.5667992369724109
hope this helps,
Luc
Integrator does not?
It is not normal, it is a bug, thanks for reporting it.
Could you file a bug report in JIRA so we do not forget to fix it, with
a test case to reproduce the bug and ideally a patch to fix it?
best regards,
Luc
Thanks for your time,
Emmanuel
Hi Curtis,
Le 12/10/2012 17:49, Curtis Jensen a écrit :
> Should I create a bug report in Jira?
Yes please. This will allow us to not forget this report and check
what's going on.
thanks,
Luc
>
> --
> Curtis
>
> On Thu, Oct 11, 2012 at 2:32 PM, cac...@gmail.com wro
rs-1;
regression.newSampleData(dataSet, numOfVars, nvars);
I am not sure but shouldn't the previous line read:
regression.newSampleData(dataSet, rsData.getRow(),
xData.size());
best regards,
Luc
System.out.println("REGRESSION
CALCS:"+regression.calculat
o have xSize = ySize, note that the number
of rows of the x matrix
must be greater than the number of columns otherwise you will get
another error.
best regards,
Luc
The error has to be around where I init and/or write to the double
arrays
--
View this message in context:
http://apache
Le 26/08/2012 11:42, Martin Ennemoser a écrit :
> Hi Luc!
>
> Thank you for your answer. I tried it an it works. But isn't there an easier
> way to build a polyhedron? Do I relly need this projection and line stuff?
I think some of these steps could be gathered in a utili
interior will be
the infinite region and the exterior will be the finite square. If you
define your boundary with some elements in one direction and other
elements in the opposite direction, this will fail. For planes in 3D,
the plus half space is towards plane normal.
best
mons-math3-3.0-src.tar.gz>
best regards,
Luc
>
> Thanks, R. Pito.
>
>
>
>
>
>
> -
> This transmission (including any attachments) may contain confidential
> information, privileged materi
gt; optimizers creation...
>
> Could someone advise me about which to use ?
Look at either NelderMeadSimplex, MultiDimensionalSimplex or
CMAESOptimizer in the org.apache.commons.math3.optimization.direct package.
best regards,
Luc
>
> Many thanks in advance,
>
> regards,
>
omialFunction
using method getCoefficients().
best regards,
Luc
>
> Thanx for any help,
> Gabriele.
>
>
>
>
>
> -
> To unsubscribe, e-mail: user-unsubscr...@
y idea what I am missing here?
For anonymous checkout, try from http instead of from https.
The https protocol is mainly used for committers read/write access so it
may require a username.
Luc
>
> Direct svn checkout
> http://svn.apache.org/repos/asf/commons/proper/mat
izer performs the two calls
with function first and gradient afterwards at each iteration, but the
Levenberg-Marquardt optimizer has two embedded loops and computes
Jacobians on the external loop and the function value on the internal
loop. So you should probably not compute everything beforehand in th
(or faster) than Newton (higher order) and
provides the very interesting bracket selection feature at convergence.
best regards,
Luc
>
> Bernard
>
> -
> To unsubscribe, e-mail: user-unsubs
Le 31/03/2012 01:31, SUJIT PAL a écrit :
> Thanks Luc, thanks for getting back so quickly, and will wait for your
> information tomorrow.
Hi Sujit,
Sorry for the delay.
If you know your sample points (xi, yi) are all separated by the same
interval h (i.e x(i+1) = x(i) + h for all i), th
ll give ou such a formula tomorrow (I am on a
mobile
device right now and it is difficult to write a complète mail...)
Luc
>
>Thanks very much,
>
>Sujit
>
>
>-
>To unsubscribe, e-mail:
Le 27/03/2012 00:11, billy bob a écrit :
> The most recent version currently on maven central is 2.2. Any idea when 3.0
> will be available?
Note that since this was a major release, and as per recent Commons
policy, the artifact ID has changed from commons-math to commons-math3
gt;
> But I strongly recommend you rethink the approach. There are very few
> cases were inverting a matrix is a good idea.
I strongly agree with Ted here, direct inversion is often not the better
approach.
Luc
>
> On Fri, Mar 16, 2012 at 9:01 AM, petitout wrote:
>
>>
thins is that it allows concurrent read
(but when a write occurs, only one thread can write and reads are blocked).
Luc
>
> If this is the case, how have others dealt with situations like ours, where
> you do mostly just reads on a Configuration object, but very occasional
>
ou have to provide an explicit
> function
> together with its derivative; so certainly not what you are looking for.
For non-linear multivariate functions you should look at the
optimization package rather than the solver or linear packages.
Luc
>
&
rly state, it is not ready for
production. However, when it succeeds to produce a class (for simple
methods), this class is not really different from classes produced by
compilers, and it could be saved and read back as a binary file.
How did you write the class file and what error did y
l>20.0){
> return createComplex(1.0, 0.0);
> }
> if (real<-20.0){
> return createComplex(-1.0, 0.0);
> }
Yes, this does make sense. Could you open a Jira issue with this request ?
Thanks,
Luc
>
>
> Best regards,
>
> JBB
>
-
ed, you can also provide a patch for this, adding the
new constructors.
best regards,
Luc
>
>
> Best regards,
> Maciej Rubikowski
> Warsaw University of Technology / Institute of Computer Science
>
> -
>
n mid-January, at which date, the API of the
> code which I'm using must be frozen.
>
> I hope that you will consider this request favourably.
Well, in fact I have even earlier deadlines, so big +1.
Luc
>
> Best regards,
> Gilles
&g
>
> Hi,
>
> If the function you want to optimize has several local maxima, then it
> is (almost) always problematic. Especially with 17 parameters, that is
> a lot. Are you sure that you cannot obtain an analytical solution?
> Have you tried d
Le 26/10/2011 16:40, Phil Steitz a écrit :
> On 10/26/11 7:20 AM, Luc Maisonobe wrote:
>> Hello,
>>
>> One of the researcher I am working with (and who will soon start using
>> Apache Commons Math and Orekit) is looking for "a short article (no more
>> than
f our math-lovers have pointers to such a paper ?
Thanks,
Luc
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h...@commons.apache.org
Le 23/10/2011 09:47, Andy Turner a écrit :
> Hi,
Hello All,
You could also give a try to other random generators provided by Apache
Commons Math. Did you try the Well generators like Well1024a for example
? These generators are tailored towards large simulation like
Monte-Carlo ones.
ver idea to use connectivity information to help
build the set (perhaps by trying to eliminate redundant intermediate
points) ?
I guess this bug will be difficult to solve.
Luc
Thanks,
Curtis
Attached are two csv files with the points in CCW order. Also
attached is a plot of the points in
also tried to truncate the triangle to the right by changing the
abscissas of the last to points from -4.0 to -4.3 so the triangle lies
completely inside the square also gives a result I would consider
correct: two loops defining a square with a triangular hole.
What result do you get ?
Luc
T
Point method from the top level Region class to see which points
are inside and which points are outside. This could be a first step
understanding where the problem lies.
I'll try to have a look at this later on, I am sorry for the delay.
Luc
Thanks,
Curtis
public void testdifferen
a Jira issue, and as always, patches welcome!
best regards,
Luc
Thanks,
Ashwin.
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h...@commons.apache.org
em (I also
have the 3D segment you already requested in my TODO list).
Luc
Thanks,
Curtis
On Tue, Aug 2, 2011 at 10:36 AM, Ted Dunning wrote:
You could just define a 3D line that is in a plane. The distance will be
the same.
On Tue, Aug 2, 2011 at 9:47 AM, Curtis Jensen
wrote:
I see t
are already behind schedule.
Luc
Thanks in advance!
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h...@commons.apache.org
gonsSet,
and it should not change the arrays in place but rather use separate copies.
Hope this helps.
Luc
I'll have a look at this in the next few days.
Sorry for the delay.
Luc
Vector2D[][] vertices1 = new Vector2D[][] {
new Vector2D[] {
new Vecto
> > original polygons. See example below. Am I misinterpreting what
> the
> > intersection method does, miss-using it, or is this a bug?
I'll have a look at this in the next few days.
Sorry for the delay.
Luc
> >
> >
> > Vector2D[][] vertices1 =
imizer or CMAESOptimizer) that deal with
multivariate real-valued functions.
Luc
--
View this message in context:
http://apache-commons.680414.n4.nabble.com/Math-Jacobian-Matrix-of-f-x-y-tp3641890p3644174.html
Sent from the Commons - User mailing list archive at N
e optimize
method of the optimizer.
best regards,
Luc
Any help would be appreciated.
--
View this message in context:
http://apache-commons.680414.n4.nabble.com/Math-Jacobian-Matrix-of-f-x-y-tp3641890p3641890.html
Sent from the Commons - User mailing list archive at
- "Michele Mazzucco" a écrit :
Hi Michele,
> Antonio,
>
> thanks for the quick answer.
> Do you know any library/framework which could help me with that?
Perhaps Choco <http://www.emn.fr/z-info/choco-solver/> ?
best regards,
Luc
>
> Cheers,
> Mic
Le 16/06/2011 21:43, Curtis Jensen a écrit :
On Wed, Jun 15, 2011 at 12:01 PM, Luc Maisonobe wrote:
Le 15/06/2011 19:57, Curtis Jensen a écrit :
The Vector2D and Vector3D classes have dotProduct and crossProduct
methods. I assume this is done be considering each vector originating
There
finally decided to merge everything in only
one class per dimension. This is a classical choice and the user often
already know what his instances represent.
Luc
Thanks,
Curtis
-
To unsubscribe, e-mail: user-unsubscr
rm to convert a
java.awt.AffineTransform into a
org.apache.commons.math.geometry.partitioning.TransformEuclidean1D>.
This transform can be applied points, hyperplanes and sub-hyperplanes.
when applied to sub-hyperplanes, it takes care of transforming the 1D
intervals sets underneath.
Luc
s would create a false feeling
of stability to most users.
What would you need a development snapshot for ? Could you use the
subversion repository (or the git mirror) instead ?
Sorry
Luc
Thanks,
Dennis
-
To unsubscribe
ame spirit, I guess a
constructor with the two endpoints may be interesting.
Hope this helps
Luc
Thanks,
Curtis
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h.
Le 10/06/2011 10:47, Dennis Hendriks a écrit :
Hi Luc,
Hi Dennis,
Thanks again. I'm willing to try an make a patch for this. I currently
used release 2.2. I assume I would have to switch to the current
development version that is to become 3.0?
Yes. This change would imply modifyi
Le 10/06/2011 10:20, Dennis Hendriks a écrit :
Hi Luc,
Hi Dennis,
Thanks for your quick reply. It would be a possible solution.
I decided to familiarize myself with the internals of the code that is
used, in order to better understand what code is responsible for the
root finding. I found
actly because we need to make sure the isLast boolean is properly set to true
when an
events ask the integrator to stop.
>
> Any help would be greatly appreciated.
Hope this helps,
Luc
>
> Thanks,
> Dennis
>
> -
in diagonal) and then a Schur decomposition. I think Schur
decomposition implies working with complex elements.
Patch welcome!
Luc
Arne
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands
Le 27/04/2011 17:23, Luc Maisonobe a écrit :
> Le 27/04/2011 15:52, Cedric Martin a écrit :
>> Hi all,
>
> Hi Cédric,
>
>>
>> I have a simplistic implementation of least squares using Jama Matrix which
>> I would like to migrate to Math Commons if possible.
> similar objects (RealMatrix I'm assuming), would anyone be able to point me
> in the right direction for this as well, while using the Commons Math
> library?
We don't have a recursive least square implementation now.
best regards,
Luc
>
>
> Tha
/org/apache/commons/math/optimization/linear/SimplexSolverTest.java?view=markup>.
Luc
>
> Thanks for any help,
>
> Piotr
>
> -
> To unsubscribe, e-ma
flow of data
without storing them. There is an interesting algorithm for it that was
developed for the needs of telecommunication companies, I think it may
be of interest to you. This would provide results like : currently 95%
of the characters are processed in n milliseconds. would you be
int
ot; links here:
http://commons.apache.org/math/project-info.html
Luc Maisonobe - On behalf of the Apache Commons community
-
To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
For additional commands, e-mail: user-h...@commons.apache.org
Le 26/02/2011 10:34, Martinov, Nickolay a écrit :
> Hello Luc,
Hi Nickolay,
>
> Yes, I already have an account (posted issues previously) and tried "Can't
> access your account". But it only tells following
>
> A reset password link has been sent to you via
irst.
Click on "Log in" on the top right of the Jira page to get the login
screen and follow the link "sign up" for an account to create it the
first time.
If you already have an account, on the same login screen there is link
"Can't access your account" that can be
+ variables[2];
The two expressions compute exactly the same value. We have written it
using Hörner's rule. This is a classical method to evaluate polynomials
that save some multiplications. Look at the parentheses and you will see
t
<https://issues.apache.org/jira/browse/MATH-400>.
best regards,
Luc
>
> TIA,
> - Ole
>
> -
> To unsubscribe, e-mail: user-unsubscr...@commons.apache.org
&
wvc/commons/proper/math/branches/MATH_2_X/src/main/java/org/apache/commons/math/dfp/>
Luc
>
> I did find other pow functions in the org.apache.commons.math.util.MathUtils
> class.
>
> Andy
>
-
To unsubsc
- "Andy Turner" a écrit :
> Hi and thanks Luc,
>
> > It may interesting to add this feature. I didn't look precisely but
> how
> > does it compare to our arbitrary precision dflp package ?
>
> I don't see a dflp package in 2.1. Can you give
u advise I use as a guide?
There are guidelines here: <http://commons.apache.org/math/developers.html>
There is also a code style configuration file available here
<http://people.apache.org/~luc/Apache-commons.xml>, but it is for Eclipse.
In order to check your code is compliant with s
1 - 100 of 210 matches
Mail list logo
