Page 512 - Applied Numerical Methods Using MATLAB

SUBJECT INDEX 501
Legendre polynomial, 236 P
length of arc/curve, 257 Pade approximation, 129, 160
limit, 483 parabolic PDE, 406, 410, 412, 414, 430, 438,
linear equation, 71, 79 449
linear programming (LP), 355, 361 two-dimensional PDE, 412
logical operator, 25 parallelepiped, 389
loop, 26 parallelogram, 388
loop iteration, 39 parameter passing through VARARGIN, 45
Lorenz equation, 297 parameter sharing via GLOBAL, 44
loss of significance, 31, 32 partial differential equation (PDE), 401
LSE (least squares error), 75 partial pivoting, 81,85,105
LU decomposition (factorization), 92 path, 1
PDE mode, 434
M PDEtool, 429–431, 435, 456
mantissa field, 28 penalty, 346–349, 362, 366
mat-file, 2 permutation, 94, 467
mathematical functions, 10 persistent excitation, 169
matrix, 15, 463 physical meaning of eigenvalues and
matrix inversion lemma, 78, 469 eigenvectors, 385
mean value theorem, 461 pivoting, 85–88, 105–106
mesh, 11, 48, 49, 431–444 plot, 6–11
midpoint rule, 222 Plot mode, 440
minimum-norm solution, 73 Polak-Ribiere (PR) method, 332, 333
mixed boundary condition, 287, 306, 308 polynomial approximation, 124
modal matrix, 373–376 polynomial curve fitting by least squares, 146,
mode, 285, 377–378, 386, 432, 434 169
modification formula, 272, 274 polynomial wiggle, 124
mu law, mu-inverse law, 53, 335 positive definite, 468
predictor/corrector errors, 272
N projection operator, 74
negligible addition, 31 pseudo (generalized) inverse, 17, 73, 76
Nelder-Mead Algorithm, 325
nested computing, 38, 121 Q
nested (calling) routine, 40 QR decomposition (factorization), 97, 392–396
Neumann boundary condition, 404, 431, 447, quadratic approximation method, 323–325
448, 451 quadratic interpo1ation, 157
Newton method, 186, 188, 191, 330, 332 quadratically convergent, 188
Newton polynomial, 119 quadrature, 222, 231, 234
nonlinear BVP, 312 quantization error, 63, 212
nonlinear least squares (NLLS), 352 quenching factor, 335
nonnegative least squares (NLS), 355
norm, 58 R
normal (Gaussian) distribution, 24 rank, 467
normalized range, 29 recursive, 40, 66, 176, 201, 228, 231
null space, 73, 467 recursive least square estimation (RLSE), 76,
numerical differentiation, 209, 244 104
numerical integration, 222, 247, 249 redundancy, 83, 85
regula falsi, 185
O relational operators, 25
on-line recursive computation of DFT, 176 relative error, 33
orthogonal, 382, 395, 466 relaxation, 104, 115
orthonormal, 382, 385 reserved constants/variables, 13
over-determined, 75 Richardson’s extrapolation, 211, 216
overflow, 34, 64 RLSE (Recursive Least Squares Estimation), 76