๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithmic Computation of Flattenings and of Modular Deformations

โœ Scribed by Bernd Martin

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
320 KB
Volume
34
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper presents an algorithm for the computation of any jet of the flattening stratum of a module over a local algebra based on an obstruction theory for lifting flatness. It is applied to modular deformations of singular germs. Infinitesimal modular deformations of isolated complete intersection singularities are characterized as flattening strata of its first tangent cohomology. Some examples are discussed that indicate relations with moduli spaces of certain classes of singularities. Implementations are done in Singular.

๐Ÿ“œ SIMILAR VOLUMES

The computation of deformations
The computation of deformations
โœ Derek Flinn ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 552 KB

## Abstract The mathematics of irrotational deformation are simplified by presentation in matrix form. Matrix equations are easily programmed and are easily interpreted in geometrical terms. Graphical operations commonly carried out on orientation nets such as rotation of data can be translated int

The computation of deformations
The computation of deformations
โœ Derek Flinn ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 552 KB

## Abstract The mathematics of irrotational deformation are simplified by presentation in matrix form. Matrix equations are easily programmed and are easily interpreted in geometrical terms. Graphical operations commonly carried out on orientation nets such as rotation of data can be translated int

Computational aspects of incrementally o
Computational aspects of incrementally objective algorithms for large deformation plasticity
โœ Jacob Fish; Kamlun Shek ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 135 KB ๐Ÿ‘ 1 views

A methodology for computationally efficient formulation of the tangent stiffness matrix consistent with incrementally objective algorithms for integrating finite deformation kinematics and with closest point projection algorithms for integrating material response is developed in the context of finit

Computation of large shear deformations
Computation of large shear deformations of a thermoplastic material
โœ Donald A. French ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 440 KB ๐Ÿ‘ 1 views

A specialized finite difference method with grid refinement and variable time steps is created to approximate the deformation velocity and the temperature in a simple model of the shearing of a thermoplastic material. A specific problem where the solution exhibits "blowup" in the adiabatic case is c

Algorithmic Computation of de Rham Cohom
Algorithmic Computation of de Rham Cohomology of Complements of Complex Affine Varieties
โœ Uli Walther ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 493 KB

Let X = C n . In this paper we present an algorithm that computes the de Rham cohomology groups H i dR (U, C) where U is the complement of an arbitrary Zariski-closed set Y in X. Our algorithm is a merger of the algorithm given in Oaku and Takayama (1999), who considered the case where Y is a hyper