Computational Inelasticity (Hardcover, 1st ed. 1998. Corr. 2nd printing 2000)

A description of the theoretical foundations of inelasticity, its numerical formulation and implementation, constituting a representative sample of state-of-the-art methodology currently used in inelastic calculations. Among the numerous topics covered are small deformation plasticity and viscoplasticity, convex optimisation theory, integration algorithms for the constitutive equation of plasticity and viscoplasticity, the variational setting of boundary value problems and discretization by finite element methods. Also addressed are the generalisation of the theory to non-smooth yield surface, mathematical numerical analysis issues of general return mapping algorithms, the generalisation to finite-strain inelasticity theory, objective integration algorithms for rate constitutive equations, the theory of hyperelastic-based plasticity models and small and large deformation viscoelasticity. Of great interest to researchers and graduate students in various branches of engineering, especially civil, aeronautical and mechanical, and applied mathematics.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Interdisciplinary Applied Mathematics, 7
Release date:	July 2000
First published:	1998
Authors:	J.C. Simo • T.J.R. Hughes
Dimensions:	234 x 156 x 25mm (L x W x T)
Format:	Hardcover
Pages:	392
Edition:	1st ed. 1998. Corr. 2nd printing 2000
ISBN-13:	978-0-387-97520-7
Categories:	Books > Science & Mathematics > Mathematics > General Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Science & Mathematics > Physics > Classical mechanics > General Promotions
LSN:	0-387-97520-9
Barcode:	9780387975207

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!