# HG changeset patch
# User dbateman
# Date 1182721028 0
# Node ID 2de995da10b8531c4eae33372ab4a514010efda4
# Parent  f7fdea19da88c34b954f07b3462dd24db18adb03
[project @ 2007-06-24 21:37:08 by dbateman]

diff -r f7fdea19da88 -r 2de995da10b8 doc/interpreter/interp.txi
--- a/doc/interpreter/interp.txi	Wed Jun 20 18:10:04 2007 +0000
+++ b/doc/interpreter/interp.txi	Sun Jun 24 21:37:08 2007 +0000
@@ -64,12 +64,6 @@
 @end float
 @end ifnotinfo
 
-This means that in general the 'spline' method results in smooth
-results. If the function to be interpolated is in fact smooth, then
-'spline' will give excellent results. However, if the function to be
-evaluated is in some manner discontinuous, then 'cubic' or 'pchip'
-interpolation might give better results.
-
 Fourier interpolation, is a resampling technique where a signal is
 converted to the frequency domain, padded with zeros and then
 reconverted to the time domain.
diff -r f7fdea19da88 -r 2de995da10b8 doc/interpreter/sparse.txi
--- a/doc/interpreter/sparse.txi	Wed Jun 20 18:10:04 2007 +0000
+++ b/doc/interpreter/sparse.txi	Sun Jun 24 21:37:08 2007 +0000
@@ -604,7 +604,7 @@
 To correct this behavior would mean that zero elements with a negative
 sign-bit would need to be stored in the matrix to ensure that their 
 sign-bit was respected. This is not done at this time, for reasons of
-efficient, and so the user is warned that calculations where the sign-bit
+efficiency, and so the user is warned that calculations where the sign-bit
 of zero is important must not be done using sparse matrices.
 
 In general any function or operator used on a sparse matrix will