[Math] Comparison between regression methods.

Hello, Has there been a comparison between the lm method in R and apache math's linear models? Which one is identical to lm(y ~ x -1) ? Thanks, Ajo.

Re: [math] Review of a postponed issue.

Can you explain what specifically breaks binary compatibility that doesn't happen in other patches? ... and is there a test for this breakage? -Ajo. On Sun, Dec 7, 2014 at 8:13 AM, Ajo Fod wrote: > Ah, thanks. > > -Ajo. > > On Sat, Dec 6, 2014 at 8:04 AM, Gilles > wr

[Math] Normalizing a random vector.

Is there way in the current codebase to get Y = (X- mean(X))/Sdev(X). where X is a vector ? -Ajo.

Re: [math] Review of a postponed issue.

Ah, thanks. -Ajo. On Sat, Dec 6, 2014 at 8:04 AM, Gilles wrote: > On Fri, 5 Dec 2014 08:57:05 -0800, Ajo Fod wrote: > >> Guess we pushed this to 4.0 not 3.4 >> ... but just in case its time. >> >> https://issues.apache.org/jira/browse/MATH-1016 >> >&

[math] Review of a postponed issue.

Guess we pushed this to 4.0 not 3.4 ... but just in case its time. https://issues.apache.org/jira/browse/MATH-1016 -Ajo

[math] On a common interface for regressions.

Does this sound like a good idea? https://issues.apache.org/jira/browse/MATH-1177 -Ajo

Re: [math]: Is something wrong with BicubicInterpolation?

I have a feeling that (x,y) being assigned values from (y,x) may be the cause. Ajo On Nov 11, 2014 2:11 PM, "Gilles" wrote: > On Tue, 11 Nov 2014 16:10:35 -0500, Hank Grabowski wrote: > >> There are known problems with the bicubic interpolation algorithm. In the >> current head revision there a

[math]: Is something wrong with BicubicInterpolation?

I feel like bicubic interpolation should result in images like: http://en.wikipedia.org/wiki/Bicubic_interpolation But, here I'm getting something different: import java.awt.Color; import java.awt.Font; import java.awt.FontMetrics; import java.awt.Graphics2D; import java.awt.image.BufferedImage;

Re: [Math] Speedup opportunity in AbstractRealDistribution

Thanks null rng parameter works for me. -Ajo. On Tue, May 20, 2014 at 1:15 PM, Phil Steitz wrote: > On 5/20/14, 12:54 PM, Ajo Fod wrote: > > A couple of observations: > > ... The default random generator takes a while to instantiate. > > ... Many functions of these distri

[Math] Speedup opportunity in AbstractRealDistribution

A couple of observations: ... The default random generator takes a while to instantiate. ... Many functions of these distributions don't require a random generator. Generally speaking only sampling requires it. So, why force the default constructor to initialize with a new random generator. Why no

Re: [math] Links to documents in javadocs for moment computation

n Sun, Nov 17, 2013 at 8:10 AM, Phil Steitz wrote: > On 11/17/13 6:02 AM, Ajo Fod wrote: > > The Sandia report is free. The javadoc link is paywalled. I'd recommend > > linking a free version if you want people to have unfettered access. > > > > Does the payw

Re: [math] Links to documents in javadocs for moment computation

-1016? The Sandia report does. Also, I've been working off the Sandia report and I think that adequately describes what is going on in the classes. Let me know if you are aware of any differences. Cheers, -Ajo. On Sat, Nov 16, 2013 at 11:34 AM, Phil Steitz wrote: > On 11/16/13 3:55 AM,

Re: [math] Links to documents in javadocs for moment computation

... being relevant to the First/Second/... Moments. -Ajo On Sat, Nov 16, 2013 at 3:55 AM, Ajo Fod wrote: > Hello, > > The document: > http://commons.apache.org/proper/commons-math/javadocs/api-3.2/index.htmlis > relevant to First/Second/Moments, could someone add it

