Journal of Complexity最新文献_第6页

Changes of the Editorial Board 编辑委员会的变动

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-12-01 DOI: 10.1016/j.jco.2023.101792

Eric Novak

引用次数: 0

On the complexity of a unified convergence analysis for iterative methods 关于复杂性的一种统一收敛分析迭代方法

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-12-01 DOI: 10.1016/j.jco.2023.101781

I. Argyros, S. Shakhno, Samundra Regmi, H. Yarmola

引用次数: 1

On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property 求解具有Aubin性质的广义方程的牛顿型方法的统一收敛性分析

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-11-22 DOI: 10.1016/j.jco.2023.101817

Ioannis K. Argyros , Santhosh George

引用次数: 0

Optimal recovery and generalized Carlson inequality for weights with symmetry properties 对称权的最优恢复与广义Carlson不等式

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-11-07 DOI: 10.1016/j.jco.2023.101807

K.Yu. Osipenko

引用次数: 0

Changes of the Editorial Board 编辑委员会的变动

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-10-20 DOI: 10.1016/j.jco.2023.101806

Erich Novak

引用次数: 0

Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award katyna Pozharska是2023年Joseph F. Traub信息复杂性青年研究员奖的获得者

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-10-20 DOI: 10.1016/j.jco.2023.101805

David Krieg, Erich Novak, Mathias Sonnleitner, Michaela Szölgyenyi, Henryk Woźniakowski

引用次数: 0

Nonexact oracle inequalities, r-learnability, and fast rates 非精确oracle不等式、r-learnability和快速速率

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-10-13 DOI: 10.1016/j.jco.2023.101804

Daniel Z. Zanger

引用次数: 0

High-order lifting for polynomial Sylvester matrices 多项式Sylvester矩阵的高阶提升

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-10-10 DOI: 10.1016/j.jco.2023.101803

Clément Pernet , Hippolyte Signargout , Gilles Villard

{"title":"High-order lifting for polynomial Sylvester matrices","authors":"Clément Pernet , Hippolyte Signargout , Gilles Villard","doi":"10.1016/j.jco.2023.101803","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101803","url":null,"abstract":"<div>A new algorithm is presented for computing the resultant of two generic bivariate polynomials over an arbitrary field. For <math><mi>p</mi><mo>,</mo><mi>q</mi></math> in <math><mi>K</mi><mo>[</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>]</mo></math> of degree d in x and n in y, the resultant with respect to y is computed using <math><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>1.458</mn></mrow></msup><mi>d</mi><mo>)</mo></math> arithmetic operations if <math><mi>d</mi><mo>=</mo><mi>O</mi><mo>(</mo><msup><mrow><mi>n</mi></mrow><mrow><mn>1</mn><mo>/</mo><mn>3</mn></mrow></msup><mo>)</mo></math>. For <math><mi>d</mi><mo>=</mo><mn>1</mn></math>, the complexity estimate is therefore reconciled with the estimates of Neiger et al. 2021 for the related problems of modular composition and characteristic polynomial in a univariate quotient algebra. The 3/2 barrier in the exponent of n is crossed for the first time for the resultant. The problem is related to that of computing determinants of structured polynomial matrices. We identify new advanced aspects of structure for a polynomial Sylvester matrix. This enables to compute the determinant by mixing the baby steps/giant steps approach of Kaltofen and Villard 2005, until then restricted to the case <math><mi>d</mi><mo>=</mo><mn>1</mn></math> for characteristic polynomials, and the high-order lifting strategy of Storjohann 2003 usually reserved for dense polynomial matrices.</div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0885064X23000729/pdfft?md5=72b813e3258f79c8cf5a380cd73b1e8f&pid=1-s2.0-S0885064X23000729-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91959851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Numerical weighted integration of functions having mixed smoothness 混合光滑函数的数值加权积分

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-10-01 DOI: 10.1016/j.jco.2023.101757

Dinh Dũng

引用次数: 0

Discrepancy bounds for normal numbers generated by necklaces in arbitrary base 任意基数项链生成的正态数的差界

IF 1.7 2区数学

Journal of Complexity Pub Date : 2023-10-01 DOI: 10.1016/j.jco.2023.101767

Roswitha Hofer, Gerhard Larcher

{"title":"Discrepancy bounds for normal numbers generated by necklaces in arbitrary base","authors":"Roswitha Hofer, Gerhard Larcher","doi":"10.1016/j.jco.2023.101767","DOIUrl":"https://doi.org/10.1016/j.jco.2023.101767","url":null,"abstract":"<div>Mordechay B. Levin (1999) has constructed a number λ which is normal in base 2, and such that the sequence <math><msub><mrow><mo>(</mo><mrow><mo>{</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup><mi>λ</mi><mo>}</mo></mrow><mo>)</mo></mrow><mrow><mi>n</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo></mrow></msub></math> has very small discrepancy <math><mi>N</mi><mo>⋅</mo><msub><mrow><mi>D</mi></mrow><mrow><mi>N</mi></mrow></msub><mo>=</mo><mi>O</mi><mrow><mo>(</mo><msup><mrow><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>N</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></mrow></math>. This construction technique was generalized by Becher and Carton (2019), who generated normal numbers via nested perfect necklaces, for which the same upper discrepancy estimate holds. In this paper we derive an upper discrepancy bound for so-called semi-perfect nested necklaces and show that for Levin's normal number in arbitrary prime base p this upper bound for the discrepancy is best possible. This result generalizes a previous result by the authors (2022) in base 2.Our result for Levin's normal number in any prime base might support the guess that <math><mi>O</mi><mo>(</mo><msup><mrow><mo>(</mo><mi>log</mi><mo>⁡</mo><mi>N</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>)</mo></math> is the best order in N that can be achieved by a normal number, while generalizing the class of known normal numbers by introducing semi-perfect necklaces on the other hand might help for the search of normal numbers that satisfy smaller discrepancy bounds.</div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":null,"pages":null},"PeriodicalIF":1.7,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50198397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0