10 pages matching computational results in this book
Results 1-3 of 10
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
1210 West Dayton algorithm algorithm 3.1 ALGORITHMS FOR SOLVING angular momentum approximate assumption bound boundary value problem Buffer coefficients computational results Computer Sciences Computer Sciences Department Computer Sciences Technical conservation convergence rate convex coordinate Dayton Street Madison defined delay differential equations denote derived discrete mechanics energy equation induced equations 3.1 EQUATIONS AND INEQUALITIES equations of motion example feasible finite follows formulae function functional iteration GDA stable given graph Hence Hessian impulsive limit initial condition integration iteration Kuhn-Tucker point Lemma linear independence linear momentum matrix nonlinear programming numerical method obtained particles polynomial potential Proof properties quadratic quasirandom R-superlinear rate of convergence regular languages respect satisfies Sciences Technical Report Section Security Class SOLVING SYSTEMS stable methods step stepsize Street Madison subproblems SUPERLINEARLY system complex Theorem 3.1 trapezoidal method truncated unit circle University of Wisconsin vector West Dayton Street Zaremba sequence zero