[math] Links to documents in javadocs for moment computation

Hello, The document: http://commons.apache.org/proper/commons-math/javadocs/api-3.2/index.htmlis relevant to First/Second/Moments, could someone add it to those classes as well? This link is already documented in : *org.apache.commons.math3.stat.correlation.StorelessCovariance*

Re: [Math] Could StatUtils use a method to find the index of the maximum value.

substitute, and could be used to do something similar, but this is a lot less code and duplicates are not swallowed. -Ajo. On Sat, Sep 21, 2013 at 10:55 AM, Phil Steitz wrote: > On 9/19/13 6:14 PM, Ajo Fod wrote: > > It currently has the maximum of a double array. > > > >

Re: [Math] Could StatUtils use a method to find the index of the maximum value.

lic static void main(String[] args) { final double[] data = {1.7f, -0.3f, 2.1f, 0.5f}; final Integer[] idx = rank(Dir.Descending, data); System.out.println(Arrays.toString(idx)); } } On Thu, Sep 19, 2013 at 6:14 PM, Ajo Fod wrote: > It currently has the maximum of a

[Math] Could StatUtils use a method to find the index of the maximum value.

It currently has the maximum of a double array. -Ajo.

Re: [Math] DS: An alternative to DerivativeStructure

Hi Luc, I'll work on tests when I get a chance. RealFieldElement has a lot of functions so its a bit out of my way. Cheers, -Ajo On Thu, Sep 19, 2013 at 10:58 AM, Luc Maisonobe wrote: > Hi Ajo, > > Le 19/09/2013 16:26, Ajo Fod a écrit : > > Created: > https://issues

Re: [Math] DS: An alternative to DerivativeStructure

Created: https://issues.apache.org/jira/browse/MATH-1036#comment-13771933 On Thu, Sep 19, 2013 at 12:29 AM, luc wrote: > Le 2013-09-19 08:26, Ajo Fod a écrit : > >> Hello, >> > > Hi Ajo, > > > >> Ran into problems with DerivativeStructure today. It requ

[Math] DS: An alternative to DerivativeStructure

Hello, Ran into problems with DerivativeStructure today. It requires a lot of memory with 6000 or so independent variables. I poked around and found it the problem starts with the number of DSCompiler objects instantiated. Given this and my earlier observation that in sparse derivative trees, the

[Math] The BFGS algorithm

Hello, I don't see a BFGS implementation in optim.nonlinear.scalar.gradient. Is it somewhere else in CM? If not, I think it could be a good addition to CM. -Ajo.

Re: [MATH] On computational efficiency in DerivativeStructures

12:21 AM, Luc Maisonobe wrote: > Hi Ajo, > > Le 29/08/2013 19:05, Ajo Fod a écrit : > > Hello, > > > > I wonder if the number of computations required to compute a derivative > > structure can be reduced. Say the derivative structure of f to order d=2 > is >

[MATH] On computational efficiency in DerivativeStructures

Hello, I wonder if the number of computations required to compute a derivative structure can be reduced. Say the derivative structure of f to order d=2 is desired: f(g1(x1), g2(x2), ... gn(xn)) where x1,x2 ... xn are subsets of variables that are not necessarily disjoint. For each gi(xi), O(n^2)

Re: [MATH] What is the derivative of 0^x

BTW Luc. This derivatives structure is simply a godsent for big optimization problems. Cheers, -Ajo. On Wed, Aug 28, 2013 at 11:13 AM, Ajo Fod wrote: > That works very well. > > I missed the default value of 0 earlier > > Thanks, > -Ajo > > > On Wed, Aug 28, 2013

Re: [MATH] What is the derivative of 0^x

That works very well. I missed the default value of 0 earlier Thanks, -Ajo On Wed, Aug 28, 2013 at 11:05 AM, Luc Maisonobe wrote: > Le 28/08/2013 19:59, Ajo Fod a écrit : > > Its a=0 that bothers me. x > 0 in my case. > > Then everything should be OK with the current

