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

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

blank
blank
blank
Красота
blank
Gershenfeld N. — The Nature of Mathematical Modelling-Neil Gershenfeld
Gershenfeld N. — The Nature of Mathematical Modelling-Neil Gershenfeld

Читать книгу
бесплатно

Скачать книгу с нашего сайта нельзя

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



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


Название: The Nature of Mathematical Modelling-Neil Gershenfeld

Автор: Gershenfeld N.

Аннотация:

This book first covers exact and approximate analytical techniques (ordinary differential and difference equations, partial differential equations, variational principles, stochastic processes); numerical methods (finite differences for ODE's and PDE's, finite elements, cellular automata); model inference based on observations (function fitting, data transforms, network architectures, search techniques, density estimation); as well as the special role of time in modeling (filtering and state estimation, hidden Markov processes, linear and nonlinear time series). Each of the topics in the book would be the worthy subject of a dedicated text, but only by presenting the material in this way is it possible to make so much material accessible to so many people. Each chapter presents a concise summary of the core results in an area, providing an orientation to what they can (and cannot) do, enough background to use them to solve typical problems, and pointers to access the literature for particular applications.


Язык: en

Рубрика: Математика/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
action      38
Activation function      150
Adams — Bashforth — Moulton method      74
ADI      84
Adjoint      128
AFSR      196
AIC      207
Akaike information criteria      207
Algorithmic information theory      115
Aliasing      130 266
Alternating-direction implicit method      84
Analog feedback shift register      196
Analytical      7
ANN      138
annealing      162
Ansatz      10
ANSI      250
Applet      245
ar      205
Argmax      202
Arima      205
ARMA      205
ARPANET      250
Artificial Neural Networks      138
Associative      129
Asymptotic expansion      18
Asynchronous connection      237
Auto-regressive model      205
Autocorrelation function      51 206
Autocovariance function      51
Autonomous system      212
Back propagation      153
Backwards algorithm      201
Backwards difference      78
BASIC      227
Baum — Welch algorithm      201
Bayesian      47 116
Bayesian networks      178
Bayes’ rule      46 116
BBGKY hierarchy      105
Bernstein polynomials      142
Bessel’s equation      30
Bezier curve      142
Bias/variance tradeoff      113
BIC      207
Bimodal distribution      45
Bispectrum      212
Blending functions      141
Blessing of dimensionality      167
Block entropy      217
Boltzmann equation      105
Boltzmann factor      163
Bootstrap methods      148
boundary conditions      10
Boundary-value problem      10 76
Box — Jenkins method      207
Branch-and-bound algorithm      156
Brownian motion      53
Bubnov — Galerkin method      95
Bulirsch — Stoer method      75
C      226
CA      102
Calculator      65
Catenary      270
Cauchy — Schwarz inequality      126
Cellular automata      102
Central limit theorem      49 117
Chapman — Enskog expansion      106
Chapman — Kolmogorov equation      52
Characteristic equation      10
Characteristic function      48 212
Characteristics      26
Chebyshev polynomials      145
Circulant matrix      133
Classes      245
Client      235
Closed-form solution      7
Cluster-weighted modeling      178
Clustering      175
Coarse-grained parallelism      256
Collocation      94
colormap      237
Commutative      129
Compact support      136 172
Complete basis      94 144
Complete solution      10
Conjugate gradient algorithm      160
Connectionist      150
connectionless protocol      251
Content-addressable memory      185
Control points      141
Control theory      204
Corrector step      74
Correlation dimension      215
Cost function      154
Courant — Friedrichs — Levy condition      80
Covariance matrix      136
Cramer — Rao bound      125
Crank — Nicholson method      84
Cross-validation      147
Cumulant      50
Cumulative distribution      48 172
Curse of dimensionality      149
DAE      67
Datagram      250
Daubechies wavelets      132
de Bruijn’s identity      126
Delta function      51
Density estimation      169
Detailed balance      55
Device-independent      230
DFT      129
Diagonal approximation      155 309
Diagonalization      13
Diffeomorphic      210
Differential-algebraic equation      67
Diffusion noise      214
Dilation equation      135
Dirichlet boundary conditions      84
Discrete Fourier Transform      129
Discrete wavelet transformation      135
dispersion      25
Distributive      129
Divide-and-conquer      130
Double buffering      247
Downhill simplex method      157
DSC      231
DWT      135
Early stopping      153
EISPACK      228
Elliptic PDE      27
em      177 201
Embedding      208 210
Encapsulated PostScript      231
Entrainment      196
entropy      217
EPS      231
Equipartition theorem      55
Ergodic      52 212
Error model      116
Euclidean norm      129
Euler angles      42
Euler equations for rigid bodies      42
Euler’s equation      35
Euler’s method      68
evidence      116
Excel      229
expectation value      45
Expectation-Maximization      177 201
Extended Kalman filter      195
Extrapolation      139
Factor analysis      137
Fast Fourier Transform      66 130
Feed-forward network      153
Fermat’s principle      38
FFT      130
Filter bank      132
Fine-grained parallelism      256
Finite differences      78
Finite elements      76 93
Finite impulse response      205
FIR      205
Fisher information      125
Fixed boundary condition      82
Fokker — Plank equation      54
FORTRAN      226
FORWARD ALGORITHM      200
Forward difference      78
Fourier transform      50
Fourier transform PDE method      88
Fourier—Galerkin method      95
Fourth-order Runge — Kutta method      70
Fractal      215
Frequentist      47
Full rank      119
Function approximation      115
GA      164
Galerkin method      94
Game of life      102
Gated experts      178
Gauss elimination      83
Gauss — Seidel method      89
Gaussian distribution      49
General solution      10
Generalized coordinates      38
Generalized dimension      215
Generating partition      219
GENERIC      210
Genetic algorithms      164
Geometric sum      305
GLUT      240
Gradient descent      123
Gram — Schmidt orthogonalization      144
Haar wavelets      132
Halting problem      115 231
Haptic interfaces      225
Hard clustering      184
Harmonic wavelets      136
Hat functions      95
Hausdorff dimension      215
Helmholtz’s equation      28
Hermite interpolation      98
Hermite polynomials      145
hessian      123
Heun method      76 276
Hidden Markov model      186 197
Hidden units      150
HMM      197
Homogeneous differential equation      9
Homogeneous fractal      216
HTML      246
Hyper-parameters      147
Hyperbolic functions      37
Hyperbolic PDE      27
ICA      137
IID      48 117
IIR      205
IMSL      227
In-sample error      147
Independent components analysis      137
Independent variables      47
Index of refraction      38
Inertia tensor      41
Infinite impulse response      205
information      217
Information dimension      215
Inhomogeneous differential equation      9
Initial-value problem      10
Innovations      205
Integral of the motion      39
Internet      250
Internetworking      250
Interpolation      139
Inverse problems      154
IP      250
ISO      250
Jacobian      48
Jacobi’s method      89
Java      227 244
k-d tree      170
K-means      184
Kalman filter      186
Kalman gain matrix      192
Karhunen — Loeve transform      137
Kernel density estimation      175
KLT      137
Knots      141
l/f noise      214
Lagrange interpolation      97
Lagrange multiplier      37
Lagrangian      38
Laguerre polynomials      145
Langevin equation      55
Laplace transform      13
Laplace’s equation      27 84
Lattice gas      102
Law of Large Numbers      49
Lax method      80
Leapfrog method      81
Least squares error model      117 118
Least squares weighting      94
Legendre’s equation      32
Levenberg — Marquardt method      124
Levinson — Durbin recursion      207
Lexicographic sort      169
LFSR      59
Likelihood      116
Line minimization      159
Linear congruential random numbers      57
Linear feedback shift register      59
Linear least squares      118
LINPACK      228
Lisp      227
Log-likelihood      117
Lorenz set      95 208
Lossy compression      137
Lyapunov exponents      216
MA      205
Macsyma      228
MAP      117
Maple      228
Marginalize      46
Markov chain      51
Markov process      51
Master equation      55
Matched filter      186 187
Mathcad      230
Mathematica      228
MATLAB      228
Maximal LFSR      59
Maximum a posteriori      117
Maximum entropy      127 302
Maximum likelihood      46 117
MDL      115
Mean value      45
Mesh generation      98
Meta-modeling      2
METHODS      245
Mflop      257
Midpoint method      70
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2017
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте