Scalable Algorithms for Contact Problems
Home > Mathematics and Science Textbooks > Mathematics > Calculus and mathematical analysis > Numerical analysis > Scalable Algorithms for Contact Problems: (36 Advances in Mechanics and Mathematics)
Scalable Algorithms for Contact Problems: (36 Advances in Mechanics and Mathematics)

Scalable Algorithms for Contact Problems: (36 Advances in Mechanics and Mathematics)


     0     
5
4
3
2
1



International Edition


X
About the Book

This book presents a comprehensive treatment of recently developed scalable algorithms for solving multibody contact problems of linear elasticity. The brand-new feature of these algorithms is their theoretically supported numerical scalability (i.e., asymptotically linear complexity) and parallel scalability demonstrated in solving problems discretized by billions of degrees of freedom. The theory covers solving multibody frictionless contact problems, contact problems with possibly orthotropic Tresca’s friction, and transient contact problems. In addition, it also covers BEM discretization, treating jumping coefficients, floating bodies, mortar non-penetration conditions, etc.  This second edition includes updated content, including a new chapter on hybrid domain decomposition methods for huge contact problems. Furthermore, new sections describe the latest algorithm improvements, e.g., the fast reconstruction of displacements, the adaptive reorthogonalization of dual constraints, and an updated chapter on parallel implementation. Several chapters are extended to give an independent exposition of classical bounds on the spectrum of mass and dual stiffness matrices, a benchmark for Coulomb orthotropic friction, details of discretization, etc.  The exposition is divided into four parts, the first of which reviews auxiliary linear algebra, optimization, and analysis. The most important algorithms and optimality results are presented in the third chapter. The presentation includes continuous formulation, discretization, domain decomposition, optimality results, and numerical experiments. The final part contains 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.

Table of Contents:
Chapter. 1 Contact Problems and Their Solution.- Part. I. Basic Concepts.- Chapter. 2. Linear Algebra.- Chapter. 3. Optimization.- Chapter. 4. Analysis.- Part. II. Optimal QP and QCQP Algorithms.- Chapter. 5. Conjugate Gradients.- Chapter. 6. Gradient Projection for Separable Convex Sets.- Chapter. 7. MPGP for Separable QCQP.- Chapter. 8. MPRGP for Bound-Constrained QP.- Chapter. 9. Solvers for Separable and Equality QP/QCQP Problems.- Part. III. Scalable Algorithms for Contact Problems.- Chapter. 10. TFETI for Scalar Problems.- Chapter. 11. Frictionless Contact Problems.- Chapter. 12. Contact Problems with Friction.- Chapter. 13. Transient Contact Problems.- Chapter. 14. TBETI.- Chapter. 15. Hybrid TFETI and TBETI.- Chapter. 16. Mortars.- Chapter. 17. Preconditioning and Scaling.- Part. IV. Other Applications and Parallel Implementation.- Chapter. 18. Contact with Plasticity.- Chapter.19. Contact Shape Optimization.- Chapter. 20. Massively Parallel Implementation.- Notation and List of Symbols.

About the Author :
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. Tomáš Kozubek is a professor of applied mathematics at IT4Innovations National Supercomputing Center, VŠB–Technical University of Ostrava, specialising in developing scalable algorithms for massively parallel solutions ofengineering problems. He is a scientific director at IT4Innovations. He is also the author or coauthor of over 60 articles (concerning WoS) published in conference proceedings and journals. He is/was PI for the Czech Republic of the project FP7-ICT EXA2CT (Exascale Algorithms and Advanced Computational Techniques), H2020-MSCA-ITN EXPERTISE (models, Experiments and high PERformance computing for Turbine mechanical Integrity and Structural dynamics in Europe), H2020-JTI-EuroHPC Hercules (Hpc EuRopean ConsortiUm Leading Education activitieS), and ERASMUS+ SCTrain. He participates in activities of the H2020 Centre of Excellence in HPC project SPACE focused on computational astrophysics, and the European Digital Innovation Hub Ostrava focused on supporting industry and public organisations in HPC, artificial intelligence, and advanced data analysis. He is a guarantor of the doctoral study programme Computational Sciences at VSB–Technical University of Ostrava, a member of university scientific boards and programming committees of conferences, and a leading organiser of the HPCSE (HPC in Science and Engineering Conference). He is also the primary coordinator of the national Doctoral School for Education in Mathematical Methods and Tools in HPC. Marie Sadowská works as an assistant professor at the Department of Applied Mathematics, closely cooperating with IT4Innovations National Supercomputing Center, both at VŠB-Technical University of Ostrava. She has been interested in boundary element methods in combination with domain decomposition approaches with applications to computational mechanics. Vít Vondrák has been working at VŠB–Technical University of Ostrava since 1993, with the longest period spent at the Department of Applied Mathematics at the Faculty of Electrical Engineering and Computer Science, where he received the title of associate professor in 2007. His professional focus is on numerical linear algebra, optimisation methods including design optimisation, domain decomposition methods, highperformance computing and their applications in structural mechanics, biomechanics, hydrological and traffic simulations. From 1997 to 2007, he spent 2 years at Aalborg University, Denmark, as part of several research stays, and in 2004 and 2006, he stayed in the USA at the University of Colorado at Boulder and Stanford University, California. He was one of the founders of IT4Innovations National Supercomputing Center in the Czech Republic, of which he has been the Managing Director since 2017. As part of his scientific career, he has led or participated in leading a number of research projects, including international EU projects. He was the principal investigator of the Intel Parallel Computing Centre funded by Intel corp., the CzeBaCCA project for cooperation between the Czech Republic and Bavaria in the field of supercomputing applications, and the project to support large infrastructures in the Czech Republic.


Best Sellers


Product Details
  • ISBN-13: 9783031335792
  • Publisher: Springer International Publishing AG
  • Publisher Imprint: Springer International Publishing AG
  • Edition: Revised edition
  • Language: English
  • Returnable: Y
  • Series Title: 36 Advances in Mechanics and Mathematics
  • ISBN-10: 3031335791
  • Publisher Date: 29 Oct 2023
  • Binding: Hardback
  • Height: 235 mm
  • No of Pages: 443
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Scalable Algorithms for Contact Problems: (36 Advances in Mechanics and Mathematics)
Springer International Publishing AG -
Scalable Algorithms for Contact Problems: (36 Advances in Mechanics and Mathematics)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Scalable Algorithms for Contact Problems: (36 Advances in Mechanics and Mathematics)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!