|
Boost : |
Subject: Re: [boost] [boost.ublas] [gsoc'15]
From: Yan Ni (leckie.dove_at_[hidden])
Date: 2015-03-14 03:53:05
If you don't have one, I think that OCTAVE maybe a good alternative for
MATLAB
2015-03-10 21:18 GMT+08:00 Rajaditya Mukherjee <
rajaditya.mukherjee_at_[hidden]>:
> If you have a license of MATLAB, you can use the gallery function to
> generate some very good test matrices.
>
> *Rajaditya Mukherjee *
> *3rd Year Graduate Student*
> Dept. of Computer Science and Engineering
> The Ohio State University
> Columbus, Ohio
> Tel :- +1-(614)-271-4439
> email :- rajaditya.mukherjee_at_[hidden] <mukherjee.62_at_[hidden]>,
> raj_at_[hidden] <mukherjr_at_[hidden]>
>
>
> On Tue, Mar 10, 2015 at 8:18 AM, Ganesh Prasad <sir.gnsp_at_[hidden]> wrote:
>
> > Hey Dhruv
> > I am an applicant myself, I think I can give you a few ideas regarding
> your
> > queries.
> >
> > > 1. Can someone please direct me to some code snippet that shows how the
> > > error handling code is written in boost library.
> >
> > Go through the library source code thoroughly. Use a code dependency
> graph
> > generator to browse code easily. (Easiest way is to run doxygen over the
> > ublas
> > directory). That will make going through the code real fast.
> >
> > > 2. What sort of test code is required? Do we need to have a test case
> > with
> > > hard-coded output to be checked against the results obtained when the
> > test
> > > case is passed to the algo. Or there's some other predefined format for
> > > testing codes in boost library.
> >
> > Not sure about the format, but the tests should cover as many cases as
> > possible.
> >
> > Best wishes
> > Ganesh Prasad
> >
> > On 10 March 2015 at 15:03, Dhruv Kohli <codechiggum_at_[hidden]> wrote:
> >
> > > Hello,
> > >
> > > I am Dhruv, majoring in Mathematics & Computing from Indian Institute
> of
> > > Technology, Guwahati. After doing a bit of research over the project
> > ideas,
> > > I found the idea of further developing boost.ublas library interesting
> > and
> > > have started writing the programming competency code. Here is the link
> to
> > > the code I've written yet:
> > >
> >
> https://github.com/chiggum/boost.ublas/blob/master/gaussian_elimination.hpp
> > > .
> > > Though the code is not yet complete, but a naive version of algorithm
> is
> > > implemented and is integrated into ublas. To me, the code seems to be
> > > running properly.
> > >
> > > I need a little help for proceeding further.
> > > 1. Can someone please direct me to some code snippet that shows how the
> > > error handling code is written in boost library. To be specific, the
> > > gaussian elimination doesn't work on singular matrices. So, I would
> like
> > to
> > > set the errno and display appropriate message to the user whenever a
> > > singular matrix is given as an input.
> > >
> > > 2. What sort of test code is required? Do we need to have a test case
> > with
> > > hard-coded output to be checked against the results obtained when the
> > test
> > > case is passed to the algo. Or there's some other predefined format for
> > > testing codes in boost library. Sorry, I haven't yet gone through most
> of
> > > the code in boost library.
> > >
> > > Any further helpful links/resources are welcomed.
> > >
> > > Thanks & Best regards,
> > > Dhruv
> > > https://github.com/chiggum
> > >
> > > P.S. Sorry for reposting the mail. I am still waiting for a reply.
> > >
> > > _______________________________________________
> > > Unsubscribe & other changes:
> > > http://lists.boost.org/mailman/listinfo.cgi/boost
> > >
> >
> > _______________________________________________
> > Unsubscribe & other changes:
> > http://lists.boost.org/mailman/listinfo.cgi/boost
> >
>
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>
-- with kind regards ------------------------------------------------------------------ Yan Ni, undergraduate of Department of Computer Science, School of Electronic Engineering & Computer Science, Peking University
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk