Modern Methods for Solving Engineering Problems: Numerical Methods, Optimization Techniques and Simulation |
What people are saying - Write a review
We haven't found any reviews in the usual places.
Contents
INTERPOLATION AND APPROXIMATION | 1-1 |
Example Page | 1-25 |
NUMERICAL INTEGRATION | 2-1 |
50 other sections not shown
Other editions - View all
Common terms and phrases
algorithm approximation arguments arithmetic array assumed base points basic feasible solution boundary calculations called Chebyshev polynomials coefficients column constant convergence convex convex set corresponding denoted derivatives diagonal digital computer DISCR divided difference elements error term Euler's method evaluated example expression extreme point f(xQ Figure finite difference FORMAT formulas FORTRAN functional values GAS TEMPERATURE Gaussian elimination given gradient Hence initial conditions input interpolating interpolating polynomial interval of uncertainty iteration linear programming logical matrix memory method Newton's Method Numerical Integration object program objective function operations optimal Ordinary Differential Equations orthogonal output Partial Differential Equations Pn(x PRINT procedure quadratic reactor roots round-off error Runge-Kutta second row sequence shown solved space stage stored subroutine subscript Table Taylor's series tion truncation error unimodal variables vectors XARG y(xQ yi+l yields zero
Bibliographic information
| Title | Modern Methods for Solving Engineering Problems: Numerical Methods, Optimization Techniques and Simulation |
| Author | University of Michigan. Engineering Summer Conferences |
| Published | 1968 |
| Original from | the University of Michigan |
| Digitized | Jan 25, 2011 |
| Export Citation | BiBTeX EndNote RefMan |