Re: [MATH] What is the derivative of 0^x

10:36 AM, Luc Maisonobe wrote: > Hi Ajo, > > Le 28/08/2013 16:56, Ajo Fod a écrit : > > To define things precisely: > > y = f(a,x) = |a|^x > > > > Can we agree that: > > df(a,x)/dx -> 0 when a->0 and x > 0 :[ NOTE: x > 0] > > Yes, of course

Re: [MATH] What is the derivative of 0^x

rs, Ajo. On Tue, Aug 27, 2013 at 1:49 PM, Luc Maisonobe wrote: > Hi Ajo, > > Le 27/08/2013 16:44, Ajo Fod a écrit : > > Thanks for the constant structure. > > > > No. The limit value when x->0+ is 1, not O. > > > > I agree with this. I was just going fo

Re: [MATH] What is the derivative of 0^x

> one, should be NaN. What the new function brings is a correct negetive > infinity first derivative at singularity point, better accuracy for > non-singular points, and possibly faster computation. > > best regards, > Luc > > > > > > > On Mon, Aug 26, 2013 at

Re: [MATH] What is the derivative of 0^x

hen I have order and length information in existing ds all around. Cheers, Ajo. On Mon, Aug 26, 2013 at 8:23 AM, Ajo Fod wrote: > With regards to what is happening in DsCompiler.pow(): > IMHO, when a==0 and x>=0 the function is well behaved because log|a| -> > Inf slower than a

Re: [MATH] What is the derivative of 0^x

If so, what happens when a=0 & x!=0 in that function? On Mon, Aug 26, 2013 at 12:38 AM, Luc Maisonobe wrote: > > > > Ajo Fod a écrit : > >Are you saying patched the code? Can you provide the link? > > I committed it in the development version. You just have t

Re: [MATH] What is the derivative of 0^x

Are you saying patched the code? Can you provide the link? -Ajo On Sun, Aug 25, 2013 at 1:20 PM, Luc Maisonobe wrote: > Le 24/08/2013 11:24, Luc Maisonobe a écrit : > > Le 23/08/2013 19:20, Ajo Fod a écrit : > >> Hello, > > > > Hi Ajo, > > > >>

Re: [MATH] What is the derivative of 0^x

the rule that derivative(|a|^x) = 0 for |a|=0. Thanks, Ajo. On Fri, Aug 23, 2013 at 9:39 AM, Luc Maisonobe wrote: > Hi Ajo, > > Le 23/08/2013 17:48, Ajo Fod a écrit : > > Try this and I'm happy to explain if necessary: > > > > public class Deriv

Re: [MATH] What is the derivative of 0^x

23, 2013 at 7:59 AM, Gilles wrote: > On Fri, 23 Aug 2013 07:17:35 -0700, Ajo Fod wrote: > >> Seems like the DerivativeCompiler returns NaN. >> >> IMHO it should return 0. >> > > What should be 0? And Why? > > > >>

[MATH] What is the derivative of 0^x

Seems like the DerivativeCompiler returns NaN. IMHO it should return 0. Is this worthy of an issue? Thanks, -Ajo

Re: Need for an alternatives to the main line of code.

Good for you... Yes just imagine if I'd to get every fix through committers. I'd never get anything done here. > On the subject of this thread: I did not imply that an "experimental" > package would allow sloppy or undocumented code or bypass unit testing. > All (the above) things being equal, t

Re: Need for an alternatives to the main line of code.

a/browse/MATH-999 Cheers, -Ajo On Tue, Aug 20, 2013 at 1:30 PM, Gary Gregory wrote: > On the point of tests: Considering tests a hurdle is the wrong way to look > at it. Tests are the foundation I can confidently build on and change code. > > Gary > > > On Tue, Aug 20, 2013 at

Re: [math] enumerating combinations

