找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Science – ICCS 2018; 18th International C Yong Shi,Haohuan Fu,Peter M. A. Sloot Conference proceedings 2018 Springer Internat

[复制链接]
楼主: 并排一起
发表于 2025-3-23 12:59:07 | 显示全部楼层
发表于 2025-3-23 14:32:38 | 显示全部楼层
Symmetric Sweeping Algorithms for Overlaps of Quadrilateral Meshes of the Same Connectivity intersection is presented. By symmetry, an alternative direction sweep algorithm halves the searching space. It reduces more than 256 possible cases of polygon intersection to 34 (17 when considering symmetry) programmable cases of edge intersections. Besides, we show that the complexity depends on how the old and new mesh intersect.
发表于 2025-3-23 21:58:54 | 显示全部楼层
发表于 2025-3-24 01:36:06 | 显示全部楼层
发表于 2025-3-24 06:23:37 | 显示全部楼层
Efficient Linearly and Unconditionally Energy Stable Schemes for the Phase Field Model of Solid-Statmulas(BDF2) for time discretization, and finite element methods for space discretization. It is shown that the schemes are unconditionally stable and the discrete equations are uniquely solvable for all time steps. We present some numerical experiments to validate the stability and accuracy of the proposed schemes.
发表于 2025-3-24 09:11:00 | 显示全部楼层
发表于 2025-3-24 11:27:08 | 显示全部楼层
Gianluca Ranzi,Brett C. Phillips error bounds are obtained. Numerical results are presented. Theoretically and numerically, the new method is much better than other edge stabilization methods and is comparable to the SUPG method, and generally, the new method is more stable than the SUPG method.
发表于 2025-3-24 18:12:27 | 显示全部楼层
Keyou Feng,Luisa Huaccho Huatucomulas(BDF2) for time discretization, and finite element methods for space discretization. It is shown that the schemes are unconditionally stable and the discrete equations are uniquely solvable for all time steps. We present some numerical experiments to validate the stability and accuracy of the proposed schemes.
发表于 2025-3-24 20:51:14 | 显示全部楼层
Katie Louise Leggett,Minna Lammi,Lewis Walsheuristics and the current SP search speed-up is inversely proportional to landmark generation time, we propose a parallelization technique which reduces the landmark generation time significantly while increasing its effectiveness.
发表于 2025-3-25 02:12:18 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-23 11:47
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表