Kniha Scalable Algorithms for Contact Problems Zdenek Dostál

Scalable Algorithms for Contact Problems

Jazyk: Angličtina
Väzba: Pevná
Vydavateľ: Springer, Berlin
Dostupnosť: Skladom u dodávateľa
Odosielame za 10-13 dní
159.64
This book presents a comprehensive treatment of the authors' newly developed scalable algorithms for...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Pevná
Vydalo
2023
Stránok
407
EAN
9783031335792
Enbook ID
43298857
Vydavateľ
Hmotnosť
824
Rozmery
155 x 235

Kompletný popis

This book presents a comprehensive treatment of the authors' newly developed scalable algorithms for the solutions of multibody contact problems of linear elasticity. The brand-new feature of these algorithms is theoretically supported numerical scalability and parallel scalability demonstrated on problems discretized by billions of degrees of freedom. The theory supports solving multibody frictionless contact problems, contact problems with possibly orthotropic Tresca's friction, and transient contact problems. It covers BEM discretization, jumping coefficients, floating bodies, mortar non-penetration conditions, etc. This second edition includes new and updated content, including a chapter on hybrid domain decomposition methods for contact problems (Chap. 14.12). New sections showcase the latest improvements in algorithms, particularly those relating to the fast reconstruction of displacements (Sect. 11.9) and the adaptive reorthogonalization of dual constraints, which speeds up augmented Lagrangians iterations (Sects. 17.4 and 17.5.3). This edition updates the chapter (Chap. 19.5) on parallel implementation and extends several chapters. Additionally, new sections cover stable orthogonalization (Sect. 2.8), angles of subspaces (Sect. 2.11), bounds on the Schur complements' spectrum of stiffness matrices (Sects. 10.7 and 11.7), a benchmark for Coulomb orthotropic friction (Sect. 12.9.2), and bounds on the spectrum of the mass matrix (Sect. 13.6.1). Other sections are extended by a new staff on the Kronecker product (Sect. 2.1), CS-decomposition (Sect. 2.10), and details of discretization (Sects. 10.3 and 11.4).The exposition is divided into four parts, the first of which reviews facets of linear algebra, optimization, and analysis. The most important algorithms and optimality results are presented in the third. The presentation is complete, including continuous formulation, discretization, decomposition, optimality results, and numerical experiments. The final part includes extensions to contact shape optimization, plasticity, and HPC implementation. Graduate students and researchers in mechanical engineering, computational engineering, and applied mathematics, will find this book of great value and interest.

Mohlo by vás zaujímať

PET

Michael E. Phelps
214.68

The Lost Airship

Colin R. Parsons
9.41
133.44

Book of Mark

Larry Richards
12.84

Living Untethered

Michael A. Singer
17.36
15.49

Brief History Of Time

Stephen W. Hawking
10.00
12.35

Avilion

Robert Holdstock
29.03

Planning Algorithms

Steven M LaValle
127.94

Pirates

Paul Shipton
7.55

Female Frontier

Glenda Riley
41.50
16.18

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

Paesi tuoi

Cesare Pavese
12.65

MANUAL DE PSIQUIATRíA

SANTO-DOMINGO CARRASCO
71.23
22.36

My Hero Academia 1

Kohei Horikoshi
6.66

ALBUM DE NAISSANCE FILLE

Carole Guermonprez
18.83
11.86

Tatl&#305

Tugrul savkay
38.75