I feel like it belongs in a separate class in utils. -Ajo On Tue, Aug 20, 2013 at 12:24 PM, Phil Steitz wrote: > On 8/20/13 12:09 PM, Ajo Fod wrote: > > I think it belongs in stat.inference. That is where all the tests are. > > Sorry, I should have been more clear.

Re: [math] enumerating combinations

I think it belongs in stat.inference. That is where all the tests are. -Ajo On Tue, Aug 20, 2013 at 8:51 AM, Phil Steitz wrote: > The monte carlo approach I developed for 2-sample Kolmogorov-Smirnov > tests converges too slowly to be practical. I suspect full > enumeration of n - m partitions

Need for an alternatives to the main line of code.

My 2c worth. It seems like there is a general bottleneck. A lot of ideas don't get used because there is a hurdle that people have to make change that satisfy all code requirements like tests/reuse of blocks etc. This makes for a larger than necessary hurdle for people to contribute. Looks like Gi

[math] On "Vector optimization" in CM

The idea of a vector optimizer is very strange. Optimization is usually about finding the min/max of a scalar function subject to a vector of constraints. I can't think of an exception. I recently reviewed JOptimizer, JMSL and IPOpt. None of them mention "vector optimization". nonlinear.vector in

Re: [math] Using the hessian in scalar unconstrained optimization

7;t know if commons has one > (doesn't look like it). You can also try http://www.joptimizer.com/ > > On Thu, Aug 15, 2013 at 4:59 PM, Ajo Fod wrote: > > Hello, > > > > Is'nt there an advantage to being able to compute the Jacobian of the > > gradient pr

Re: [Math] Fluent API, inheritance and immutability

I like the immutability idea. I wonder if there are any guidelines on when the performance hit because of immutability is high enough to want mutable objects and synchronization? -Ajo On Thu, Aug 15, 2013 at 10:27 AM, Gilles wrote: > On Thu, 15 Aug 2013 11:07:20 -0500, Phil Steitz wrote: > >> O

Re: [math] Using the hessian in scalar unconstrained optimization

stimate an *approximate* hessian in the Newton step. Cheers, -Ajo On Fri, Aug 16, 2013 at 10:03 AM, Luc Maisonobe wrote: > Le 16/08/2013 18:55, Ajo Fod a écrit : > > The algorithm computes the Hessian using an update rule. My question was > > what if you can compute the hessian analytical

Re: [math] Using the hessian in scalar unconstrained optimization

: > Le 15/08/2013 22:59, Ajo Fod a écrit : > > Hello, > > > > Is'nt there an advantage to being able to compute the Jacobian of the > > gradient precisely at a point? > > > > If so, is there a class that uses the Jacobian instead of estimating the

Re: [math] Using the hessian in scalar unconstrained optimization

Yes that works. Thanks! On Thursday, August 15, 2013, Konstantin Berlin wrote: > There would be an advantage, true. I don't know if commons has one > (doesn't look like it). You can also try http://www.joptimizer.com/ > > On Thu, Aug 15, 2013 at 4:59 PM, Ajo Fo

[math] Using the hessian in scalar unconstrained optimization

Hello, Is'nt there an advantage to being able to compute the Jacobian of the gradient precisely at a point? If so, is there a class that uses the Jacobian instead of estimating the jacobian from the last few iteration as NonLinearConjugateGradientOptimizer does? Thanks, -Ajo

Default constructors

Sometimes, the simplest constructor for a class requires parameters that there is an obvious default choice for: One such example is: *NonLinearConjugateGradientOptimizer

Re: [math] Kolmogorov-Smirnov 2-sample test

imulations. Its an interesting problem, so best of luck. I'm curious about the application that lead to needing the test for small samples. Cheers, -Ajo On Sat, Aug 10, 2013 at 1:26 PM, Ted Dunning wrote: > On Sat, Aug 10, 2013 at 8:59 AM, Ajo Fod wrote: > > > If the da

