|
Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Differential equations
|
Not currently available
Evaluating Derivatives - Principles and Techniques of Algorithmic Differentiation (Paperback, 2nd Revised edition)
Loot Price: R2,042
Discovery Miles 20 420
|
|
|
Evaluating Derivatives - Principles and Techniques of Algorithmic Differentiation (Paperback, 2nd Revised edition)
Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.
|
Algorithmic, or automatic, differentiation (AD) is a growing area
of theoretical research and software development concerned with the
accurate and efficient evaluation of derivatives for function
evaluations given as computer programs. The resulting derivative
values are useful for all scientific computations that are based on
linear, quadratic, or higher order approximations to nonlinear
scalar or vector functions. AD has been applied in particular to
optimization, parameter identification, nonlinear equation solving,
the numerical integration of differential equations, and
combinations of these. Apart from quantifying sensitivities
numerically, AD also yields structural dependence information, such
as the sparsity pattern and generic rank of Jacobian matrices. The
field opens up an exciting opportunity to develop new algorithms
that reflect the true cost of accurate derivatives and to use them
for improvements in speed and reliability. This second edition has
been updated and expanded to cover recent developments in
applications and theory, including an elegant NP completeness
argument by Uwe Naumann and a brief introduction to scarcity, a
generalization of sparsity. There is also added material on
checkpointing and iterative differentiation. To improve readability
the more detailed analysis of memory and complexity bounds has been
relegated to separate, optional chapters.The book consists of three
parts: a stand-alone introduction to the fundamentals of AD and its
software; a thorough treatment of methods for sparse problems; and
final chapters on program-reversal schedules, higher derivatives,
nonsmooth problems and iterative processes. Each of the 15 chapters
concludes with examples and exercises.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.