Książka Scalable Algorithms for Contact Problems Zdenek Dostál

Scalable Algorithms for Contact Problems

Język: Angielski
Oprawa: Twarda
Wydawca: Springer, Berlin
Dostępność: Dostępna u dostawcy
Wysyłamy za 10-13 dni
686.44
This book presents a comprehensive treatment of the authors' newly developed scalable algorithms for...

Informacje o książce

Język
Angielski
Oprawa
Książka - Twarda
Data wydania
2023
strony
407
EAN
9783031335792
Enbook ID
43298857
Waga
824
Wymiary
155 x 235

Pełny opis

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.

Możesz być zainteresowany

PET

Michael E. Phelps
922.92

The Lost Airship

Colin R. Parsons
40.67
544.94

Book of Mark

Larry Richards
55.18

Living Untethered

Michael A. Singer
62.59
70.98

Brief History Of Time

Stephen W. Hawking
42.05
56.57

Avilion

Robert Holdstock
112.16

Planning Algorithms

Steven M LaValle
576.83

Pirates

Paul Shipton
32.57

Female Frontier

Glenda Riley
185.92
72.86

Klienci, którzy kupili tę książkę, kupili również

Paesi tuoi

Cesare Pavese
51.73

MANUAL DE PSIQUIATRíA

SANTO-DOMINGO CARRASCO
306.58
95.67

My Hero Academia 1

Kohei Horikoshi
32.77

ALBUM DE NAISSANCE FILLE

Carole Guermonprez
80.86
43.63

Tatl&#305

Tugrul savkay
166.47