Re: [math] Kolmogorov-Smirnov 2-sample test

/10/13 9:35 AM, Ajo Fod wrote: > > In: > > > http://ocw.mit.edu/courses/mathematics/18-443-statistics-for-applications-fall-2006/lecture-notes/lecture14.pdf > > > > Take a look at 2 sample KS stats and the relationship to the 1 sample ... > > page 88. You already have

Re: [math] Kolmogorov-Smirnov 2-sample test

wrote: > On 8/10/13 8:59 AM, Ajo Fod wrote: > > This depends on data size. If it fits in memory, a single pass through > the > > sorted array to find the biggest differences would suffice. > > > > If the data doesn't fit, you probably need a StorelessQuantile es

Re: [math] Kolmogorov-Smirnov 2-sample test

This depends on data size. If it fits in memory, a single pass through the sorted array to find the biggest differences would suffice. If the data doesn't fit, you probably need a StorelessQuantile estimator like QuantileBin1D from the colt libraries. Then pick a resolution and do the single pass

Re: [math] AbstractStorelessStats stores raw data.

ok On Tue, Aug 6, 2013 at 5:17 PM, Phil Steitz wrote: > On 8/6/13 7:27 AM, Ajo Fod wrote: > > Is this an issue then? > > Best not to top-post. Lets see if we get any other views on how the > setup may be improved. Then when we have consensus that a design > change is wa

Re: inverseCumAccuracy is probably not necessary

OK. When does it become something that can be posted as an issue? -Ajo On Tue, Aug 6, 2013 at 2:13 PM, Phil Steitz wrote: > On 8/6/13 1:52 PM, Ajo Fod wrote: > > My question is if it is like one of those buttons on a calculator that no > > one has really ever used. > >

Re: inverseCumAccuracy is probably not necessary

; I assume you are talking about the > > > name of the constructor parameter / configuration option. > > > > > > Phil > > > > > > > > > > > > On Tue, Aug 6, 2013 at 10:28 AM, Ajo Fod wrote: > > > > > > > &g

Re: inverseCumAccuracy is probably not necessary

When does this become an issue? -Ajo On Sun, Aug 4, 2013 at 9:42 AM, Phil Steitz wrote: > On 8/4/13 7:44 AM, Ajo Fod wrote: > > Guys, > > > > What is the use of inverseCumAccuracy when people want to instantiate an > > AbstractRealDistribut

Re: [math] AbstractStorelessStats stores raw data.

Is this an issue then? -Ajo On Fri, Aug 2, 2013 at 3:48 PM, Phil Steitz wrote: > On 8/2/13 3:09 PM, Ajo Fod wrote: > > The class design of AbstractStorelessStats (Storeless) suggests that it > is > > storing data in its parent AbstractUnivariate (Parent) and there are > &

inverseCumAccuracy is probably not necessary

Guys, What is the use of inverseCumAccuracy when people want to instantiate an AbstractRealDistribution with a random generator? org.apache.commons.math3.distribution.AbstractRealDistribution

[math] AbstractStorelessStats stores raw data.

The class design of AbstractStorelessStats (Storeless) suggests that it is storing data in its parent AbstractUnivariate (Parent) and there are methods accesible to a child of this class that shouldn't be to something that is storeless in: private double[] storedData; ... perhaps Percentile etc s

Re: [math] new feature to allow infinite limits in numerical integration.

However, the infinite class would have allowed integration from [-Inf, >> C!=0]. >> Can you manage that with Gauss Hermite? >> > > I don't think so (non-authoritative answer). > that the answer is 1).] > > Just Posted MATH-1015 which describes how you'd do this with your integration methods. Cheer

Re: [math] another add to MathArrays

ax(java.util.Collection)> > > > Gilles > > > >> On Tue, Jul 23, 2013 at 1:25 PM, Phil Steitz >> wrote: >> >> On 7/23/13 10:17 AM, Ajo Fod wrote: >>> > You mean find the difference between StatUtils.min() and max() on >>> elements

