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

引用次数: 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

引用次数: 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

引用次数: 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

引用次数: 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

引用次数: 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

引用次数: 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":null,"pages":null},"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

引用次数: 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

引用次数: 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

引用次数: 0