Numerical algorithms with C:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1996
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XXII, 596 S. graph. Darst. 1 CD-ROM (12 cm) |
| ISBN: | 3540605304 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV010906905 | ||
| 003 | DE-604 | ||
| 005 | 20120830 | ||
| 007 | t | ||
| 008 | 960821s1996 d||| |||| 00||| engod | ||
| 020 | |a 3540605304 |9 3-540-60530-4 | ||
| 035 | |a (OCoLC)845182071 | ||
| 035 | |a (DE-599)BVBBV010906905 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-703 |a DE-20 |a DE-355 |a DE-19 |a DE-945 |a DE-29T |a DE-Aug4 |a DE-706 |a DE-634 |a DE-83 | ||
| 050 | 0 | |a QA297 | |
| 082 | 0 | |a 518.02855262 |b E5N8 |2 22 | |
| 082 | 0 | |a 519.4/0285/5133 |2 20 | |
| 084 | |a SK 900 |0 (DE-625)143268: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 084 | |a ST 600 |0 (DE-625)143681: |2 rvk | ||
| 084 | |a DAT 532f |2 stub | ||
| 084 | |a DAT 358f |2 stub | ||
| 084 | |a MAT 650f |2 stub | ||
| 100 | 1 | |a Engeln-Müllges, Gisela |d 1940- |e Verfasser |0 (DE-588)110051203 |4 aut | |
| 240 | 1 | 0 | |a Numerik-Algorithmen mit FORTRAN-77-Programmen |
| 245 | 1 | 0 | |a Numerical algorithms with C |c Gisela Engeln-Müllges ; Frank Uhlig |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1996 | |
| 300 | |a XXII, 596 S. |b graph. Darst. |e 1 CD-ROM (12 cm) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Algoritmos e estruturas de dados |2 larpcal | |
| 650 | 7 | |a Algoritmos |2 lemb | |
| 650 | 7 | |a Análise numérica |2 larpcal | |
| 650 | 7 | |a Análisis numérico |2 lemb | |
| 650 | 4 | |a C (Lenguajes de programación de computadoras) | |
| 650 | 7 | |a C++ |2 gtt | |
| 650 | 7 | |a Linguagem de programação (outras) |2 larpcal | |
| 650 | 7 | |a Numerieke wiskunde |2 gtt | |
| 650 | 7 | |a Programação(análise numérica) |2 larpcal | |
| 650 | 4 | |a C (Computer program language) | |
| 650 | 4 | |a Numerical analysis | |
| 650 | 4 | |a Numerical analysis |z Computer programs | |
| 650 | 0 | 7 | |a FORTRAN |0 (DE-588)4017984-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a C |g Programmiersprache |0 (DE-588)4113195-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a ANSI C |0 (DE-588)4233557-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a FORTRAN 90 |0 (DE-588)4267480-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a FORTRAN 77 |0 (DE-588)4113601-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Numerische Mathematik |0 (DE-588)4042805-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Programm |0 (DE-588)4047394-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a TURBO-PASCAL |0 (DE-588)4117264-4 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)4155008-0 |a Formelsammlung |2 gnd-content | |
| 689 | 0 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 2 | |a C |g Programmiersprache |0 (DE-588)4113195-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | 2 | |a FORTRAN 77 |0 (DE-588)4113601-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 2 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 2 | 2 | |a TURBO-PASCAL |0 (DE-588)4117264-4 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 3 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 3 | 2 | |a ANSI C |0 (DE-588)4233557-7 |D s |
| 689 | 3 | |8 4\p |5 DE-604 | |
| 689 | 4 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 4 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 4 | 2 | |a FORTRAN 90 |0 (DE-588)4267480-3 |D s |
| 689 | 4 | |8 5\p |5 DE-604 | |
| 689 | 5 | 0 | |a Numerische Mathematik |0 (DE-588)4042805-9 |D s |
| 689 | 5 | 1 | |a FORTRAN 77 |0 (DE-588)4113601-9 |D s |
| 689 | 5 | 2 | |a Programm |0 (DE-588)4047394-6 |D s |
| 689 | 5 | |8 6\p |5 DE-604 | |
| 689 | 6 | 0 | |a FORTRAN |0 (DE-588)4017984-9 |D s |
| 689 | 6 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 6 | |8 7\p |5 DE-604 | |
| 689 | 7 | 0 | |a FORTRAN |0 (DE-588)4017984-9 |D s |
| 689 | 7 | 1 | |a Numerisches Verfahren |0 (DE-588)4128130-5 |D s |
| 689 | 7 | |8 8\p |5 DE-604 | |
| 700 | 1 | |a Uhlig, Frank |d 1945- |e Verfasser |0 (DE-588)132562022 |4 aut | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007295273&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007295273 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 6\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 7\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 8\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804125398392373248 |
|---|---|
| adam_text | Contents
1 Computer Numbers, Error Analysis, Conditioning,
Stability of Algorithms and Operations Count 1
1.1 Definition of Errors 1
1.2 Decimal Representation of Numbers 3
1.3 Sources of Errors 6
1.3.1 Input Errors 6
1.3.2 Procedural Errors 7
1.3.3 Error Propagation and the Condition of a Problem 7
1.3.4 The Computational Error and Numerical Stability
of an Algorithm 10
1.4 Operations Count, et cetera 11
2 Nonlinear Equations in One Variable 13
2.1 Introduction 13
2.2 Definitions and Theorems on Roots 14
2.3 General Iteration Procedures 15
2.3.1 How to Construct an Iterative Process 15
2.3.2 Existence and Uniqueness of Solutions 16
2.3.3 Convergence and Error Estimates of Iterative Procedures ... 17
2.3.4 Practical Implementation 20
2.4 Order of Convergence of an Iterative Procedure 22
2.4.1 Definitions and Theorems 22
2.4.2 Determining the Order of Convergence Experimentally 24
2.5 Newton s Method 25
2.5.1 Finding Simple Roots 25
2.5.2 A Damped Version of Newton s Method 27
2.5.3 Newton s Method for Multiple Zeros; a Modified Newton s
Method 27
XIV Contents
2.6 Regula Falsi 28
2.6.1 Regula Falsi for Simple Roots 28
2.6.2 Modified Regula Falsi for Multiple Zeros 30
2.6.3 Simplest Version of the Regula Falsi 30
2.7 Steffensen Method 31
2.7.1 Steffensen Method for Simple Zeros 31
2.7.2 Modified Steffensen Method for Multiple Zeros 31
2.8 Inclusion Methods 32
2.8.1 Bisection Method 32
2.8.2 Pegasus Method 34
2.8.3 Anderson Bjorck Method 36
2.8.4 The King and the Anderson Bjorck King Methods,
the Illinois Method 39
2.8.5 Zeroin Method 39
2.9 Efficiency of the Methods and Aids for Decision Making 40
3 Roots of Polynomials 43
3.1 Preliminary Remarks 43
3.2 The Homer Scheme 44
3.2.1 First Level Homer Scheme for Real Arguments 44
3.2.2 First Level Homer Scheme for Complex Arguments 45
3.2.3 Complete Horner Scheme for Real Arguments 47
3.2.4 Applications 49
3.3 Methods for Finding all Solutions of Algebraic Equations 49
3.3.1 Preliminaries 49
3.3.2 Muller s Method 51
3.3.3 Bauhuber s Method 54
3.3.4 The Jenkins Traub Method 55
3.3.5 The Laguerre Method 56
3.4 Hints for Choosing a Method 56
4 Direct Methods for Solving Systems of Linear Equations .. 59
4.1 The Problem 59
4.2 Definitions and Theoretical Background 60
4.3 Solvability Conditions for Systems of Linear Equations 66
4.4 The Factorization Principle 67
4.5 Gaufi Algorithm 68
4.5.1 Gaufi Algorithm with Column Pivot Search 68
Contents XV
4.5.2 Pivot Strategies 72
4.5.3 Computer Implementation of Gaufi Algorithm 73
4.5.4 Gaufi Algorithm for Systems with Several Right Hand Sides 76
4.6 Matrix Inversion via Gaufi Algorithm 77
4.7 Linear Equations with Symmetric Strongly Nonsingular
System Matrices 78
4.7.1 The Cholesky Decomposition 78
4.7.2 The Conjugate Gradient Method 83
4.8 The Gaufi Jordan Method 87
4.9 The Matrix Inverse via Exchange Steps 88
4.10 Linear Systems with Tridiagonal Matrices 89
4.10.1 Systems with Tridiagonal Matrices 89
4.10.2 Systems with Tridiagonal Symmetric Strongly
Nonsingular Matrices 92
4.11 Linear Systems with Cyclically Tridiagonal Matrices 94
4.11.1 Systems with a Cyclically Tridiagonal Matrix 94
4.11.2 Systems with Symmetric Cyclically Tridiagonal
Strongly Nonsingular Matrices 96
4.12 Linear Systems with Five Diagonal Matrices 98
4.12.1 Systems with Five Diagonal Matrices 98
4.12.2 Systems with Five Diagonal Symmetric Matrices 100
4.13 Linear Systems with Band Matrices 102
4.14 Solving Linear Systems via Householder Transformations 107
4.15 Errors, Conditioning and Iterative Refinement 112
4.15.1 Errors and the Condition Number 112
4.15.2 Condition Estimates 114
4.15.3 Improving the Condition Number 116
4.15.4 Iterative Refinement 117
4.16 Systems of Equations with Block Matrices 119
4.16.1 Preliminary Remarks 119
4.16.2 Gaufi Algorithm for Block Matrices 120
4.16.3 Gaufi Algorithm for Block Tridiagonal Systems 121
4.16.4 Other Block Methods 121
4.17 The Algorithm of Cuthill McKee for Sparse Symmetric
Matrices 122
4.18 Recommendations for Selecting a Method 127
XVI Contents
5 Iterative Methods for Linear Systems 131
5.1 Preliminary Remarks 131
5.2 Vector and Matrix Norms 132
5.3 The Jacobi Method 133
5.4 The GauB Seidel Iteration 137
5.5 A Relaxation Method using the Jacobi Method 139
5.6 A Relaxation Method using the Gaufi Seidel Method 140
5.6.1 Iteration Rule 140
5.6.2 Estimate for the Optimal Relaxation Coefficient,
an Adaptive SOR Method 141
6 Systems of Nonlinear Equations 143
6.1 General Iterative Methods 143
6.2 Special Iterative Methods 148
6.2.1 Newton Methods for Nonlinear Systems 148
6.2.1.1 The Basic Newton Method 148
6.2.1.2 Damped Newton Method for Systems 149
6.2.2 Regula Falsi for Nonlinear Systems 151
6.2.3 Method of Steepest Descent for Nonlinear Systems 152
6.2.4 Brown s Method for Nonlinear Systems 154
6.3 Choosing a Method 154
7 Eigenvalues and Eigenvectors of Matrices 155
7.1 Basic Concepts 155
7.2 Diagonalizable Matrices and the Conditioning of the
Eigenvalue Problem 157
7.3 Vector Iteration 159
7.3.1 The Dominant Eigenvalue and the Associated
Eigenvector of a Matrix 159
7.3.2 Determination of the Eigenvalue Closest to Zero 164
7.3.3 Eigenvalues in Between 164
7.4 The Rayleigh Quotient for Hermitian Matrices 166
7.5 The Krylov Method 167
7.5.1 Determining the Eigenvalues 167
7.5.2 Determining the Eigenvectors 169
7.6 Eigenvalues of Positive Definite Tridiagonal Matrices,
the QD Algorithm 170
7.7 Transformation to Hessenberg Form, the LR and
QR Algorithms 171
Contents XVII
7.7.1 Transformation of a Matrix to Upper Hessenberg Form 172
7.7.2 The LR Algorithm 174
7.7.3 The Basic QR Algorithm 175
7.8 Eigenvalues and Eigenvectors of a Matrix via the QR Algorithm 176
7.9 Decision Strategy 178
8 Linear and Nonlinear Approximation 179
8.1 Linear Approximation 180
8.1.1 Statement of the Problem and Best Approximation 180
8.1.2 Linear Continuous Root Mean Square Approximation 184
8.1.3 Discrete Linear Root Mean Square Approximation 188
8.1.3.1 Normal Equations for Discrete Linear Least Squares 188
8.1.3.2 Discrete Least Squares via Algebraic Polynomials
and Orthogonal Polynomials 191
8.1.3.3 Linear Regression, the Least Squares Solution Using
Linear Algebraic Polynomials 193
8.1.3.4 Solving Linear Least Squares Problems using
Householder Transformations 194
8.1.4 Approximation of Polynomials by Chebyshev Polynomials .196
8.1.4.1 Best Uniform Approximation 197
8.1.4.2 Approximation by Chebyshev Polynomials 198
8.1.5 Approximation of Periodic Functions and the FFT 204
8.1.5.1 Root Mean Square Approximation of Periodic Functions 204
8.1.5.2 Trigonometric Interpolation 205
8.1.5.3 Complex Discrete Fourier Transformation (FFT) 207
8.1.6 Error Estimates for Linear Approximation 209
8.1.6.1 Estimates for the Error in Best Approximation 209
8.1.6.2 Error Estimates for Simultaneous Approximation
of a Function and its Derivatives 211
8.1.6.3 Approximation Error Estimates using Linear Projection
Operators 213
8.2 Nonlinear Approximation 215
8.2.1 Transformation Method for Nonlinear Least Squares 215
8.2.2 Nonlinear Root Mean Square Fitting 217
8.3 Decision Strategy 218
XVIII Contents
9 Polynomial and Rational Interpolation 219
9.1 The Problem 219
9.2 Lagrange Interpolation Formula 221
9.2.1 Lagrange Formula for Arbitrary Nodes 221
9.2.2 Lagrange Formula for Equidistant Nodes 222
9.3 The Aitken Interpolation Scheme for Arbitrary Nodes 223
9.4 Inverse Interpolation According to Aitken 225
9.5 Newton Interpolation Formula 226
9.5.1 Newton Formula for Arbitrary Nodes 226
9.5.2 Newton Formula for Equidistant Nodes 227
9.6 Remainder of an Interpolation and Estimates of the
Interpolation Error 229
9.7 Rational Interpolation 235
9.8 Interpolation for Functions in Several Variables 239
9.8.1 Lagrange Interpolation Formula for Two Variables 239
9.8.2 Shepard Interpolation 241
9.9 Hints for Selecting an Appropriate Interpolation Method 247
10 Interpolating Polynomial Splines for Constructing
Smooth Curves 251
10.1 Cubic Polynomial Splines 251
10.1.1 Definition of Interpolating Cubic Spline Functions 252
10.1.2 Computation of Non Parametric Cubic Splines 254
10.1.3 Computing Parametric Cubic Splines 259
10.1.4 Joined Interpolating Polynomial Splines 266
10.1.5 Convergence and Error Estimates for Interpolating
Cubic Splines 272
10.2 Hermite Splines of Fifth Degree 275
10.2.1 Definition of Hermite Splines 275
10.2.2 Computation of Non Parametric Hermite Splines 276
10.2.3 Computation of Parametric Hermite Splines 280
10.3 Hints for Selecting Appropriate Interpolating or
Approximating Splines 282
11 Cubic Fitting Splines for Constructing Smooth Curves ... 287
11.1 The Problem 287
11.2 Definition of Fitting Spline Functions 288
11.3 Non Parametric Cubic Fitting Splines 289
Contents XIX
11.4 Parametric Cubic Fitting Splines 296
11.5 Decision Strategy 297
12 Two Dimensional Splines, Surface Splines,
Bezier Splines, B Splines 299
12.1 Interpolating Two Dimensional Cubic Splines for
Constructing Smooth Surfaces 299
12.2 Two Dimensional Interpolating Surface Splines 309
12.3 Bezier Splines 313
12.3.1 Bezier Spline Curves 313
12.3.2 Bezier Spline Surfaces 316
12.3.3 Modified Interpolating Cubic Bezier Splines 324
12.4 B Splines 325
12.4.1 B Spline Curves 325
12.4.2 B Spline Surfaces 331
12.5 Hints 335
13 Akima and Renner Subsplines 341
13.1 Akima Subsplines 341
13.2 Renner Subsplines 344
13.3 Rounding of Corners with Akima and Renner Splines 347
13.4 Approximate Computation of Arc Length 349
13.5 Selection Hints 350
14 Numerical Differentiation 353
14.1 The Task 353
14.2 Differentiation Using Interpolating Polynomials 354
14.3 Differentiation via Interpolating Cubic Splines 358
14.4 Differentiation by the Romberg Method 358
14.5 Decision Hints 360
15 Numerical Integration 361
15.1 Preliminary Remarks 361
15.2 Interpolating Quadrature Formulas 364
15.3 Newton Cotes Formulas 366
15.3.1 The Trapezoidal Rule 367
15.3.2 Simpson s Rule 370
XX Contents
15.3.3 The 3/8 Formula 371
15.3.4 Other Newton Cotes Formulas 373
15.3.5 The Error Order of Newton Cotes Formulas 375
15.4 Maclaurin Quadrature Formulas 376
15.4.1 The Tangent Trapezoidal Formula 376
15.4.2 Other Maclaurin Formulas 378
15.5 Euler Maclaurin Formulas 380
15.6 Chebyshev Quadrature Formulas 382
15.7 Gaufi Quadrature Formulas 385
15.8 Calculation of Weights and Nodes of Generalized Gaussian
Quadrature Formulas 389
15.9 Clenshaw Curtis Quadrature Formulas 392
15.10 Romberg Integration 394
15.11 Error Estimates and Computational Errors 397
15.12 Adaptive Quadrature Methods 400
15.13 Convergence of Quadrature Formulas 400
15.14 Hints for Choosing an Appropriate Method 401
16 Numerical Cubature 403
16.1 The Problem 403
16.2 Interpolating Cubature Formulas 406
16.3 Newton Cotes Cubature Formulas for Rectangular Regions 408
16.4 Newton Cotes Cubature Formulas for Triangles 413
16.5 Romberg Cubature for Rectangular Regions 414
16.6 Gaufi Cubature Formulas for Rectangles 417
16.7 Gaufi Cubature Formulas for Triangles 419
16.7.1 Right Triangles with Legs Parallel to the Axis 419
16.7.2 General Triangles 420
16.8 Riemann Double Integrals using Bicubic Splines 421
16.9 Decision Strategy 422
17 Initial Value Problems for Ordinary Differential
Equations 423
17.1 The Problem 423
17.2 Principles of the Numerical Methods 424
17.3 One Step Methods 426
17.3.1 The Euler Cauchy Polygonal Method 426
17.3.2 The Improved Euler Cauchy Method 427
Contents XXI
17.3.3 The Predictor Corrector Method of Heun 428
17.3.4 Explicit Runge Kutta Methods 430
17.3.4.1 Construction of Runge Kutta Methods 430
17.3.4.2 The Classical Runge Kutta Method 430
17.3.4.3 A List of Explicit Runge Kutta Formulas 432
17.3.4.4 Embedding Formulas 436
17.3.5 Implicit Runge Kutta Methods of Gaussian Type 449
17.3.6 Consistence and Convergence of One Step Methods 451
17.3.7 Error Estimation and Step Size Control 452
17.3.7.1 Error Estimation 452
17.3.7.2 Automatic Step Size Control, Adaptive Methods
for Initial Value Problems 454
17.4 Multi Step Methods 457
17.4.1 The Principle of Multi Step Methods 457
17.4.2 The Adams Bashforth Method 458
17.4.3 The Predictor Corrector Method of Adams Moulton 460
17.4.4 The Adams Stormer Method 465
17.4.5 Error Estimates for Multi Step Methods 466
17.4.6 Computational Error of One Step and Multi Step Methods 467
17.5 Bulirsch Stoer Gragg Extrapolation 468
17.6 Stability 471
17.6.1 Preliminary Remarks 471
17.6.2 Stability of Differential Equations 472
17.6.3 Stability of the Numerical Method 473
17.7 Stiff Systems of Differential Equations 477
17.7.1 The Problem 477
17.7.2 Criteria for the Stiffness of a System 478
17.7.3 Gear s Method for Integrating Stiff Systems 479
17.8 Suggestions for Choosing among the Methods 484
18 Boundary Value Problems for Ordinary Differential
Equations 489
18.1 Statement of the Problem 489
18.2 Reduction of Boundary Value Problems to Initial
Value Problems 490
18.2.1 Boundary Value Problems for Nonlinear Differential
Equations of Second Order 490
18.2.2 Boundary Value Problems for Systems of Differential
Equations of First Order 492
XXII Contents
18.2.3 The Multiple Shooting Method 494
18.3 Difference Methods 497
18.3.1 The Ordinary Difference Method 497
18.3.2 Higher Order Difference Methods 504
18.3.3 Iterative Solution of Linear Systems for Special
Boundary Value Problems 506
18.3.4 Linear Eigenvalue Problems 507
A Appendix: ANSI C Functions 509
A.I Preface of the Appendix 511
A.2 Information on Campus and Site Licenses, as well as
on Other Software Packages 513
A.3 Contents of the Enclosed CD 516
Contents of the Appendix 517
A.4 ANSI C Functions 521
B Bibliography 569
Literature for Other Topics 587
Numerical Treatment of Partial Differential Equations 587
Finite Element Method 588
C Index 591
|
| any_adam_object | 1 |
| author | Engeln-Müllges, Gisela 1940- Uhlig, Frank 1945- |
| author_GND | (DE-588)110051203 (DE-588)132562022 |
| author_facet | Engeln-Müllges, Gisela 1940- Uhlig, Frank 1945- |
| author_role | aut aut |
| author_sort | Engeln-Müllges, Gisela 1940- |
| author_variant | g e m gem f u fu |
| building | Verbundindex |
| bvnumber | BV010906905 |
| callnumber-first | Q - Science |
| callnumber-label | QA297 |
| callnumber-raw | QA297 |
| callnumber-search | QA297 |
| callnumber-sort | QA 3297 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 900 ST 130 ST 250 ST 600 |
| classification_tum | DAT 532f DAT 358f MAT 650f |
| ctrlnum | (OCoLC)845182071 (DE-599)BVBBV010906905 |
| dewey-full | 518.02855262 519.4/0285/5133 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis 519 - Probabilities and applied mathematics |
| dewey-raw | 518.02855262 519.4/0285/5133 |
| dewey-search | 518.02855262 519.4/0285/5133 |
| dewey-sort | 3518.02855262 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04966nam a2201153 c 4500</leader><controlfield tag="001">BV010906905</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120830 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960821s1996 d||| |||| 00||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540605304</subfield><subfield code="9">3-540-60530-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)845182071</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010906905</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-945</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA297</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.02855262</subfield><subfield code="b">E5N8</subfield><subfield code="2">22</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4/0285/5133</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 900</subfield><subfield code="0">(DE-625)143268:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 600</subfield><subfield code="0">(DE-625)143681:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 532f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 358f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 650f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Engeln-Müllges, Gisela</subfield><subfield code="d">1940-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110051203</subfield><subfield code="4">aut</subfield></datafield><datafield tag="240" ind1="1" ind2="0"><subfield code="a">Numerik-Algorithmen mit FORTRAN-77-Programmen</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Numerical algorithms with C</subfield><subfield code="c">Gisela Engeln-Müllges ; Frank Uhlig</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXII, 596 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="e">1 CD-ROM (12 cm)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos e estruturas de dados</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmos</subfield><subfield code="2">lemb</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Análise numérica</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Análisis numérico</subfield><subfield code="2">lemb</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">C (Lenguajes de programación de computadoras)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">C++</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Linguagem de programação (outras)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Numerieke wiskunde</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programação(análise numérica)</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">C (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numerical analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numerical analysis</subfield><subfield code="z">Computer programs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">FORTRAN</subfield><subfield code="0">(DE-588)4017984-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">C</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4113195-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">ANSI C</subfield><subfield code="0">(DE-588)4233557-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">FORTRAN 90</subfield><subfield code="0">(DE-588)4267480-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">FORTRAN 77</subfield><subfield code="0">(DE-588)4113601-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programm</subfield><subfield code="0">(DE-588)4047394-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">TURBO-PASCAL</subfield><subfield code="0">(DE-588)4117264-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)4155008-0</subfield><subfield code="a">Formelsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">C</subfield><subfield code="g">Programmiersprache</subfield><subfield code="0">(DE-588)4113195-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">FORTRAN 77</subfield><subfield code="0">(DE-588)4113601-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">TURBO-PASCAL</subfield><subfield code="0">(DE-588)4117264-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="2"><subfield code="a">ANSI C</subfield><subfield code="0">(DE-588)4233557-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2="2"><subfield code="a">FORTRAN 90</subfield><subfield code="0">(DE-588)4267480-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Numerische Mathematik</subfield><subfield code="0">(DE-588)4042805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="1"><subfield code="a">FORTRAN 77</subfield><subfield code="0">(DE-588)4113601-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2="2"><subfield code="a">Programm</subfield><subfield code="0">(DE-588)4047394-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">FORTRAN</subfield><subfield code="0">(DE-588)4017984-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">7\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="7" ind2="0"><subfield code="a">FORTRAN</subfield><subfield code="0">(DE-588)4017984-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="7" ind2="1"><subfield code="a">Numerisches Verfahren</subfield><subfield code="0">(DE-588)4128130-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="7" ind2=" "><subfield code="8">8\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Uhlig, Frank</subfield><subfield code="d">1945-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)132562022</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007295273&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007295273</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">7\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">8\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| genre | 1\p (DE-588)4155008-0 Formelsammlung gnd-content |
| genre_facet | Formelsammlung |
| id | DE-604.BV010906905 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:00:55Z |
| institution | BVB |
| isbn | 3540605304 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007295273 |
| oclc_num | 845182071 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-703 DE-20 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-945 DE-29T DE-Aug4 DE-706 DE-634 DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-703 DE-20 DE-355 DE-BY-UBR DE-19 DE-BY-UBM DE-945 DE-29T DE-Aug4 DE-706 DE-634 DE-83 |
| physical | XXII, 596 S. graph. Darst. 1 CD-ROM (12 cm) |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer |
| record_format | marc |
| spelling | Engeln-Müllges, Gisela 1940- Verfasser (DE-588)110051203 aut Numerik-Algorithmen mit FORTRAN-77-Programmen Numerical algorithms with C Gisela Engeln-Müllges ; Frank Uhlig Berlin [u.a.] Springer 1996 XXII, 596 S. graph. Darst. 1 CD-ROM (12 cm) txt rdacontent n rdamedia nc rdacarrier Algoritmen gtt Algoritmos e estruturas de dados larpcal Algoritmos lemb Análise numérica larpcal Análisis numérico lemb C (Lenguajes de programación de computadoras) C++ gtt Linguagem de programação (outras) larpcal Numerieke wiskunde gtt Programação(análise numérica) larpcal C (Computer program language) Numerical analysis Numerical analysis Computer programs FORTRAN (DE-588)4017984-9 gnd rswk-swf C Programmiersprache (DE-588)4113195-2 gnd rswk-swf ANSI C (DE-588)4233557-7 gnd rswk-swf FORTRAN 90 (DE-588)4267480-3 gnd rswk-swf FORTRAN 77 (DE-588)4113601-9 gnd rswk-swf Numerisches Verfahren (DE-588)4128130-5 gnd rswk-swf Numerische Mathematik (DE-588)4042805-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Programm (DE-588)4047394-6 gnd rswk-swf TURBO-PASCAL (DE-588)4117264-4 gnd rswk-swf 1\p (DE-588)4155008-0 Formelsammlung gnd-content Numerische Mathematik (DE-588)4042805-9 s Algorithmus (DE-588)4001183-5 s C Programmiersprache (DE-588)4113195-2 s DE-604 FORTRAN 77 (DE-588)4113601-9 s 2\p DE-604 TURBO-PASCAL (DE-588)4117264-4 s 3\p DE-604 ANSI C (DE-588)4233557-7 s 4\p DE-604 FORTRAN 90 (DE-588)4267480-3 s 5\p DE-604 Programm (DE-588)4047394-6 s 6\p DE-604 FORTRAN (DE-588)4017984-9 s 7\p DE-604 Numerisches Verfahren (DE-588)4128130-5 s 8\p DE-604 Uhlig, Frank 1945- Verfasser (DE-588)132562022 aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007295273&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 7\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 8\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Engeln-Müllges, Gisela 1940- Uhlig, Frank 1945- Numerical algorithms with C Algoritmen gtt Algoritmos e estruturas de dados larpcal Algoritmos lemb Análise numérica larpcal Análisis numérico lemb C (Lenguajes de programación de computadoras) C++ gtt Linguagem de programação (outras) larpcal Numerieke wiskunde gtt Programação(análise numérica) larpcal C (Computer program language) Numerical analysis Numerical analysis Computer programs FORTRAN (DE-588)4017984-9 gnd C Programmiersprache (DE-588)4113195-2 gnd ANSI C (DE-588)4233557-7 gnd FORTRAN 90 (DE-588)4267480-3 gnd FORTRAN 77 (DE-588)4113601-9 gnd Numerisches Verfahren (DE-588)4128130-5 gnd Numerische Mathematik (DE-588)4042805-9 gnd Algorithmus (DE-588)4001183-5 gnd Programm (DE-588)4047394-6 gnd TURBO-PASCAL (DE-588)4117264-4 gnd |
| subject_GND | (DE-588)4017984-9 (DE-588)4113195-2 (DE-588)4233557-7 (DE-588)4267480-3 (DE-588)4113601-9 (DE-588)4128130-5 (DE-588)4042805-9 (DE-588)4001183-5 (DE-588)4047394-6 (DE-588)4117264-4 (DE-588)4155008-0 |
| title | Numerical algorithms with C |
| title_alt | Numerik-Algorithmen mit FORTRAN-77-Programmen |
| title_auth | Numerical algorithms with C |
| title_exact_search | Numerical algorithms with C |
| title_full | Numerical algorithms with C Gisela Engeln-Müllges ; Frank Uhlig |
| title_fullStr | Numerical algorithms with C Gisela Engeln-Müllges ; Frank Uhlig |
| title_full_unstemmed | Numerical algorithms with C Gisela Engeln-Müllges ; Frank Uhlig |
| title_short | Numerical algorithms with C |
| title_sort | numerical algorithms with c |
| topic | Algoritmen gtt Algoritmos e estruturas de dados larpcal Algoritmos lemb Análise numérica larpcal Análisis numérico lemb C (Lenguajes de programación de computadoras) C++ gtt Linguagem de programação (outras) larpcal Numerieke wiskunde gtt Programação(análise numérica) larpcal C (Computer program language) Numerical analysis Numerical analysis Computer programs FORTRAN (DE-588)4017984-9 gnd C Programmiersprache (DE-588)4113195-2 gnd ANSI C (DE-588)4233557-7 gnd FORTRAN 90 (DE-588)4267480-3 gnd FORTRAN 77 (DE-588)4113601-9 gnd Numerisches Verfahren (DE-588)4128130-5 gnd Numerische Mathematik (DE-588)4042805-9 gnd Algorithmus (DE-588)4001183-5 gnd Programm (DE-588)4047394-6 gnd TURBO-PASCAL (DE-588)4117264-4 gnd |
| topic_facet | Algoritmen Algoritmos e estruturas de dados Algoritmos Análise numérica Análisis numérico C (Lenguajes de programación de computadoras) C++ Linguagem de programação (outras) Numerieke wiskunde Programação(análise numérica) C (Computer program language) Numerical analysis Numerical analysis Computer programs FORTRAN C Programmiersprache ANSI C FORTRAN 90 FORTRAN 77 Numerisches Verfahren Numerische Mathematik Algorithmus Programm TURBO-PASCAL Formelsammlung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007295273&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT engelnmullgesgisela numerikalgorithmenmitfortran77programmen AT uhligfrank numerikalgorithmenmitfortran77programmen AT engelnmullgesgisela numericalalgorithmswithc AT uhligfrank numericalalgorithmswithc |