Re: [math] new feature to allow infinite limits in numerical integration.

You mean just move the Infinite.class to the test section? Sure ... go ahead. -Ajo On Thu, Jul 25, 2013 at 5:33 AM, Gilles wrote: > On Wed, 24 Jul 2013 07:50:25 -0700, Ajo Fod wrote: > >> It would be nice to know whether the Gauss-Hermite implementation recently >> >&

Re: [math] new feature to allow infinite limits in numerical integration.

It would be nice to know whether the Gauss-Hermite implementation recently > added proves useful for that purpose; and if so, whether it could be added > as a non-trivial example in the user guide. > I'll check it out when I get back to it. > > How do you propose to do the test without a change

Re: [math] another add to MathArrays

You mean find the difference between StatUtils.min() and max() on elements of an array? On Tue, Jul 23, 2013 at 8:57 AM, Phil Steitz wrote: > I need a function that computes the maximum difference between > elements of an array. Any objections to adding this to MathArrays? > >

Re: [math] new feature to allow infinite limits in numerical integration.

> > So, given this development, I'm not particularly motivated to develop AQ >> further. >> > > So, all the fuss just to use a numerical method for computing a value > known in advance? The fuss was about the ability to compute the partition function for the exponential family. It has closed for

Re: [math] new feature to allow infinite limits in numerical integration.

cally do. 2) it uses Simpson's rule, but you should be able to swap in other quadrature rules. Cheers, Ajo On Sun, Jul 21, 2013 at 5:16 PM, Gilles wrote: > On Sun, 21 Jul 2013 08:04:05 -0700, Ajo Fod wrote: > >> [...] >> >> >> Here is some numerical analysis on

Re: [math] new feature to allow infinite limits in numerical integration.

4 Jun 2013 07:43:22 -0700, Ajo Fod wrote: > >> As I read through the Wikipedia articles on Gauss-Hermite and > >> Laguerre, I > >> notice that they are talking about basis functions with > >> infinity/s in its > >> domain. How would this would solve the

Re: [Math] Cleaning up the curve fitters

es in commons? Mind you all the code does is map an arbitrary function in the range [-Inf, Inf] to [-1,1] Cheers, Ajo On Sat, Jul 20, 2013 at 2:28 PM, Gilles wrote: > On Sat, 20 Jul 2013 06:45:10 -0700, Ajo Fod wrote: > >> >> [...] >> >> >> If you want to pose what

Re: [Math] Does any commiter understand Change of variables?

quite simple. > > What is not clear is what the numerical properties are for substitution of > the sort being advocated. > > Which functions will do better with substitution? Which will do better > with Laguerre polynomials? > > > > On Sat, Jul 20, 2013 at 8:59 AM, Aj

Re: [Math] Cleaning up the curve fitters

l Steitz wrote: > On 7/20/13 8:54 AM, Ajo Fod wrote: > > 1. Konstantin just showed with a link that other packages use the change > of > > variables method. > > > > 2 The theoretical argument for the change of variables method is > documented > > on Wikipedia. It

[Math] Does any commiter understand Change of variables?

The method is described here: http://en.wikipedia.org/wiki/Integration_by_substitution My patch uses it for improper integration via the change of variable t/(1-t^2) as suggested in : http://en.wikipedia.org/wiki/Numerical_integration Please reach back if anyone understands this concept. Cheers,

Re: [Math] Cleaning up the curve fitters

3 at 7:25 AM, Phil Steitz wrote: > On 7/20/13 6:45 AM, Ajo Fod wrote: > > Phil, > > > > I feel that you are blocking/delaying the use of improper integration to > > commons users with your objection that you don't understand all the > > alternatives. > >

Re: [Math] Cleaning up the curve fitters

> his code, so I can't comment about it specifically. >> > > There was no outright rejection. > ... only painful fillibustering with objections that were tangential to the CM user experience. > > My strong impression is that the source of the problem is the > misconception that Commons Math is r

Re: [Math] Cleaning up the curve fitters

Phil, I feel that you are blocking/delaying the use of improper integration to commons users with your objection that you don't understand all the alternatives. If you want to pose what I and the community see as a respectable objection to including a commit, it needs to be in the form of : 1. al

Re: [Math] Cleaning up the curve fitters

others have such private patches. Cheers, Ajo On Thu, Jul 18, 2013 at 2:15 PM, Phil Steitz wrote: > On 7/18/13 1:48 PM, Ajo Fod wrote: > > Hello folks, > > > > There is a lot of work in API design. However, Konstantin's point is that > > it takes a lot of ef

Re: [Math] Cleaning up the curve fitters

Hello folks, There is a lot of work in API design. However, Konstantin's point is that it takes a lot of effort to convince Gilles of any alternatives. API design issues should really be second to functionality. This idea seems to be lost in conversations. I agree with Gilles that providing tests

Re: how to contribute on coding ?

Make/find a new issue one one of the issue trackers and submit a patch file. I think that is the general idea. -Ajo. On Sun, Jul 14, 2013 at 8:21 PM, narendra kumar wrote: > hii every one i am new this open source world i wish to contribute > something on coding , but i am confused where and h

Re: [math] Math-Jax in javadoc?

I like this idea too. I"m curious to know how it works. +1 On Sun, Jul 14, 2013 at 11:35 AM, Thomas Neidhart wrote: > On 07/14/2013 07:50 PM, Phil Steitz wrote: > > I think we have talked about this before but did not achieve > > consensus or at least never got it set up. I am finishing the >

Re: Extensibility of CM classes

I like the last few arguments about multi threaded environments. That makes the getter/setter paradigm desirable even in single user environments. Thanks for the thoughtful arguments. On Fri, Jul 12, 2013 at 8:01 AM, sebb wrote: > On 12 July 2013 15:39, Ajo Fod wrote: > > I wo

Re: Extensibility of CM classes

big one. Is this the general view? -Ajo On Thu, Jul 11, 2013 at 11:57 PM, Benedikt Ritter wrote: > A somewhat more academic rationale why making fields protected may be an > issue, can be found here: http://dl.acm.org/citation.cfm?id=28702 > > Benedikt > > > 2013/7/12 Ajo F

Re: Extensibility of CM classes

I see. That makes sense now. Thanks. On Thursday, July 11, 2013, Phil Steitz wrote: > On 7/11/13 12:09 PM, Luc Maisonobe wrote: > > Hi Ajo, > > > > Le 11/07/2013 20:38, Ajo Fod a écrit : > >> More classes can be used/extended if fields generally default to > pro

Extensibility of CM classes

More classes can be used/extended if fields generally default to protected instead of private as it seems it does in classes in CM now. Case in point is in : https://issues.apache.org/jira/browse/MATH-1003 Cheers, Ajo

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

this method is more efficient. Cheers, -Ajo On Wed, Jul 3, 2013 at 7:52 AM, Gilles wrote: > On Wed, 3 Jul 2013 07:39:00 -0700, Ajo Fod wrote: > >> I wonder if Clenshaw-Curtis Quadrature (CCQ) is more adapted for Adaptive >> Quadrature than Gauss-Kronrod (GKQ). >> &

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

I wonder if Clenshaw-Curtis Quadrature (CCQ) is more adapted for Adaptive Quadrature than Gauss-Kronrod (GKQ). It seems like with CCQ the points at one level of resolution can be reused for the next level. The error bounds for a given level of resolution is the comparable to GKQ, so I'm guessing t

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

AM, Konstantin Berlin wrote: > IterateiveLegendreGaussIntegrator should be replaced by adaptive > guass-kronrod. The simpson and trapezoidal methods should be replaced by > their adaptive versions, or at least adaptive wrapper provided for them. > > > On Tue, Jul 2, 2013 at

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

