forked from johannesgerer/jburkardt-f
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathchebyshev_interp_1d.html
276 lines (235 loc) · 7.54 KB
/
chebyshev_interp_1d.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
<html>
<head>
<title>
CHEBYSHEV_INTERP_1D - Polynomial Interpolation in 1D using Lagrange Polynomials
</title>
</head>
<body bgcolor="#eeeeee" link="#cc0000" alink="#ff3300" vlink="#000055">
<h1 align = "center">
CHEBYSHEV_INTERP_1D <br> Polynomial Interpolation in 1D using Lagrange Polynomials
</h1>
<hr>
<p>
<b>CHEBYSHEV_INTERP_1D</b>
is a FORTRAN90 library which
determines the combination of Chebyshev polynomials which
interpolates a set of data, so that p(x(i)) = y(i).
</p>
<p>
<b>CHEBYSHEV_INTERP_1D</b> needs the QR_SOLVE and R8LIB libraries.
The test program needs the TEST_INTERP library.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>CHEBYSHEV_INTERP_1D</b> is available in
<a href = "../../c_src/chebyshev_interp_1d/chebyshev_interp_1d.html">a C version</a> and
<a href = "../../cpp_src/chebyshev_interp_1d/chebyshev_interp_1d.html">a C++ version</a> and
<a href = "../../f77_src/chebyshev_interp_1d/chebyshev_interp_1d.html">a FORTRAN77 version</a> and
<a href = "../../f_src/chebyshev_interp_1d/chebyshev_interp_1d.html">a FORTRAN90 version</a> and
<a href = "../../m_src/chebyshev_interp_1d/chebyshev_interp_1d.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../f_src/barycentric_interp_1d/barycentric_interp_1d.html">
BARYCENTRIC_INTERP_1D</a>,
a FORTRAN90 library which
defines and evaluates the barycentric Lagrange polynomial p(x)
which interpolates a set of data, so that p(x(i)) = y(i).
The barycentric approach means that very high degree polynomials can
safely be used.
</p>
<p>
<a href = "../../f_src/chebyshev/chebyshev.html">
CHEBYSHEV</a>,
a FORTRAN90 library which
computes the Chebyshev interpolant/approximant to a given function
over an interval.
</p>
<p>
<a href = "../../f_src/divdif/divdif.html">
DIVDIF</a>,
a FORTRAN90 library which
uses divided differences to compute the polynomial interpolant
to a given set of data.
</p>
<p>
<a href = "../../f_src/hermite/hermite.html">
HERMITE</a>,
a FORTRAN90 library which
computes the Hermite interpolant, a polynomial that matches function values
and derivatives.
</p>
<p>
<a href = "../../f_src/lagrange_interp_1d/lagrange_interp_1d.html">
LAGRANGE_INTERP_1D</a>,
a FORTRAN90 library which
defines and evaluates the Lagrange polynomial p(x)
which interpolates a set of data, so that p(x(i)) = y(i).
</p>
<p>
<a href = "../../f_src/nearest_interp_1d/nearest_interp_1d.html">
NEAREST_INTERP_1D</a>,
a FORTRAN90 library which
interpolates a set of data using a piecewise constant interpolant
defined by the nearest neighbor criterion.
</p>
<p>
<a href = "../../f_src/pwl_interp_1d/pwl_interp_1d.html">
PWL_INTERP_1D</a>,
a FORTRAN90 library which
interpolates a set of data using a piecewise linear interpolant.
</p>
<p>
<a href = "../../f_src/qr_solve/qr_solve.html">
QR_SOLVE</a>,
a FORTRAN90 library which
computes the least squares solution of a linear system A*x=b.
</p>
<p>
<a href = "../../f_src/r8lib/r8lib.html">
R8LIB</a>,
a FORTRAN90 library which
contains many utility routines using double precision real (R8) arithmetic.
</p>
<p>
<a href = "../../f_src/rbf_interp_1d/rbf_interp_1d.html">
RBF_INTERP_1D</a>,
a FORTRAN90 library which
defines and evaluates radial basis function (RBF) interpolants to 1D data.
</p>
<p>
<a href = "../../f_src/shepard_interp_1d/shepard_interp_1d.html">
SHEPARD_INTERP_1D</a>,
a FORTRAN90 library which
defines and evaluates Shepard interpolants to 1D data,
based on inverse distance weighting.
</p>
<p>
<a href = "../../f_src/spline/spline.html">
SPLINE</a>,
a FORTRAN90 library which
constructs and evaluates spline interpolants and approximants.
</p>
<p>
<a href = "../../f_src/test_interp/test_interp.html">
TEST_INTERP</a>,
a FORTRAN90 library which
defines a number of test problems for interpolation,
provided as a set of (x,y) data.
</p>
<p>
<a href = "../../f_src/test_interp_1d/test_interp_1d.html">
TEST_INTERP_1D</a>,
a FORTRAN90 library which
defines test problems for interpolation of data y(x),
depending on a 2D argument.
</p>
<p>
<a href = "../../f_src/vandermonde_interp_1d/vandermonde_interp_1d.html">
VANDERMONDE_INTERP_1D</a>,
a FORTRAN90 library which
finds a polynomial interpolant to a function of 1D data
by setting up and solving a linear system for the polynomial coefficients,
involving the Vandermonde matrix.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Kendall Atkinson,<br>
An Introduction to Numerical Analysis,<br>
Prentice Hall, 1989,<br>
ISBN: 0471624896,<br>
LC: QA297.A94.1989.
</li>
<li>
Philip Davis,<br>
Interpolation and Approximation,<br>
Dover, 1975,<br>
ISBN: 0-486-62495-1,<br>
LC: QA221.D33
</li>
<li>
David Kahaner, Cleve Moler, Steven Nash,<br>
Numerical Methods and Software,<br>
Prentice Hall, 1989,<br>
ISBN: 0-13-627258-4,<br>
LC: TA345.K34.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "chebyshev_interp_1d.f90">chebyshev_interp_1d.f90</a>, the source code.
</li>
<li>
<a href = "chebyshev_interp_1d.sh">chebyshev_interp_1d.sh</a>,
BASH commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "chebyshev_interp_1d_prb.f90">chebyshev_interp_1d_prb.f90</a>,
a sample calling program.
</li>
<li>
<a href = "chebyshev_interp_1d_prb.sh">chebyshev_interp_1d_prb.sh</a>,
BASH commands to compile and run the sample program.
</li>
<li>
<a href = "chebyshev_interp_1d_prb_output.txt">chebyshev_interp_1d_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>CHEBYSHEV_COEF_1D</b> determines the Chebyshev interpolant coefficients.
</li>
<li>
<b>CHEBYSHEV_INTERP_1D</b> determines and evaluates the Chebyshev interpolant.
</li>
<li>
<b>CHEBYSHEV_VALUE_1D</b> evaluates a Chebyshev interpolant, given its coefficients.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../f_src.html">
the FORTRAN90 source codes</a>.
</p>
<hr>
<i>
Last revised on 14 October 2012.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>