找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Scalable Algorithms for Contact Problems; Zdeněk Dostál,Tomáš Kozubek,Vít Vondrák Book 20161st edition Springer Science+Business Media LLC

[复制链接]
查看: 17220|回复: 59
发表于 2025-3-21 18:58:09 | 显示全部楼层 |阅读模式
书目名称Scalable Algorithms for Contact Problems
编辑Zdeněk Dostál,Tomáš Kozubek,Vít Vondrák
视频video
概述This is the first monograph on theoretically supported scalable algorithms for contact problems.Exposition neatly presents efficient domain decomposition methods and a comprehensive description of par
丛书名称Advances in Mechanics and Mathematics
图书封面Titlebook: Scalable Algorithms for Contact Problems;  Zdeněk Dostál,Tomáš Kozubek,Vít Vondrák Book 20161st edition Springer Science+Business Media LLC
描述.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, computatio
出版日期Book 20161st edition
关键词Contact problems of elasticity; Domain decomposition; Parallel algorithms; Scalable algorithms; Sobolev
版次1
doihttps://doi.org/10.1007/978-1-4939-6834-3
isbn_softcover978-1-4939-8312-4
isbn_ebook978-1-4939-6834-3Series ISSN 1571-8689 Series E-ISSN 1876-9896
issn_series 1571-8689
copyrightSpringer Science+Business Media LLC 2016
The information of publication is updating

书目名称Scalable Algorithms for Contact Problems影响因子(影响力)




书目名称Scalable Algorithms for Contact Problems影响因子(影响力)学科排名




书目名称Scalable Algorithms for Contact Problems网络公开度




书目名称Scalable Algorithms for Contact Problems网络公开度学科排名




书目名称Scalable Algorithms for Contact Problems被引频次




书目名称Scalable Algorithms for Contact Problems被引频次学科排名




书目名称Scalable Algorithms for Contact Problems年度引用




书目名称Scalable Algorithms for Contact Problems年度引用学科排名




书目名称Scalable Algorithms for Contact Problems读者反馈




书目名称Scalable Algorithms for Contact Problems读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:19:14 | 显示全部楼层
发表于 2025-3-22 03:04:47 | 显示全部楼层
Analysiser to the books by Adams and Fournier (Sobolev Spaces, 2003, [.]), or McLean (Strongly Elliptic Systems and Boundary Integral Equations, 2000, [.]). Then we review some ideas concerning semi-elliptic variational inequalities that provide an abstract framework for the formulation of contact problems.
发表于 2025-3-22 04:52:34 | 显示全部楼层
Gradient Projection for Separable Convex Setsonstraints. To combine the gradient projection with the CG method effectively, it is necessary to have nontrivial bounds on the decrease of . along the projected-gradient path in terms of bounds on the spectrum of its Hessian matrix ..
发表于 2025-3-22 12:30:39 | 显示全部楼层
发表于 2025-3-22 15:25:05 | 显示全部楼层
Contact Problems with Frictionblems of linear elasticity. The problems start with the formulation of friction laws, which are of phenomenological nature. The most popular friction law, the Coulomb law of friction, makes the problem intrinsically non-convex.
发表于 2025-3-22 17:34:21 | 显示全部楼层
发表于 2025-3-22 23:36:47 | 显示全部楼层
发表于 2025-3-23 03:32:05 | 显示全部楼层
Optimizationnear Optimization, 1999, [.]), Nocedal and Wright (Numerical Optimization, 2000, [.]), Conn, Gould, and Toint (Trust Region Methods, 2000, [.]), Bazaraa, Sherali, and Shetty (Nonlinear Programming, Theory and Algorithms, 1993, [.]), or Griva, Nash, and Sofer (Linear and Nonlinear Optimization, 2009, [.]).
发表于 2025-3-23 07:22:47 | 显示全部楼层
ivacy and Data Protection – Security Threats and Contermeasures..Target Groups:.Developers of Electronic Business Processes.IT Managers.IT Security Experts.Researchers..About the Editors:.Norbert Pohlmann: Professor f978-3-8348-1438-8978-3-8348-9788-6
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-15 12:13
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表