Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Antia H.M. — Numerical Methods for Scientists and Engineers
Antia H.M. — Numerical Methods for Scientists and Engineers



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Numerical Methods for Scientists and Engineers

Автор: Antia H.M.

Аннотация:

This book has evolved out of lecture courses delivered to Research Scholars at the Tata Institute of Fundamental Research during the period 1978-88. It attempts to provide a practical guide for numerical solutions to mathematical problems on digital computers. It is intended for both students and research workers in science and engineering. Readers are expected to have a reasonable background in mathematics as well as computer programming.
The enormous variety of problems that can be encountered in practice makes numerical computation an art to some extent, and as such the best way of learning it is to practice it. Attempting to learnnumerical methods by simply attending lectures or by just reading a book is like trying to learn how to play football by the same method. All students are therefore urged to try out the methods themselves on any problem that they may fancy, not necessarily the ones given in this book. In fact, the reader will probably not appreciate the contents unless he makes a serious attempt to usenumerical methods for solving problems on computers.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1991

Количество страниц: 977

Добавлена в каталог: 17.01.2010

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Polynomial, orthogonal      188 195 196 200 402 406 407 409
Polynomial, real roots      306—308
Polynomial, refining roots      309 312
Polynomial, roots      59 305—312 318 319 321 825—829
Polynomial, Sturm sequence      307
Polynomial-time algorithm      386
POLYR      311 320 322 790 825 828
Polytrope      597
Positional number system      18
Positive definite kernel      601
Positive definite matrix      63 73 97 112 360 364 410 478 682 712
Positive semidefinite matrix      63
Potential problem      701
Powell, M. J. D.      363 364 365 372
Powell’s method      371 374
Power method      479—484 613 741
Power method with shift      480
Power method, annihilation      481
Power method, complex conjugate eigenvalues      480 515 741
Power method, convergence      480 741
Power method, convergence criterion      483
Power method, defective matrix      514 741
Power method, deflation      481 515
Power method, multiple eigenvalues      480
Power method, Rayleigh quotient      481
Power method, roundoff error      480 481 483
Power method, subdominant eigenvalues      480
Power series      435 864
Power-residue method      252
Predictor      532 558 591 620
Predictor, Adams — Bashforth      535
Predictor-corrector methods      532—545 656 898
Predictor-corrector methods for partial differential equations      651
Predictor-corrector methods, Adams      536 538 560 903
Predictor-corrector methods, adjusting step size      537 538
Predictor-corrector methods, choice of order      534
Predictor-corrector methods, convergence of iteration      533 558
Predictor-corrector methods, Hamming’s      535 539 541 560
Predictor-corrector methods, improving accuracy of corrector      591 745
Predictor-corrector methods, interpolation for final value      539
Predictor-corrector methods, Milne’s      535 539 541
Predictor-corrector methods, modifier      534 535
Predictor-corrector methods, one iteration on corrector      544 590 745
Predictor-corrector methods, stability      534 538 590 591 745
Predictor-corrector methods, starting values      536 537 538 592 746 899 904
Predictor-corrector methods, stiffly stable      558 559 905
Predictor-corrector methods, truncation error      534 538 540
Predictor-corrector methods, variable order variable step size      538
Press, W. H.      252 253 270 379 804
Prime number      20 419 422
Probability density distribution      250 254 725
Probability integral      251
Probable error      250
PRODUCT      39
Product Gauss rules      243 245 688 795 797
Product rules      241—244 245 795 797
Product rules, over disk      242
Product rules, over sphere      269 723
Program, clarity      10
Program, debugging      7 15
Program, efficiency      11 13
Program, quality      10
Program, reliability      12
Program, robustness      12
Program, structured      11
Program, validation      15
Programming      7—15
Programming, bug      3 11 12 15
Projectile      2 3
Property (A)      679
Pseudo-random sequence      251 804
Pseudo-singularity      205
QD table      434
QL algorithm      497 498—501 506 881
QL algorithm with shift      498 500
QL algorithm, choice of shift      500
QL algorithm, convergence      498 500
QL algorithm, multiple eigenvalues      500
QR algorithm      91 498 502 505 506—509 765 893
QR algorithm with implicit shift      507
QR algorithm, choice of shift      508
QR algorithm, convergence failure      508 518
QR algorithm, deflation      508
QR algorithm, double      507
QR algorithm, eigenvector      509
Quadratic equations      13 31 32
Quadratic interpolation      126 291 298 351 353 354 374 387
Quadratic model      363
Quadratic termination      365 368 371 372
Quadrature      170—233 523 719—722 780-794
Quadrature based method      302—305 820
Quadrature method      602—608 923 928 929
Quadrature method, eigenvalue problem      613 923
Quadrature method, Fredholm equations      602—608 616 617 749 923
Quadrature method, Volterra equations      619—627 628 928 929
Quadrature of oscillatory functions      205 206 214 227 265 267 791
Quadrature of periodic functions      222 227 229 232 262
Quadrature of tabulated functions      180 233 781
Quadrature, $\epsilon$-algorithm      185 203 212 783
Quadrature, adaptive      207 211 219 223—226 227 231 793
Quadrature, Boole’s rule      175
Quadrature, bracketing property      174
Quadrature, Cauchy principal value      201 207 214 266
Quadrature, change of variable      203 213
Quadrature, Chebyshev      194 263
Quadrature, choice of formula      226
Quadrature, composite formulas      175 176 177 190 199 200
Quadrature, convergence criterion      220 222 225 226
Quadrature, cubic spline      180 781
Quadrature, extrapolation methods      181—187 203 204 208 212 223 782 783
Quadrature, Filon’s formula      205 791
Quadrature, Gauss — Chebyshev      196
Quadrature, Gauss — Hermite      199
Quadrature, Gauss — Jacobi      197
Quadrature, Gauss — Kronrod rule      191 200 220 223 224 793 794
Quadrature, Gauss — Laguerre      199 788
Quadrature, Gauss — Legendre      189 190 194 229 784
Quadrature, Gaussian formulas      188—192 195—201 204 214 264 784—790
Quadrature, Gregory’s formula      180 262
Quadrature, improper integrals      183 195—218 227 228 233
Quadrature, least squares formula      463
Quadrature, Lobatto rule      192 205 265 721
Quadrature, logarithmic singularity      720
Quadrature, method of undetermined coefficients      187 201
Quadrature, midpoint rule      173 176 187
Quadrature, Newton — Cotes formulas      171—180 192 194 201 206
Quadrature, over infinite interval      212—218 233 787 788
Quadrature, parallel processing      259
Quadrature, Radau rule      192
Quadrature, rectangle rule      172 173
Quadrature, Romberg      181 182 190 227 229 261 262 782
Quadrature, roundoff error      179 182 190 192—194 205 211 221 226 263 722 783
Quadrature, rule      175 180
Quadrature, Simpson’s      3 8
Quadrature, Simpson’s rule      174 176 180 182 227 229 780
Quadrature, singularity      183 195—211 224 225 227 228 231 782
Quadrature, Trapezoidal rule      173 174 176 180 181 183 186 212 227 232 243 262 781 782
Quadrature, truncation error      172 174 175 176 181 183 188 189 195 781
Quadrature, uitomatic      219—233 780—794
Quadrature, weight function      195—201 204 206 214 228 264
Quantization      25
Quasi — Newton condition      365
Quasi — Newton methods      364—370 375 842
Quasi — Newton methods, BFGS formula      365 842
Quasi — Newton methods, DFP formula      365 389
Quasi — Newton methods, line search      366 367 844
Quasi — Newton methods, pitfalls      367
Quasi — Newton methods, roundoff error      368
Quasilinear equations      635 696
Quater-imaginary      21
Quotient-difference (QD) algorithm      434 472
Rabinowitz, P.      80 171 177 181 183 191 201 206 226 245 256 305 377 433 442 547
Radau quadrature formula      192
Radiative transfer      633
Radix point      18
Ralston, A.      80 181 433 442 547 593
Ran      254 804 886
Random numbers      150 168 250 251 402 411 460 463 464 485
Random numbers, generation      252 253 725 804
RANF      253 254 803 804
Range of matrix      87 88 735
Rank      61 87 94 380 475 477
Rao, K. R.      419 422
Rate of convergence      677
Rational function      121 396
Rational function approximation      431—457 863—871
Rational function approximation, minimax      447—454 456 867—871
Rational function approximation, Pade      431—437 863
Rational function extrapolation      166 169 554 562 908
Rational function interpolation      139—144 772 907
Rational function interpolation, existence      139
Rational function interpolation, pitfalls      144
Rational function, conversion to continued fraction      433
Rational function, diagonal      140
Rational function, evaluation      433
RATNAL      142 772
Rayleigh quotient      481 482 485 486 516 876 878 886
Rayleigh quotient, integral equations      613
Real roots      (see Roots)
Real symmetric matrix      476 499
Real symmetric matrix, eigenvalue problem      491—501 512 513 878—886
Rectangle rule      172 173 622
Rectangular elements      688 702 752
Rectangular elements, continuity      688
Recurrence relation      406
Recurrence relations      48—51 618
Recurrence relations for continued fraction      433
Recurrence relations for evaluating a polynomial      122 275 407
Recurrence relations, Chebyshev polynomials      437 469
Recurrence relations, Clenshaw’s      407 438 465 857
Recurrence relations, orthogonal polynomials      406
Recurrence relations, parallel processing      103 107
Recurrence relations, stability      50 51 708 709
Recursive doubling      102
Recursive method, multiple integration      241
Recursive method, system of nonlinear equations      323
Red-black ordering      692
Reduction to tridiagonal form      492—494 878
refining      303 309 312 821 825 828
Refining a root      303 309 312 821 825 828
Regula falsi method      278—283 335
Regula falsi method for two variables      324
Regula falsi method, convergence      279
Regula falsi method, Fourier’s condition      335 726
Regula falsi method, modified      280 283 335
Regula falsi method, truncation error      279
Regularity conditions      587
Regularization method      619
Reinsch, C.      60 89 93 379 400 474 762
Relative error      25 26 222 315 544
Relative minimax approximation      449
Relative stability      526 527 530
Relaxation method      678
Relaxation parameter      679 690 692 941
Relaxation parameter, optimum value      679 680
Reliability      12 219
REMES      450 451 452 453 867 870
Remes algorithm      447—451 867
Remes algorithm, discrete approximation      454
Remes algorithm, initial approximation      448
REPS      754
Residual      34 45 77 81 83 398 410 609 678
Response function      426
Reverse communication      815 818 916
Riccati transformation      591
Rice, J. R.      67 223 226 550 610 634
Richardson’s $h \rightarrow 0$ extrapolation      (see Extrapolation methods)
Richtmyer, R. D.      648 653 664
Riemann integral      177 201 214 255 722
Riemann sum      177 182
Riemann zeta function      13 181 234 236 237 722 723
RK      4 896 897 898 899 904
RKM      549 551 562 569 570 895 898 934
Robust approximation      395 460
Robustness      12
Role of compilers      43
Role of compilers, statistical analysis      34 193
Role of compilers, summation      34 36 37 38 40 42 193 237 257 708
Rolle’s Theorem      120
Romberg integration      181 227 229 261 262 304 782
Romberg integration, convergence      182 190
ROMBRG      223 228 229 232 782
Roots      272 808
Roots of analytic functions      302—305 820
Roots of polynomials      305—312 318—321 825-829
Roots, bracketing      273 278 280 283 291 295 296—298 307 324 807 814
Roots, complex      296—305 308—312 814-829
Roots, deflation      302 309 311 312 317 340 341 815 817 825 826 829
Roots, domain of indeterminacy      274 275 285 294 295 313 316 726 816 824
Roots, multiple      275 282 285 288 289 293 300 319 321 326 337 338 344 727—729 810
Rosenbrock’s function      368 375 388
round      47 755
Roundoff error      10
Roundoff error, approximation      401 406 407 408 412 450 451 454 468 469
Roundoff error, backward analysis      34 38 39 43 45 79 81 512
Roundoff error, complex arithmetic      29
Roundoff error, convergence criterion      167 221 316
Roundoff error, detection      167 221 316 350
Roundoff error, differential equations      531 542 543 545 559 569 591 592 745
Roundoff error, differentiation      158 159 164 167 718 778 779
Roundoff error, eigenvalue problem      480 481 483 485 493 494 502 504 505 506 512 513 517
Roundoff error, estimation      33 313 314
Roundoff error, floating-point arithmetic      27 28 30 32 54 705 706 707
Roundoff error, forward analysis      34 35 43
Roundoff error, integration      179 182 190 192—194 205 211 221 226 257 263 722 783
Roundoff error, interpolation      126 150 151 716
Roundoff error, inverse Laplace transform      431
Roundoff error, linear equations      65 67 79—85 88 98 112 711
Roundoff error, minimization      349—351 358 368 374 837
Roundoff error, nonlinear equations      272 274 283 295 309 311 313 314 316 342 726 816
Roundoff error, partial differential equations      666 699
Roundoff error, quadratic equations      31 32
Roundoff error, structured      11
Roundoff error, using Chebyshev polynomials      440—444 865
Routh — Hurwitz criterion      590
Runge — Kutta methods      536 545—553 559 563 621 652 654 656 895 899 904
Runge — Kutta methods for second-order equations      593
Runge — Kutta methods, adjusting step size      549 895
Runge — Kutta methods, correcting for truncation error      549 593 746
Runge — Kutta methods, efficiency      548
Runge — Kutta methods, fourth-order      547 550 593 897
Runge — Kutta methods, implicit      553 593 746
Runge — Kutta methods, second-order      546 898
Runge — Kutta methods, stability      547 549 550 593 746
Runge — Kutta methods, system of differential equations      553
Runge — Kutta methods, third-order      547
Runge — Kutta methods, truncation error      547 548 549
Runge — Kutta — Fehlberg method      550
Runge — Kutta — Gill method      548
Runge — Kutta — Merson method      550
Runge, C.      129
Rutishauser, H      434
Saddle point      359 360 364 367 376 389 733 842
Saddle point, detecting      368
Safety factor      549
Saha’s equation      343
Sampling      414 415
Sampling rate      414
Sampling theorem      415
Sande — Tukey FFT algorithm      421
1 2 3 4 5 6 7 8 9
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте