|
|
Авторизация |
|
|
Поиск по указателям |
|
|
|
|
|
|
|
|
|
|
Antia H.M. — Numerical Methods for Scientists and Engineers |
|
|
Предметный указатель |
Laplace’s equation, variational formulation 689 (see also Poisson’s equation)
Laurent series 211
Lax 665 938
Lax — Friedrichs method 662 664 668
Lax — Friedrichs method, artificial damping 663
Lax — Wendroff method 664 665 668 938
Lax — Wendroff method, amplification matrix 699 751
Lax — Wendroff method, artificial damping 665
Lax — Wendroff method, boundary conditions 665
Lax — Wendroff method, several space variables 670
Lax — Wendroff method, stability 665
Leakage in power spectrum 423 424
Leapfrog method 698
Least squares 46 61 87 88 89 395 397—414 462—466 741 767 855
Least squares for solving integral equations 609 617
Least squares for solving partial differential equations 688 689
Least squares in two dimensions 46
Least squares, choice of degree 402 406
Least squares, cubic spline 465 735
Least squares, design matrix 398 401 403
Least squares, differentiation 405 409 414 463
Least squares, error ellipsoid 401
Least squares, error in parameter estimate 399 401 407 411
Least squares, five-point parabola 462 734
Least squares, Householder’s transformation 400
Least squares, integration 463
Least squares, Levenberg — Marquardt method 411
Least squares, linear 397—409 855
Least squares, Monte Carlo simulation 411
Least squares, Newton’s method 410
Least squares, nonlinear 409—414
Least squares, normal equations 398 409 464
Least squares, principle 395
Least squares, singular value decomposition (SVD) 87 88 400—402 404 405 406 412 464 617 767
Least squares, smoothing 404 413
Least squares, straight line fit 462
Least squares, trigonometric approximation 417 464
Least squares, using orthogonal polynomials 406 407—409 855
Least squares, wild points 396 402 405
Left eigenfunction 613
Left eigenvector 475 486 580 581
Legendre polynomials 59 188 198 340 594 595 610 747
Lehmer, D. H. 251 308
Leibnitz, G. W. 19
Lelevier, R. 669
Level 56
Level-index 56 707
Levenberg — Marquardt method 329 411 412
Lewy, H. 660
Limit point 612 615
Lindberg, B. 595
Line search 362 366 367 373 374 844 849
Line search with derivatives 366 367 844
Line search without derivatives 373 374 849
Line search, criterion for acceptance of minimum 366
Linear approximation 396 397—409 455 469 855 873
Linear congruential method 252 804
Linear differential equations 522 566 568 572 576 578 589
Linear differential equations, general solution 566
Linear elementary divisor 477 479
Linear equations 13 60—116 710—714 755-767
Linear equations with singular matrix 88
Linear equations, back-substitution 65 69 75 80 86 107
Linear equations, condition number 78 79 81 85 87 94 710 712
Linear equations, Crout’s algorithm 74 75 106 757
Linear equations, direct methods 60 62 96 98
Linear equations, Doolittle’s algorithm 73 106
Linear equations, existence and uniqueness of solution 61
Linear equations, forward substitution 69 75 80
Linear equations, Gauss — Jordan elimination 69 86 106 107 109
Linear equations, Gauss — Seidel method 97 677 678 713 714
Linear equations, Gaussian elimination 64—73 96 97 98 106 107 109 110 114 755
Linear equations, ill-conditioning 45 62 77 78 79 84 85 94 710 711 756 758 761
Linear equations, iterative methods 62 96—99 677 680
Linear equations, iterative refinement 82—85 111 711 712 760
Linear equations, Jacobi method 96 677 678
Linear equations, least squares solution 61 87 88 89
Linear equations, overdetermined system 61 87 89 400 609 617
Linear equations, parallel processing 106—108
Linear equations, roundoff error 65 67 79—81 85 88 98 112 711
Linear equations, singular value decomposition 87—95 762—767
Linear interpolation 120 126 134 150 278 676
Linear interpolation in n dimensions 144 775
Linear programming 377—386 455 457 459 609 851 853 875
Linear programming, basic feasible vector 380 383 851
Linear programming, degeneracy 380 381 391 457 853 875
Linear programming, dual problem 386 455 457
Linear programming, feasible vector 378
Linear programming, fundamental theorem 380
Linear programming, simplex method 379—386 456 851 853 875
Linear programming, slack variables 379 386
Linear programming, standard form 379 853
Linear programming, tableau 382 386
lines 934
LINMIN 367 842 844 846 868
LINMNF 374 847 849 851
LINNRN 145 775
Lipschitz condition 744
Lobatto quadrature formula 192 205 265 721
Local coordinates 686
Local maximum 360
Local minimum 346 359 360
Local truncation error 524 525 528 531 532 534 547 548 572 641 660
locate 775 776 777
Love’s equation 630
Lower Hessenberg matrix 63
Lower triangular matrix 63 72 76 498
LP problem (see Linear programming)
LU decomposition (see Triangular decomposition)
Lyness, J. N. 226 302 303 304 305
Maclaurin series 17 42 57 432 435 440 708 863
Madelung transformation 585
Mantissa 23 24 26 27 28 30 38 56
Marsaglia, G. 252
Mathieu equation 597
Matrix method for stability 642 649
Matrix product 105
Matrix with nonlinear elementary divisor 477 490 502 512 514 515 519 741 742 877
Matrix, balancing 502 503 510 888
Matrix, band 62 65 96 97 107 109 494 579 653 673
Matrix, condition number 78 79 81 85 87 94 609 618 710 712
Matrix, defective 477 490 502 512 514 515 519 741 742 877
Matrix, deflation 481 508 515
Matrix, derogatory 477
Matrix, determinant 65 68 475 479 494 518 519 579 581 582 756 757 760 761 920
Matrix, diagonal 62 69 87 92 476 491 499
Matrix, diagonalization 491 499
Matrix, diagonally dominant 107 112
Matrix, equilibration 67 68 75 79 85 110 111
Matrix, Euclidean norm 97 512
Matrix, hermitian 63 476 486 497 501
Matrix, Hessenberg 63 109 486 491 501 507 517 893
Matrix, inverse 86 113 756 758 761
Matrix, norm 78 92 97 367 502 512
Matrix, null-space 61 87 88 89
Matrix, orthogonal 63 87 89 115 491 498 506 881
Matrix, positive definite 63 73 97 112 360 478 682 712
Matrix, range 87 88 735
Matrix, rank 61 87 94 475 477
Matrix, similarity transform 476 491 498 502 503 505 512
Matrix, singular 62 67 87 88 95 114 475
Matrix, singular value decomposition 87—95 762
Matrix, singular values 87 88
Matrix, sparse 62 80 96 97 98 99 114 332 365 377 483 505 506 655 670 677 690
Matrix, spectral norm 78
Matrix, symmetric 63 110 476 491 494 499
Matrix, trace 483
Matrix, triangular 63 69 71 72 76 86 96 107 109 113 498 506 710
Matrix, tridiagonal 62 107 109 135 486 491 497 499 505 576 710
Matrix, unitary 63 78 497
| Matrix, W 487 495
Matrix-vector product 104
Maximization 345
Maximizer 347 353 358 841
Maximum 345
Maximum principle 641
Maximum, local 360
Maxwell, J. C. 245
MCARLO 803
Mead, R. 361
Mean value theorem 172 174 279 531
Measurement error 2
Median 396
Memory 11 578
Memory bank conflict 101 104 694
Meromorphic functions 305
Merson, R. H. 550
Method of artificial pole 449 453
Method of characteristics 659
Method of lines 652—655 669 690 934
Method of simultaneous displacement 96
Method of steepest descent 362 389
Method of successive displacements 97
Method of undetermined coefficients 245
Method of undetermined coefficients, differential equations 523 524 528 746
Method of undetermined coefficients, differentiation 160—163
Method of undetermined coefficients, integration 187 201 245
Method of undetermined coefficients, interpolation 138 144 147 153
Method of undetermined coefficients, truncation error 160 524
Midpoint method 554 908
Midpoint method, stability 590
Midpoint rule 173 177 187 547 627
Midpoint rule, composite 176
Midrange 396
Milne’s method 535 539 541 547
MIMD 100 260 334 691
Minimax approximation 471 739
Minimax approximation, Chebyshev theorem 446
Minimax approximation, differential correction algorithm 455 457 871
Minimax approximation, discrete data 454—458 871
Minimax approximation, error bounds 447
Minimax approximation, error curve 446 449 450 452 453 454
Minimax approximation, exchange algorithm 454
Minimization 328 345—391 732—734 835-853
Minimization, alternating variables method 363
Minimization, Brent’s method 354—356 838
Minimization, conjugate gradient method 376
Minimization, constrained 347 377—386 851
Minimization, convergence criterion 350 354 367
Minimization, Davidon’s method 356—359 387 840
Minimization, direction set methods 370—375 847
Minimization, golden section search 347—349 355 374 837
Minimization, Hermite interpolation 356 387 840
Minimization, ill-conditioning 733
Minimization, least squares 398 410 411
Minimization, line search 362 366 367 373 374 844 849
Minimization, linear programming 377—386 851—853
Minimization, method of steepest descent 362 389
Minimization, multivariate 359—376 842—851
Minimization, Newton’s method 363
Minimization, parabolic interpolation 351—354 374 387
Minimization, Powell’s method 371 374
Minimization, quadratic termination 365 368 371 372
Minimization, quasi — Newton methods 364—370 842
Minimization, roundoff error 349 350 351 358 368 374 837
Minimization, simplex method 361 379—386 851 853 875
Minimization, solving nonlinear equations 328
Minimization, using derivative 350 356—359 363—370 840—846
Minimizer 345 837 838 840 842 847
Minimum 345
Minimum, bracketing 347 350 351 366 835
Minimum, distinguishing from a maximum 350 353
Minimum, distinguishing from a saddle point 367 368
Minimum, domain of indeterminacy 349 354 358
Minimum, existence and uniqueness 346
Minimum, global 345 346 388
Minimum, local 346 359 360
Minimum, spurious 350
minmax 457 871
Minty, G. J. 391
Miranker, W. L. 33
Mixed radix representation 422 467
Modeling error 2
Modified midpoint method 554 909
Modifier 534 535
Moler, C. B. 60 87
Moments 200 790
Monomial 242 245
Monomial rules 245—249 269 724 799 800
Monomial rules, degree 3 246 724 799 800
Monomial rules, one-point rule 246
Monomial rules, over entire space 269 724
Monomial rules, over hypersphere 269 724
Monomial, degree 245
Monotone convergence 278
Monotone divergence 278
Monte Carlo method 249—255 803
Monte Carlo method, convergence 250 251
Monte Carlo method, importance sampling 254 725
Monte Carlo method, irregular region 251
Monte Carlo method, over entire space 269 724
Monte Carlo method, over fully symmetric region 246
Monte Carlo method, over hypersphere 269 724
Monte Carlo method, over irregular region 241 242 251
Monte Carlo method, over sphere 269 723
Monte Carlo method, product rules 241—244 269 723 795 797
Monte Carlo method, recursive evaluation 241
Monte Carlo method, roundoff error 257
Monte Carlo method, rule of degree 5 248 724
Monte Carlo method, singularity 244 248 259
Monte Carlo method, Stroud’s formula 247 799 801
Monte Carlo method, truncation error 248 250 257
Monte Carlo method, variance reduction 253 725
Monte Carlo method, weight function 250
Monte Carlo simulation 411 460
Morton, K. W. 648 653 664
MSTEP 538 551 559 562 563 654 753 898 903 904 905 934
MULER 2 753 815 818 915
MULINT 243 244 795
Muller 299 302 815 816 818
Muller, D. E. 299
Muller’s method 298—302 815—818 915
Muller’s method, convergence 299 338 727 728
Multicolor ordering 693
Multiple eigenvalues 477 480 485 495 497 500
Multiple integration 240—260 723—725 795-805
Multiple integration, change of variable 243
Multiple integration, choice of method 259
Multiple integration, equidietributed sequence 255—258 805
Multiple roots 300 338 727 728
Multiple roots in system of nonlinear equations 326 344
Multiple roots, condition number 319
Multiple roots, real roots 299 915
Multiple roots, roundoff error 314
Multiple shooting method 567
Multistep methods 523 555 557 898 904
Multivariate 473
Multivariate problems 148
Multivariate with constraints 457 473
Multivariate, polynomial 447 455
Multivariate, rational function 447—454 456 457 867—871
Multivariate, relative error 452
Multivariate, Remes algorithm 447—451 867
Multivariate, smoothing 458
Murphy’s Law 318
Murphy’s law, Tii 2 100 107
NEARST 126 768 769 773 774
NEARST, negative decimal system 21
Nelder, J. A. 361
Nested multiplication 122 125 275 433 438 865 871
|
|
|
Реклама |
|
|
|