This does not exist, but the right place would be to modify the behavior of MAT_IGNORE_ZERO_ENTRIES<br>to use a tolerance.<br><br> Matt<br><br><div class="gmail_quote">On Tue, Dec 29, 2009 at 4:38 PM, Dominik Szczerba <span dir="ltr"><<a href="mailto:dominik@itis.ethz.ch">dominik@itis.ethz.ch</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">-----BEGIN PGP SIGNED MESSAGE-----<br>
Hash: SHA1<br>
<br>
Is it possible to remove small (subject to given tol) entries in my<br>
sparse coefficient matrix after the values have been set (added)? I have<br>
a highly convective problem where I ask myself what's better, keep lots<br>
of explicit zeros to rescue constant non-zero pattern or eliminate the<br>
near-zero entries.<br>
Dominik<br>
-----BEGIN PGP SIGNATURE-----<br>
Version: GnuPG v1.4.9 (GNU/Linux)<br>
<br>
iEYEARECAAYFAks6hNcACgkQ/EBMh9bUuzI1HgCfZElssh2ARTcWCUi4u8GepkcA<br>
ljsAoNj6o87hSP9MqjgpC6jCelO098PV<br>
=JpNc<br>
-----END PGP SIGNATURE-----<br>
</blockquote></div><br><br clear="all"><br>-- <br>What most experimenters take for granted before they begin their experiments is infinitely more interesting than any results to which their experiments lead.<br>-- Norbert Wiener<br>