SIAM J. Sci. Comput.最新文献_第2页

Accurate Absorbing Boundary Conditions for the Two-Dimensional Nonlocal Schrödinger Equations 二维非局部Schrödinger方程的精确吸收边界条件

SIAM J. Sci. Comput. Pub Date : 2023-07-11 DOI: 10.1137/21m1442048

Gang Pang, Songsong Ji, Jiwei Zhang

引用次数: 0

Row Replicated Block Cimmino 行复制块cimino

SIAM J. Sci. Comput. Pub Date : 2023-07-10 DOI: 10.1137/22m1487710

I. Duff, P. Leleux, Daniel J. Ruiz, F. S. Torun

引用次数: 1

Band Structure Calculations of Three-Dimensional Anisotropic Photonic Crystals in the Oblique Coordinate System 斜坐标系下三维各向异性光子晶体的能带结构计算

SIAM J. Sci. Comput. Pub Date : 2023-07-07 DOI: 10.1137/22m1507863

Heng Tian, Tie-xiang Li, Xing-Long Lyu, Wen-Wei Lin

引用次数: 0

Optimal-Order Convergence of a Two-Step BDF Method for the Navier-Stokes Equations with H1 Initial Data 具有H1初始数据的Navier-Stokes方程的两步BDF方法的最优阶收敛性

SIAM J. Sci. Comput. Pub Date : 2023-07-07 DOI: 10.1007/s10915-023-02270-x

Tianyang Chu, Jilu Wang, Nan Wang, Zhimin Zhang

引用次数: 0

Fast Computing Approaches Based on a Bilinear Pseudo-Spectral Method for Nonlinear Acoustic Wave Equations 基于双线性伪谱法的非线性声波方程快速计算方法

SIAM J. Sci. Comput. Pub Date : 2023-07-05 DOI: 10.1137/22m1506390

M. Khasi, J. Rashidinia, M. Rasoulizadeh

引用次数: 1

A symmetrized parametric finite element method for anisotropic surface diffusion ii. three dimensions 各向异性表面扩散的对称参数有限元法[j]。三个维度

SIAM J. Sci. Comput. Pub Date : 2023-07-05 DOI: 10.48550/arXiv.2206.01883

W. Bao, Yifei Li

引用次数: 1

A High-Order Two-Grid Difference Method for Nonlinear Time-Fractional Biharmonic Problems and Its Unconditional α-Robust Error Estimates 非线性时间分数双调和问题的高阶两格差分法及其无条件α-鲁棒误差估计

SIAM J. Sci. Comput. Pub Date : 2023-06-30 DOI: 10.1007/s10915-023-02282-7

Hongfei Fu, Bingyin Zhang, Xiangcheng Zheng

引用次数: 0

Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes 折叠Reed-Solomon码和多重码的改进列表解码

SIAM J. Sci. Comput. Pub Date : 2023-06-15 DOI: 10.1137/20m1370215

Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters

{"title":"Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes","authors":"Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters","doi":"10.1137/20m1370215","DOIUrl":"https://doi.org/10.1137/20m1370215","url":null,"abstract":"We show new and improved list decoding properties of folded Reed-Solomon (RS) codes and multiplicity codes. Both of these families of codes are based on polynomials over ﬁnite ﬁelds, and both have been the sources of recent advances in coding theory: Folded RS codes were the ﬁrst known explicit construction of capacity-achieving list decodable codes (Guruswami and Rudra, IEEE Trans. Information Theory , 2010), and multiplicity codes were the ﬁrst construction of high-rate locally decodable codes (Kopparty, Saraf, and Yekhanin, J. ACM , 2014). In this work, we show that folded RS codes and multiplicity codes are in fact better than was previously known in the context of list decoding and local list decoding. Our ﬁrst main result shows that folded RS codes achieve list decoding capacity with constant list sizes, independent of the block length. Prior work with constant list sizes ﬁrst obtained list sizes that are polynomial in the block length, and relied on pre-encoding with subspace evasive sets to reduce the list sizes to a constant (Guruswami and Wang, IEEE Trans. Information Theory , 2012; Dvir and Lovett, STOC , 2012). The list size we obtain is (1 /ε ) O (1 /ε ) where ε is the gap to capacity, which matches the list size obtained by pre-encoding with subspace evasive sets. For our second main result, we observe that univariate multiplicity codes exhibit similar behavior, and use this, together with additional ideas, to show that multivariate multiplicity codes are locally list decodable up to their minimum distance . By known reduc-tions, this gives in turn capacity-achieving locally list decodable codes with query complexity exp( ˜ O ((log N ) 5 / 6 )). This improves on the tensor-based construction of (Hemenway, Ron-Zewi, and Wootters, SICOMP , 2019), which gave capacity-achieving locally list decodable codes of query complexity","PeriodicalId":21812,"journal":{"name":"SIAM J. Sci. Comput.","volume":"47 1","pages":"794-840"},"PeriodicalIF":0.0,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85150634","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}

引用次数: 2

Accelerated Smoothing Hard Thresholding Algorithms for ℓ 0 Regularized Nonsmooth Convex Regression Problem 正则化非光滑凸回归问题的加速平滑硬阈值算法

SIAM J. Sci. Comput. Pub Date : 2023-06-15 DOI: 10.1007/s10915-023-02249-8

Wei Bian, Fan Wu

引用次数: 0

Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu 树结构分布的近最优学习

SIAM J. Sci. Comput. Pub Date : 2023-06-15 DOI: 10.1137/22m1489678

Arnab Bhattacharyya, Sutanu Gayen, Eric Price, V. Tan, N. V. Vinodchandran

引用次数: 2