[Changeset]: Re: [manual] bugs in sparse matric creation
Jaroslav Hajek
highegg at gmail.com
Thu Sep 18 08:43:28 CDT 2008
On Wed, Sep 17, 2008 at 8:41 PM, John W. Eaton <jwe at bevo.che.wisc.edu> wrote:
> On 15-Sep-2008, David Bateman wrote:
>
> | Francesco Potorti` wrote:
> | > Two things:
> | >
> | > 1) The second sentence makes no sense to me.
> | > -- Loadable Function: S = sparse (A)
> | > Create a sparse matrix from the full matrix A. is forced back to
> | > a full matrix is resulting matrix is sparse
> | >
> | > 2) The bottom of the page makes no sense to me, I do not even understand
> | > what is "the above problem"
> | >
> | > The above problem can be avoided in oct-files. However, the
> | > construction of a sparse matrix from an oct-file is more complex than
> | > can be discussed in this brief introduction, and you are referred to
> | > chapter *note Dynamically Linked Functions::, to have a full
> | > description of the techniques involved.
> | >
> | >
> | Please consider the attached changeset
>
> I applied this changeset.
>
I transplanted it to 3.0.x
> Thanks,
>
> jwe
> _______________________________________________
> Bug-octave mailing list
> Bug-octave at octave.org
> https://www-old.cae.wisc.edu/mailman/listinfo/bug-octave
>
--
RNDr. Jaroslav Hajek
computing expert
Aeronautical Research and Test Institute (VZLU)
Prague, Czech Republic
url: www.highegg.matfyz.cz
More information about the Bug-octave
mailing list