Subject: CGAL users discussion list
List archive
- From: sainyam galhotra <>
- To:
- Subject: Re: [cgal-discuss] Google Summer of Code Idea
- Date: Thu, 29 Mar 2012 04:17:47 -0700
Thanks for your guidance. Actually it was out of my knowledge but
least squares problem and singular value decomposition are not
implemented in it. Also the optimization problems could also be
implemented. Even the problem of finding the global minimum or
maximum could be done
Thanking You
Sainyam
On Thu, Mar 29, 2012 at 4:10 AM, Philipp Moeller
<>
wrote:
> sainyam galhotra
> <>
> writes:
>
>> Hi
>>
>> I am a sophomore at Indian Institute of Technology, Delhi majoring in
>> Computer Science. I have a strong mathematical and programming
>> background. I am highly enthusiastic to work in CGAL during the
>> summer. I have my own project idea in my mind.
>>
>> My project idea is to make libraries that could compute the singular
>> value decomposition( SVD ), QR factorization, LU factorization, Eigen
>> value calculator, Least square problem solutions in C++. My main aim
>> is to implement this with the best efficiency like the Gauss newton's
>> method, householder's transform etc.
>
> [...snip...]
>
> A quick question:
>
> Aren't all of those in Eigen [1] already? What would be the value gain
> in re-implementing them?
>
> Cheers,
> Philipp Moeller
>
> [1] : http://eigen.tuxfamily.org/index.php?title=Main_Page
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>
- [cgal-discuss] Google Summer of Code Idea, sainyam galhotra, 03/29/2012
- Re: [cgal-discuss] Google Summer of Code Idea, Philipp Moeller, 03/29/2012
- Re: [cgal-discuss] Google Summer of Code Idea, sainyam galhotra, 03/29/2012
- Re: [cgal-discuss] Google Summer of Code Idea, Manuel Yguel, 03/29/2012
- Re: [cgal-discuss] Google Summer of Code Idea, sainyam galhotra, 03/29/2012
- Re: [cgal-discuss] Google Summer of Code Idea, Philipp Moeller, 03/29/2012
Archive powered by MHonArc 2.6.16.