299,99 €
Produit Neuf
Ou 75,00 € /mois
- Livraison : 25,00 €
- Livré entre le 3 et le 8 octobre
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour
Avis sur Scalable Algorithms For Contact Problems de Marie Sadowská Format Broché - Livre Sports
0 avis sur Scalable Algorithms For Contact Problems de Marie Sadowská Format Broché - Livre Sports
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
-
Pierre Bayle
Neuf dès 222,62 €
-
Quantum Electrodynamics Of Strong Fields
Neuf dès 211,28 €
-
Soviet Military Deception In The Second World War
Neuf dès 195,80 €
-
Norstedts Stora Svensk-Engelska Ordbok : Norstedts Comprehensive Swedish-English Dictionary
Occasion dès 205,00 €
-
Introduction To Hilbert Spaces With Applications
Neuf dès 225,99 €
-
Elementary Fluid Mechanics
Neuf dès 354,14 €
-
Custom Lettering Of The '60s & '70s
Occasion dès 162,00 €
-
Lawrence Weiner: Displacement
Occasion dès 207,99 €
-
Diego Rivera. The Complete Murals
Neuf dès 212,44 €
-
Flashpoint: The 10th Anniversary Omnibus
Neuf dès 158,08 €
-
A Court Of Thorns And Roses Paperback Box Set
Occasion dès 171,95 €
-
Bay Area Graffiti 80-90
1 avis
Occasion dès 325,99 €
-
Monster Hunter: World - Official Complete Works
1 avis
Neuf dès 215,99 €
-
Gustave Moreau - Catalogue Sommaire Des Dessins - Musee Gustave Moreau
Occasion dès 380,00 €
-
Art+Com
Occasion dès 155,99 €
-
The Lord Of The Rings
Neuf dès 190,88 €
-
Nuancier Dcs Cmyk Pro
Occasion dès 230,00 €
-
The New Munsell Student Color Set
Neuf dès 160,42 €
-
Eva Hesse
Occasion dès 297,99 €
-
Art Of Merit: Studies In Buddhist Art And Its Conservation
Neuf dès 229,67 €
Produits similaires
Présentation Scalable Algorithms For Contact Problems de Marie Sadowská Format Broché
- Livre Sports
Résumé :
This book presents a comprehensive and self-contained 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. The exposition is divided into four parts, the first of which reviews appropriate facets of linear algebra, optimization, and analysis. The most important algorithms and optimality results are presented in the third part of the volume. 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....
Biographie: Sommaire:
Détails de conformité du produit
Personne responsable dans l'UE
Zden?k Dost?l is a professor at the Department of Applied Mathematics and Senior Researcher at IT4Innovations National Supercomputing Center, V?B-Technical University of Ostrava. Zden?k works in Numerical Linear Algebra, Optimization, and Computational Mechanics. He published his results in more than 120 papers (Scopus). He is an author of the book 'Optimal Quadratic Programming Algorithms' (Springer 2009) and coauthor of 'Scalable Algorithms for Contact Problems' (Springer 2017) on massively parallel algorithms with theoretically supported linear (optimal) complexity. His current research concerns QP, QCQP, and generalization of the above results to H-TFETI and H-TBETI.
Zden?k Dost?l is a professor at the Department of Applied Mathematics and Senior Researcher at IT4Innovations National Supercomputing Center, V?B-Technical University of Ostrava. Zden?k works in Numerical Linear Algebra, Optimization, and Computational Mechanics. He published his results in more than 120 papers (Scopus). He is an author of the book 'Optimal Quadratic Programming Algorithms' (Springer 2009) and coauthor of 'Scalable Algorithms for Contact Problems' (Springer 2017) on massively parallel algorithms with theoretically supported linear (optimal) complexity. His current research concerns QP, QCQP, and generalization of the above results to H-TFETI and H-TBETI.