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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
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":null,"pages":null},"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}
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.
{"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：