aptive quadrature. I would also think that Guass Kronrod would > be a better way of going about the integration than what is there now for > LGQ. > http://en.wikipedia.org/wiki/Gauss%E2%80%93Kronrod_quadrature_formula > > > On Mon, Jul 1, 2013 at 11:37 PM, Ajo Fod wrote: > >

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

case that shows why anyone should use LGQ over AQ? Cheers, Ajo. On Tue, Jul 2, 2013 at 7:56 AM, Phil Steitz wrote: > On 7/1/13 8:37 PM, Ajo Fod wrote: > > Hi Konstantin, > > > > Thanks for pointing out the inefficiency in AQ. I just improved the > > efficiency of A

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

t; > > > > > Got to compare apples to apples Gilles ! > > > > Cheers, > > -Ajo > > > > > > > > > > On Mon, Jul 1, 2013 at 4:16 PM, Gilles > wrote: > > > >> Hi. > >> > >> > >> On Mon, 1 Jul 2013

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

compare apples to apples Gilles ! Cheers, -Ajo On Mon, Jul 1, 2013 at 4:16 PM, Gilles wrote: > Hi. > > > On Mon, 1 Jul 2013 10:50:19 -0700, Ajo Fod wrote: > >> If you wanted to use the Math 3 codebase in AdaptiveQuadrature, you'd >> compute the calculati

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

; singularity likely. > if (h return; > > //found the right value > boolean allBelow = true; > for (int iter=0; iter if (Math.abs(Q2[iter] - Q[iter]) > tol) >

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

> the combination of "**IterativeGaussLegendreIntegrat**or" and > "InfiniteIntegral" is not legitimate (if that's the case). > > > Regards, > Gilles > > [1] Cf. also my latest comment on the MATH-995 page. > > > >> Cheers, >>

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

non polynomial curvature is concentrated in a corner of the domain of integration. Notice that the Stack objects stores a Stack of limits of integration. Cheers, Ajo. On Fri, Jun 28, 2013 at 11:07 AM, Ajo Fod wrote: > BTW, it is possible that I'm not using LGQ correctly. If so, ple

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

BTW, it is possible that I'm not using LGQ correctly. If so, please show how to pass the tests I've added. I'd much rather use something that is better tested than my personal code. -Ajo. On Fri, Jun 28, 2013 at 11:04 AM, Ajo Fod wrote: > I just posted a patch on this issue.

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

I just posted a patch on this issue. Feel free to edit as necessary to match your standards. There is a clear issue with LGQ. Cheers, Ajo. On Fri, Jun 28, 2013 at 10:54 AM, Gilles wrote: > Ted, > > > >> Did you read my other (rather more lengthy) post? Is that "jumping"? >>> >>> >> Yes. You

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

Hey guys, Ted/Gilles, thanks for the support and reviewing the code. I realize that there is no Junit test with the files. I'll make a working patch to make life easier on everyone. Cheers, Ajo. On Fri, Jun 28, 2013 at 9:06 AM, Ted Dunning wrote: > On Fri, Jun 28, 2013 at 9:05 AM, Gilles >wr

[math] On MATH-995: Problems with LegendreGaussQuadrature class.

The existing LegendreGaussQuadrature class incorrectly assumes that it has converged for functions where the polynomial approximation fails in a small corner of the integral space. This situation is handled much better with the AdaptiveQuadrature class in the path for MATH-995. This problem should

Re: [math] new feature to allow infinite limits in numerical integration.

As I read through the Wikipedia articles on Gauss-Hermite and Laguerre, I notice that they are talking about basis functions with infinity/s in its domain. How would this would solve the problem addressed in the MATH-994 which is to restrict the bounds of the function being integrated so that num

[math] new feature to allow infinite limits in numerical integration.

I've submitted a patch for the issue (see MATH-994). This will allow users to integrate functions with infinity as one of the bounds. Cheers, Ajo Fod.