SIAM J. Sci. Comput.最新文献

筛选
英文 中文
An Operator-Splitting Optimization Approach for Phase-Field Simulation of Equilibrium Shapes of Crystals 晶体平衡形状相场模拟的算子分裂优化方法
SIAM J. Sci. Comput. Pub Date : 2024-06-05 DOI: 10.1137/23m161183x
Zeyu Zhou, Wen Huang, Wei Jiang, Zhen Zhang
{"title":"An Operator-Splitting Optimization Approach for Phase-Field Simulation of Equilibrium Shapes of Crystals","authors":"Zeyu Zhou, Wen Huang, Wei Jiang, Zhen Zhang","doi":"10.1137/23m161183x","DOIUrl":"https://doi.org/10.1137/23m161183x","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"22 3","pages":"331-"},"PeriodicalIF":0.0,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141386043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Simple and Efficient Convex Optimization Based Bound-Preserving High Order Accurate Limiter for Cahn-Hilliard-Navier-Stokes System 基于凸优化的卡恩-希利亚德-纳维尔-斯托克斯系统简单高效的保界高阶精确限幅器
SIAM J. Sci. Comput. Pub Date : 2024-06-03 DOI: 10.1137/23m1587853
Chen Liu, Beatrice Riviere, Jie Shen, Xiangxiong Zhang
{"title":"A Simple and Efficient Convex Optimization Based Bound-Preserving High Order Accurate Limiter for Cahn-Hilliard-Navier-Stokes System","authors":"Chen Liu, Beatrice Riviere, Jie Shen, Xiangxiong Zhang","doi":"10.1137/23m1587853","DOIUrl":"https://doi.org/10.1137/23m1587853","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"13 5","pages":"1923-"},"PeriodicalIF":0.0,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141388849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Almost Complete Analytical Integration in Galerkin Boundary Element Methods Galerkin边界元法的几乎完全解析积分
SIAM J. Sci. Comput. Pub Date : 2023-08-11 DOI: 10.1137/22m1534857
Daniel Seibel
{"title":"Almost Complete Analytical Integration in Galerkin Boundary Element Methods","authors":"Daniel Seibel","doi":"10.1137/22m1534857","DOIUrl":"https://doi.org/10.1137/22m1534857","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"20 1","pages":"2075-"},"PeriodicalIF":0.0,"publicationDate":"2023-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85770141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sublinear Algorithms for Local Graph-Centrality Estimation 局部图中心性估计的次线性算法
SIAM J. Sci. Comput. Pub Date : 2023-08-10 DOI: 10.1137/19m1266976
M. Bressan, E. Peserico, Luca Pretto
{"title":"Sublinear Algorithms for Local Graph-Centrality Estimation","authors":"M. Bressan, E. Peserico, Luca Pretto","doi":"10.1137/19m1266976","DOIUrl":"https://doi.org/10.1137/19m1266976","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"921 1","pages":"968-1008"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85537102","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deterministic (boldsymbol{(unicode{x00BD}+varepsilon)}) -Approximation for Submodular Maximization over a Matroid 确定性(boldsymbol{(unicode{x00BD}+varepsilon)}) -矩阵上的次模最大化近似
SIAM J. Sci. Comput. Pub Date : 2023-07-27 DOI: 10.1137/19m125515x
Niv Buchbinder, Moran Feldman, Mohit Garg
{"title":"Deterministic (boldsymbol{(unicode{x00BD}+varepsilon)}) -Approximation for Submodular Maximization over a Matroid","authors":"Niv Buchbinder, Moran Feldman, Mohit Garg","doi":"10.1137/19m125515x","DOIUrl":"https://doi.org/10.1137/19m125515x","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"72 1","pages":"945-967"},"PeriodicalIF":0.0,"publicationDate":"2023-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73343533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Iterative Stability Enforcement in Adaptive Antoulas-Anderson Algorithms for ({boldsymbol{mathcal{H}_2}}) Model Reduction ({boldsymbol{mathcal{H}_2}})模型约简中自适应Antoulas-Anderson算法的迭代稳定性实施
SIAM J. Sci. Comput. Pub Date : 2023-07-21 DOI: 10.1137/21m1467043
Lisa G. Davis, W. Johns, Lucas Monzón, M. Reynolds
{"title":"Iterative Stability Enforcement in Adaptive Antoulas-Anderson Algorithms for ({boldsymbol{mathcal{H}_2}}) Model Reduction","authors":"Lisa G. Davis, W. Johns, Lucas Monzón, M. Reynolds","doi":"10.1137/21m1467043","DOIUrl":"https://doi.org/10.1137/21m1467043","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"75 1","pages":"1844-"},"PeriodicalIF":0.0,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90052274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm 在有界树宽图上打小调。一种最优算法
SIAM J. Sci. Comput. Pub Date : 2023-07-20 DOI: 10.1137/21m140482x
Julien Baste, Ignasi Sau, D. Thilikos
{"title":"Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm","authors":"Julien Baste, Ignasi Sau, D. Thilikos","doi":"10.1137/21m140482x","DOIUrl":"https://doi.org/10.1137/21m140482x","url":null,"abstract":"For a fixed finite collection of graphs F , the F-M-Deletion problem asks, given an n-vertex input graph G, for the minimum number of vertices that intersect all minor models in G of the graphs in F . by Courcelle’s Theorem, this problem can be solved in time fF (tw) · nO(1), where tw is the treewidth of G, for some function fF depending on F . In a recent series of articles, we have initiated the programme of optimizing asymptotically the function fF . Here we provide an algorithm showing that fF (tw) = 2O(tw · log tw) for every collection F . Prior to this work, the best known function fF was double-exponential in tw . In particular, our algorithm vastly extends the results of Jansen et al. [SODA 2014] for the particular case F = {K5, K3,3} and of Kociumaka and Pilipczuk [Algorithmica 2019] for graphs of bounded genus, and answers an open problem posed by Cygan et al. [Inf Comput 2017]. We combine several ingredients such as the machinery of boundaried graphs in dynamic programming via representatives, the Flat Wall Theorem, Bidimensionality, the irrelevant vertex technique, treewidth modulators, and protrusion replacement. Together with our previous results providing single-exponential algorithms for particular collections F [Theor Comput Sci 2020] and general lower bounds [J Comput Syst Sci 2020], our algorithm yields the following complexity dichotomy when F = {H} contains a single connected graph H, assuming the Exponential Time Hypothesis: fH(tw) = 2Θ(tw) if H is a contraction of the chair or the banner, and fH(tw) = 2Θ(tw · log tw) otherwise.","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"20 1","pages":"865-912"},"PeriodicalIF":0.0,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85606446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Solving Two-Stage Stochastic Variational Inequalities by a Hybrid Projection Semismooth Newton Algorithm 用混合投影半光滑牛顿算法求解两阶段随机变分不等式
SIAM J. Sci. Comput. Pub Date : 2023-07-19 DOI: 10.1137/22m1475302
Xiaozhou Wang, Xiaojun Chen
{"title":"Solving Two-Stage Stochastic Variational Inequalities by a Hybrid Projection Semismooth Newton Algorithm","authors":"Xiaozhou Wang, Xiaojun Chen","doi":"10.1137/22m1475302","DOIUrl":"https://doi.org/10.1137/22m1475302","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"63 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79873619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
The Bold-Thin-Bold Diagrammatic Monte Carlo Method for Open Quantum Systems 开放量子系统的Bold-Thin-Bold图解蒙特卡罗方法
SIAM J. Sci. Comput. Pub Date : 2023-07-19 DOI: 10.1137/22m1499297
Zhenning Cai, Geshuo Wang, Siyao Yang
{"title":"The Bold-Thin-Bold Diagrammatic Monte Carlo Method for Open Quantum Systems","authors":"Zhenning Cai, Geshuo Wang, Siyao Yang","doi":"10.1137/22m1499297","DOIUrl":"https://doi.org/10.1137/22m1499297","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80988457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Numerical Study of Transient Wigner-Poisson Model for RTDs: Numerical Method and Its Applications rtd瞬态Wigner-Poisson模型的数值研究:数值方法及其应用
SIAM J. Sci. Comput. Pub Date : 2023-07-19 DOI: 10.1137/22m1502872
Haiyan Jiang, Tiao Lu, Wenqi Yao, Weitong Zhang
{"title":"Numerical Study of Transient Wigner-Poisson Model for RTDs: Numerical Method and Its Applications","authors":"Haiyan Jiang, Tiao Lu, Wenqi Yao, Weitong Zhang","doi":"10.1137/22m1502872","DOIUrl":"https://doi.org/10.1137/22m1502872","url":null,"abstract":"","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"88 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83822700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信