首页 > 最新文献

Mathematics of Computation最新文献

英文 中文
Fourier optimization and Montgomery’s pair correlation conjecture 傅立叶优化和蒙哥马利对相关猜想
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3990
Emanuel Carneiro, Micah Milinovich, Antonio Pedro Ramos

Assuming the Riemann hypothesis, we improve the current upper and lower bounds for the average value of Montgomery’s function F ( α , T ) F(alpha , T) over long intervals by means of a Fourier optimization framework. The function F ( α , T ) F(alpha , T) is often used to study the pair correlation of the non-trivial zeros of the Riemann zeta-function. Two ideas play a central role in our approach: (i) the introduction of new averaging mechanisms in our conceptual framework and (ii) the full use of the class of test functions introduced by Cohn and Elkies for the sphere packing bounds, going beyond the usual class of bandlimited functions. We conclude that such an average value, that is conjectured to be 1 1 , lies between 0.9303 0.9303 and 1.3208 1.3208 . Our Fourier optimization framework also yields an improvement on the current bounds for the analogous problem concerning the non-trivial zeros in the family of Dirichlet L L -functions.

假定黎曼假设,我们通过傅里叶优化框架改进了蒙哥马利函数 F ( α , T ) F(alpha , T) 在长间隔内平均值的当前上下限。函数 F ( α , T ) F(alpha , T) 经常被用来研究黎曼zeta函数非三维零点的对相关性。在我们的方法中,有两个想法起着核心作用:(i) 在我们的概念框架中引入新的平均机制;(ii) 充分利用科恩(Cohn)和埃尔基斯(Elkies)为球包装边界引入的测试函数类别,超越了通常的带限函数类别。我们的结论是,这样一个平均值(推测为 1 1)介于 0.9303 0.9303 和 1.3208 1.3208 之间。我们的傅里叶优化框架还改进了目前关于迪里夏特 L L - 函数族中非琐零点的类似问题的边界。
{"title":"Fourier optimization and Montgomery’s pair correlation conjecture","authors":"Emanuel Carneiro, Micah Milinovich, Antonio Pedro Ramos","doi":"10.1090/mcom/3990","DOIUrl":"https://doi.org/10.1090/mcom/3990","url":null,"abstract":"<p>Assuming the Riemann hypothesis, we improve the current upper and lower bounds for the average value of Montgomery’s function <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper F left-parenthesis alpha comma upper T right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>F</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>,</mml:mo> <mml:mi>T</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">F(alpha , T)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> over long intervals by means of a Fourier optimization framework. The function <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper F left-parenthesis alpha comma upper T right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>F</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>α</mml:mi> <mml:mo>,</mml:mo> <mml:mi>T</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">F(alpha , T)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is often used to study the pair correlation of the non-trivial zeros of the Riemann zeta-function. Two ideas play a central role in our approach: (i) the introduction of new averaging mechanisms in our conceptual framework and (ii) the full use of the class of test functions introduced by Cohn and Elkies for the sphere packing bounds, going beyond the usual class of bandlimited functions. We conclude that such an average value, that is conjectured to be <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"1\"> <mml:semantics> <mml:mn>1</mml:mn> <mml:annotation encoding=\"application/x-tex\">1</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, lies between <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"0.9303\"> <mml:semantics> <mml:mn>0.9303</mml:mn> <mml:annotation encoding=\"application/x-tex\">0.9303</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"1.3208\"> <mml:semantics> <mml:mn>1.3208</mml:mn> <mml:annotation encoding=\"application/x-tex\">1.3208</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. Our Fourier optimization framework also yields an improvement on the current bounds for the analogous problem concerning the non-trivial zeros in the family of Dirichlet <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper L\"> <mml:semantics> <mml:mi>L</mml:mi> <mml:annotation encoding=\"application/x-tex\">L</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-functions.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511719","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
Schinzel-type bounds for the Mahler measure on lemniscates ∞上马勒度量的辛泽尔型边界
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3985
Ryan Looney, Igor Pritsker

We study the generalized Mahler measure on lemniscates, and prove a sharp lower bound for the measure of totally real integer polynomials that includes the classical result of Schinzel expressed in terms of the golden ratio. Moreover, we completely characterize many cases when this lower bound is attained. For example, we explicitly describe all lemniscates and the corresponding quadratic polynomials that achieve our lower bound for the generalized Mahler measure. It turns out that the extremal polynomials attaining the bound must have even degree. The main computational part of this work is related to finding many extremals of degree four and higher, which is a new feature compared to the original Schinzel’s theorem where only quadratic irreducible extremals are possible.

我们研究了∞上的广义马勒度量,并证明了完全实整数多项式度量的一个尖锐下界,其中包括用黄金分割率表示的申泽尔经典结果。此外,我们完全描述了达到这个下界的许多情况。例如,我们明确描述了达到广义马勒度量下界的所有∞和相应的二次多项式。事实证明,达到下界的极值多项式必须具有偶数阶。这项工作的主要计算部分与找到许多四度及四度以上的极值有关,这是与最初的辛泽尔定理相比的一个新特点,在最初的辛泽尔定理中,只有二次不可还原极值是可能的。
{"title":"Schinzel-type bounds for the Mahler measure on lemniscates","authors":"Ryan Looney, Igor Pritsker","doi":"10.1090/mcom/3985","DOIUrl":"https://doi.org/10.1090/mcom/3985","url":null,"abstract":"<p>We study the generalized Mahler measure on lemniscates, and prove a sharp lower bound for the measure of totally real integer polynomials that includes the classical result of Schinzel expressed in terms of the golden ratio. Moreover, we completely characterize many cases when this lower bound is attained. For example, we explicitly describe all lemniscates and the corresponding quadratic polynomials that achieve our lower bound for the generalized Mahler measure. It turns out that the extremal polynomials attaining the bound must have even degree. The main computational part of this work is related to finding many extremals of degree four and higher, which is a new feature compared to the original Schinzel’s theorem where only quadratic irreducible extremals are possible.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511722","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
Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices 估算稀疏对称矩阵函数迹的随机探测方法分析
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3984
Andreas Frommer, Michele Rinelli, Marcel Schweitzer

We consider the problem of estimating the trace of a matrix function f ( A ) f(A) . In certain situations, in particular if f ( A ) f(A) cannot be well approximated by a low-rank matrix, combining probing methods based on graph colorings with stochastic trace estimation techniques can yield accurate approximations at moderate cost. So far, such methods have not been thoroughly analyzed, though, but were rather used as efficient heuristics by practitioners. In this manuscript, we perform a detailed analysis of stochastic probing methods and, in particular, expose conditions under which the expected approximation error in the stochastic probing method scales more favorably with the dimension of the matrix than the error in non-stochastic probing. Extending results from Aune, Simpson, and Eidsvik [Stat. Comput. 24 (2014), pp. 247–263], we also characterize situations in which using just one stochastic vector is always—not only in expectation—better than the deterministic probing method. Several numerical experiments illustrate our theory and compare with existing methods.

我们考虑的问题是估计矩阵函数 f ( A ) f(A) 的迹。在某些情况下,特别是当 f ( A ) f(A) 不能很好地被低秩矩阵逼近时,将基于图着色的探测方法与随机迹估计技术相结合,可以以适度的成本获得精确的逼近结果。不过,迄今为止,这种方法还没有被彻底分析过,而是被实践者用作高效的启发式方法。在本手稿中,我们对随机探测方法进行了详细分析,特别是揭示了随机探测方法的预期近似误差与矩阵维数的关系比非随机探测误差更有利的条件。通过扩展 Aune、Simpson 和 Eidsvik [Stat. Comput. 24 (2014),第 247-263 页] 的结果,我们还描述了仅使用一个随机向量始终优于确定性探测方法的情况,而不仅仅是期望值。几个数值实验说明了我们的理论,并与现有方法进行了比较。
{"title":"Analysis of stochastic probing methods for estimating the trace of functions of sparse symmetric matrices","authors":"Andreas Frommer, Michele Rinelli, Marcel Schweitzer","doi":"10.1090/mcom/3984","DOIUrl":"https://doi.org/10.1090/mcom/3984","url":null,"abstract":"<p>We consider the problem of estimating the trace of a matrix function <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"f left-parenthesis upper A right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>A</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">f(A)</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. In certain situations, in particular if <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"f left-parenthesis upper A right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mi>A</mml:mi> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">f(A)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> cannot be well approximated by a low-rank matrix, combining probing methods based on graph colorings with stochastic trace estimation techniques can yield accurate approximations at moderate cost. So far, such methods have not been thoroughly analyzed, though, but were rather used as efficient heuristics by practitioners. In this manuscript, we perform a detailed analysis of stochastic probing methods and, in particular, expose conditions under which the expected approximation error in the stochastic probing method scales more favorably with the dimension of the matrix than the error in non-stochastic probing. Extending results from Aune, Simpson, and Eidsvik [Stat. Comput. 24 (2014), pp. 247–263], we also characterize situations in which using just one stochastic vector is always—not only in expectation—better than the deterministic probing method. Several numerical experiments illustrate our theory and compare with existing methods.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511721","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
Error bounds for Gauss–Jacobi quadrature of analytic functions on an ellipse 椭圆上解析函数的高斯-雅可比正交误差范围
IF 2 2区 数学 Q1 Mathematics Pub Date : 2024-05-11 DOI: 10.1090/mcom/3977
Hiroshi Sugiura, Takemitsu Hasegawa

For the Gauss–Jacobi quadrature on [ 1 , 1 ] [-1,1] , the location is estimated where the kernel of the error functional for functions analytic on an ellipse and its interior in the complex plane attains its maximum modulus. For the Jacobi weight ( 1 t ) α ( 1 + t ) β (1-t)^alpha (1+t)^beta ( α > 1 alpha >-1 , β > 1 beta >-1 ) except for the Gegenbauer weight ( α = β alpha =beta ), the location is the intersection point of the ellipse with the real axis in the complex plane. For the Gegenbauer weight, it is the intersection point(s) with either the real or the imaginary axis or other axes with angle

对于 [ - 1 , 1 ] [-1,1] 上的高斯-雅可比正交,在复平面内椭圆及其内部解析函数的误差函数核达到最大模的位置进行估计。对于雅可比权重 ( 1 - t ) α ( 1 + t ) β (1-t)^alpha (1+t)^beta ( α > - 1 alpha >-1 , β > - 1 beta >-1 ) 除了格根鲍尔权重 ( α = β alpha =beta ) 以外,位置都是椭圆与复平面实轴的交点。对于格根鲍尔权重,它是与实轴或虚轴或其他轴的交点,角度分别为 1 4 π tfrac {1}{4}pi 和 3 4 π tfrac {3}{4}pi 。我们的结果支持 Gautschi 和 Varga [SIAM J. Numer. Anal, 20 (1983), pp.本文还对所获得的结果进行了数值说明。
{"title":"Error bounds for Gauss–Jacobi quadrature of analytic functions on an ellipse","authors":"Hiroshi Sugiura, Takemitsu Hasegawa","doi":"10.1090/mcom/3977","DOIUrl":"https://doi.org/10.1090/mcom/3977","url":null,"abstract":"<p>For the Gauss–Jacobi quadrature on <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"left-bracket negative 1 comma 1 right-bracket\"> <mml:semantics> <mml:mrow> <mml:mo stretchy=\"false\">[</mml:mo> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy=\"false\">]</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">[-1,1]</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, the location is estimated where the kernel of the error functional for functions analytic on an ellipse and its interior in the complex plane attains its maximum modulus. For the Jacobi weight <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"left-parenthesis 1 minus t right-parenthesis Superscript alpha Baseline left-parenthesis 1 plus t right-parenthesis Superscript beta\"> <mml:semantics> <mml:mrow> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>−</mml:mo> <mml:mi>t</mml:mi> <mml:msup> <mml:mo stretchy=\"false\">)</mml:mo> <mml:mi>α</mml:mi> </mml:msup> <mml:mo stretchy=\"false\">(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>+</mml:mo> <mml:mi>t</mml:mi> <mml:msup> <mml:mo stretchy=\"false\">)</mml:mo> <mml:mi>β</mml:mi> </mml:msup> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">(1-t)^alpha (1+t)^beta</mml:annotation> </mml:semantics> </mml:math> </inline-formula> (<inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"alpha greater-than negative 1\"> <mml:semantics> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">alpha &gt;-1</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"beta greater-than negative 1\"> <mml:semantics> <mml:mrow> <mml:mi>β</mml:mi> <mml:mo>&gt;</mml:mo> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">beta &gt;-1</mml:annotation> </mml:semantics> </mml:math> </inline-formula>) except for the Gegenbauer weight (<inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"alpha equals beta\"> <mml:semantics> <mml:mrow> <mml:mi>α</mml:mi> <mml:mo>=</mml:mo> <mml:mi>β</mml:mi> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">alpha =beta</mml:annotation> </mml:semantics> </mml:math> </inline-formula>), the location is the intersection point of the ellipse with the real axis in the complex plane. For the Gegenbauer weight, it is the intersection point(s) with either the real or the imaginary axis or other axes with angle <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"one fourth pi\"> <mml:semantics> <mml:mrow> <mml:mstyle displaystyle=\"","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140935842","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
Numerical solution of Poisson partial differential equation in high dimension using two-layer neural networks 利用双层神经网络数值求解高维度泊松偏微分方程
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3971
Mathias Dus, Virginie Ehrlacher

The aim of this article is to analyze numerical schemes using two-layer neural networks with infinite width for the resolution of the high-dimensional Poisson partial differential equation with Neumann boundary condition. Using Barron’s representation of the solution [IEEE Trans. Inform. Theory 39 (1993), pp. 930–945] with a probability measure defined on the set of parameter values, the energy is minimized thanks to a gradient curve dynamic on the 2 2 -Wasserstein space of the set of parameter values defining the neural network. Inspired by the work from Bach and Chizat [On the global convergence of gradient descent for over-parameterized models using optimal transport, 2018; ICM–International Congress of Mathematicians, EMS Press, Berlin, 2023], we prove that if the gradient curve converges, then the represented function is the solution of the elliptic equation considered. Numerical experiments are given to show the potential of the method.

本文旨在分析使用无限宽双层神经网络的数值方案,以解决具有诺伊曼边界条件的高维泊松偏微分方程。利用巴伦的求解表示法[IEEE Trans. Inform. Theory 39 (1993), pp.受 Bach 和 Chizat [On the global convergence of gradient descent for over-parameterized models using optimal transport, 2018; ICM-International Congress of Mathematicians, EMS Press, Berlin, 2023] 工作的启发,我们证明,如果梯度曲线收敛,那么所表示的函数就是所考虑的椭圆方程的解。我们给出了数值实验,以展示该方法的潜力。
{"title":"Numerical solution of Poisson partial differential equation in high dimension using two-layer neural networks","authors":"Mathias Dus, Virginie Ehrlacher","doi":"10.1090/mcom/3971","DOIUrl":"https://doi.org/10.1090/mcom/3971","url":null,"abstract":"<p>The aim of this article is to analyze numerical schemes using two-layer neural networks with infinite width for the resolution of the high-dimensional Poisson partial differential equation with Neumann boundary condition. Using Barron’s representation of the solution [IEEE Trans. Inform. Theory 39 (1993), pp. 930–945] with a probability measure defined on the set of parameter values, the energy is minimized thanks to a gradient curve dynamic on the <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"2\"> <mml:semantics> <mml:mn>2</mml:mn> <mml:annotation encoding=\"application/x-tex\">2</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-Wasserstein space of the set of parameter values defining the neural network. Inspired by the work from Bach and Chizat [On the global convergence of gradient descent for over-parameterized models using optimal transport, 2018; ICM–International Congress of Mathematicians, EMS Press, Berlin, 2023], we prove that if the gradient curve converges, then the represented function is the solution of the elliptic equation considered. Numerical experiments are given to show the potential of the method.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511724","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
Müntz Legendre polynomials: Approximation properties and applications Müntz Legendre 多项式:逼近特性与应用
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3987
Tengteng Cui, Chuanju Xu

The Müntz Legendre polynomials are a family of generalized orthogonal polynomials, defined by contour integral associated with a complex sequence Λ = { λ 0 , λ 1 , λ 2 , } Lambda ={lambda _{0},lambda _{1},lambda _{2},cdots } . In this paper, we are interested in two subclasses of the Müntz Legendre polynomials. Precisely, we theoretically and numerically investigate the basic approximation properties of the Müntz Legendre polynomials for two sets of Λ Lambda sequences: λ k = λ lambda _{k}=lambda , and λ k = k λ + q lambda _k=klambda +q for some λ lambda and q

Müntz Legendre 多项式是广义正交多项式族,由与复序列Λ = { λ 0 , λ 1 , λ 2 , ⋯ } 相关的等高线积分定义。 Lambda ={lambda _{0},lambda _{1},lambda _{2},cdots } 。在本文中,我们对 Müntz Legendre 多项式的两个子类感兴趣。确切地说,我们从理论和数值上研究了两组Λ Lambda 序列的 Müntz Legendre 多项式的基本近似性质:λ k = λ lambda _{k}= lambda ,以及 λ k = k λ + q lambda _k=klambda +q ,对于某个 λ lambda 和 q q。首先,对两个多项式子类的投影和插值误差进行了分析和数值检验,并得出了非均匀加权 Sobolev 空间中函数的一些误差估计值。然后,为了证明 Müntz 多项式的适用性,提出了一种基于 Müntz Legendre 多项式的 Galerkin 频谱方法来求解时空分微分方程。所获得的数值结果表明,即使精确解不是平滑的,所提出的方法也能带来指数级的收敛率。这与使用传统正交多项式的低阶代数收敛相反。
{"title":"Müntz Legendre polynomials: Approximation properties and applications","authors":"Tengteng Cui, Chuanju Xu","doi":"10.1090/mcom/3987","DOIUrl":"https://doi.org/10.1090/mcom/3987","url":null,"abstract":"<p>The Müntz Legendre polynomials are a family of generalized orthogonal polynomials, defined by contour integral associated with a complex sequence <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"normal upper Lamda equals StartSet lamda 0 comma lamda 1 comma lamda 2 comma midline-horizontal-ellipsis EndSet\"> <mml:semantics> <mml:mrow> <mml:mi mathvariant=\"normal\">Λ</mml:mi> <mml:mo>=</mml:mo> <mml:mo fence=\"false\" stretchy=\"false\">{</mml:mo> <mml:msub> <mml:mi>λ</mml:mi> <mml:mrow> <mml:mn>0</mml:mn> </mml:mrow> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>λ</mml:mi> <mml:mrow> <mml:mn>1</mml:mn> </mml:mrow> </mml:msub> <mml:mo>,</mml:mo> <mml:msub> <mml:mi>λ</mml:mi> <mml:mrow> <mml:mn>2</mml:mn> </mml:mrow> </mml:msub> <mml:mo>,</mml:mo> <mml:mo>⋯</mml:mo> <mml:mo fence=\"false\" stretchy=\"false\">}</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">Lambda ={lambda _{0},lambda _{1},lambda _{2},cdots }</mml:annotation> </mml:semantics> </mml:math> </inline-formula>. In this paper, we are interested in two subclasses of the Müntz Legendre polynomials. Precisely, we theoretically and numerically investigate the basic approximation properties of the Müntz Legendre polynomials for two sets of <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"normal upper Lamda\"> <mml:semantics> <mml:mi mathvariant=\"normal\">Λ</mml:mi> <mml:annotation encoding=\"application/x-tex\">Lambda</mml:annotation> </mml:semantics> </mml:math> </inline-formula> sequences: <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"lamda Subscript k Baseline equals lamda\"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mi>λ</mml:mi> <mml:mrow> <mml:mi>k</mml:mi> </mml:mrow> </mml:msub> <mml:mo>=</mml:mo> <mml:mi>λ</mml:mi> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">lambda _{k}=lambda</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, and <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"lamda Subscript k Baseline equals k lamda plus q\"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mi>λ</mml:mi> <mml:mi>k</mml:mi> </mml:msub> <mml:mo>=</mml:mo> <mml:mi>k</mml:mi> <mml:mi>λ</mml:mi> <mml:mo>+</mml:mo> <mml:mi>q</mml:mi> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">lambda _k=klambda +q</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for some <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"lamda\"> <mml:semantics> <mml:mi>λ</mml:mi> <mml:annotation encoding=\"application/x-tex\">lambda</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"q\"> <mml:semantics> <mml:mi>q</mml:mi> <mml:annotation encoding=\"applicat","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511717","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
Virtual element methods for Biot–Kirchhoff poroelasticity Biot-Kirchhoff 孔弹性的虚拟元素方法
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3983
Rekha Khot, David Mora, Ricardo Ruiz-Baier

This paper analyses conforming and nonconforming virtual element formulations of arbitrary polynomial degrees on general polygonal meshes for the coupling of solid and fluid phases in deformable porous plates. The governing equations consist of one fourth-order equation for the transverse displacement of the middle surface coupled with a second-order equation for the pressure head relative to the solid with mixed boundary conditions. We propose novel enrichment operators that connect nonconforming virtual element spaces of general degree to continuous Sobolev spaces. These operators satisfy additional orthogonal and best-approximation properties (referred to as conforming companion operators in the context of finite element methods), which play an important role in the nonconforming methods. This paper proves a priori error estimates in the best-approximation form, and derives residual–based reliable and efficient a posteriori error estimates in appropriate norms, and shows that these error bounds are robust with respect to the main model parameters. The computational examples illustrate the numerical behaviour of the suggested virtual element discretisations and confirm the theoretical findings on different polygonal meshes with mixed boundary conditions.

本文分析了一般多边形网格上任意多项式度的符合和不符合虚拟元素公式,用于研究可变形多孔板中固相和流体相的耦合。治理方程由一个中间表面横向位移的四阶方程和一个相对于固体的压力水头的二阶方程组成,并带有混合边界条件。我们提出了新的充实算子,将一般程度的不符合虚拟元素空间与连续 Sobolev 空间连接起来。这些算子满足额外的正交和最佳逼近特性(在有限元方法中称为符合伴算子),在非符合方法中发挥了重要作用。本文证明了最佳逼近形式的先验误差估计,并推导出基于残差的、可靠高效的、适当规范的后验误差估计,而且表明这些误差边界对主要模型参数是稳健的。计算实例说明了所建议的虚拟元素离散的数值行为,并证实了在具有混合边界条件的不同多边形网格上的理论发现。
{"title":"Virtual element methods for Biot–Kirchhoff poroelasticity","authors":"Rekha Khot, David Mora, Ricardo Ruiz-Baier","doi":"10.1090/mcom/3983","DOIUrl":"https://doi.org/10.1090/mcom/3983","url":null,"abstract":"<p>This paper analyses conforming and nonconforming virtual element formulations of arbitrary polynomial degrees on general polygonal meshes for the coupling of solid and fluid phases in deformable porous plates. The governing equations consist of one fourth-order equation for the transverse displacement of the middle surface coupled with a second-order equation for the pressure head relative to the solid with mixed boundary conditions. We propose novel enrichment operators that connect nonconforming virtual element spaces of general degree to continuous Sobolev spaces. These operators satisfy additional orthogonal and best-approximation properties (referred to as conforming companion operators in the context of finite element methods), which play an important role in the nonconforming methods. This paper proves a priori error estimates in the best-approximation form, and derives residual–based reliable and efficient a posteriori error estimates in appropriate norms, and shows that these error bounds are robust with respect to the main model parameters. The computational examples illustrate the numerical behaviour of the suggested virtual element discretisations and confirm the theoretical findings on different polygonal meshes with mixed boundary conditions.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511720","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
Extensible grid sampling for quantile estimation 用于量化估计的可扩展网格采样
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3986
Jingyu Tan, Zhijian He, Xiaoqun Wang

Quantiles are used as a measure of risk in many stochastic systems. We study the estimation of quantiles with the Hilbert space-filling curve (HSFC) sampling scheme that transforms specifically chosen one-dimensional points into high dimensional stratified samples while still remaining the extensibility. We study the convergence and asymptotic normality for the estimate based on HSFC. By a generalized Dvoretzky–Kiefer–Wolfowitz inequality for independent but not identically distributed samples, we establish the strong consistency for such an estimator. We find that under certain conditions, the distribution of the quantile estimator based on HSFC is asymptotically normal. The asymptotic variance is of O ( n 1 1 / d ) O(n^{-1-1/d}) when using n n HSFC-based quadrature points in dimension d d , which is more efficient than the Monte Carlo sampling and the Latin hypercube sampling. Since the asymptotic variance does not admit an explicit form, we establish an asymptotically valid confidence interval by the batching method. We also prove a Bahadur representation for the quantile estimator based on HSFC. Numerical experiments show that the quantile estimator is asymptotically normal with a comparable mean squared error rate of randomized quasi-Monte Carlo (RQMC) sampling. Moreover, the coverage of the confidence intervals constructed with HSFC is better than that with RQMC.

在许多随机系统中,量值被用作风险度量。我们研究了利用希尔伯特空间填充曲线(HSFC)采样方案对量化值进行估计的问题,该方案将特定选择的一维点转化为高维分层样本,同时仍保持可扩展性。我们研究了基于 HSFC 的估计值的收敛性和渐近正态性。通过对独立但非同分布样本的广义 Dvoretzky-Kiefer-Wolfowitz 不等式,我们建立了这种估计器的强一致性。我们发现,在某些条件下,基于 HSFC 的量化估计量的分布是渐近正态的。当在 d d 维使用 n n 个基于 HSFC 的正交点时,渐近方差为 O ( n - 1 - 1 / d ) O(n^{-1-1/d}) ,这比蒙特卡罗抽样和拉丁超立方体抽样更有效。由于渐近方差没有明确的形式,我们通过批处理方法建立了渐近有效的置信区间。我们还证明了基于 HSFC 的量化估计器的 Bahadur 表示。数值实验表明,量值估计器是渐近正态的,其均方误差率与随机准蒙特卡罗(RQMC)抽样相当。此外,用 HSFC 构建的置信区间的覆盖率也优于 RQMC。
{"title":"Extensible grid sampling for quantile estimation","authors":"Jingyu Tan, Zhijian He, Xiaoqun Wang","doi":"10.1090/mcom/3986","DOIUrl":"https://doi.org/10.1090/mcom/3986","url":null,"abstract":"<p>Quantiles are used as a measure of risk in many stochastic systems. We study the estimation of quantiles with the Hilbert space-filling curve (HSFC) sampling scheme that transforms specifically chosen one-dimensional points into high dimensional stratified samples while still remaining the extensibility. We study the convergence and asymptotic normality for the estimate based on HSFC. By a generalized Dvoretzky–Kiefer–Wolfowitz inequality for independent but not identically distributed samples, we establish the strong consistency for such an estimator. We find that under certain conditions, the distribution of the quantile estimator based on HSFC is asymptotically normal. The asymptotic variance is of <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"upper O left-parenthesis n Superscript negative 1 minus 1 slash d Baseline right-parenthesis\"> <mml:semantics> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo stretchy=\"false\">(</mml:mo> <mml:msup> <mml:mi>n</mml:mi> <mml:mrow> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> <mml:mo>−</mml:mo> <mml:mn>1</mml:mn> <mml:mrow> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>d</mml:mi> </mml:mrow> </mml:msup> <mml:mo stretchy=\"false\">)</mml:mo> </mml:mrow> <mml:annotation encoding=\"application/x-tex\">O(n^{-1-1/d})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> when using <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"n\"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding=\"application/x-tex\">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> HSFC-based quadrature points in dimension <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"d\"> <mml:semantics> <mml:mi>d</mml:mi> <mml:annotation encoding=\"application/x-tex\">d</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, which is more efficient than the Monte Carlo sampling and the Latin hypercube sampling. Since the asymptotic variance does not admit an explicit form, we establish an asymptotically valid confidence interval by the batching method. We also prove a Bahadur representation for the quantile estimator based on HSFC. Numerical experiments show that the quantile estimator is asymptotically normal with a comparable mean squared error rate of randomized quasi-Monte Carlo (RQMC) sampling. Moreover, the coverage of the confidence intervals constructed with HSFC is better than that with RQMC.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511723","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
A random active set method for strictly convex quadratic problem with simple bounds 具有简单边界的严格凸二次问题随机活动集方法
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-05-11 DOI: 10.1090/mcom/3982
Ran Gu, Bing Gao

The active set method aims at finding the correct active set of the optimal solution and it is a powerful method for solving strictly convex quadratic problems with bound constraints. To guarantee the finite step convergence, existing active set methods all need strict conditions or some additional strategies, which can significantly impact the efficiency of the algorithm. In this paper, we propose a random active set method that introduces randomness in the active set’s update process. We prove that the algorithm can converge in a finite number of iterations with probability one, without any extra conditions on the problem or any supplementary strategies. At last, numerical experiments show that the algorithm can obtain the correct active set within a few iterations, and it has better efficiency and robustness than the existing methods.

主动集方法旨在找到最优解的正确主动集,是求解有约束条件的严格凸二次方程问题的有力方法。为了保证有限步收敛,现有的主动集方法都需要严格的条件或一些额外的策略,这会极大地影响算法的效率。本文提出了一种随机主动集方法,在主动集的更新过程中引入了随机性。我们证明,该算法可以在有限的迭代次数内以 1 的概率收敛,而不需要对问题附加任何条件或任何辅助策略。最后,数值实验表明,该算法可以在几次迭代中获得正确的主动集,而且与现有方法相比,它具有更好的效率和鲁棒性。
{"title":"A random active set method for strictly convex quadratic problem with simple bounds","authors":"Ran Gu, Bing Gao","doi":"10.1090/mcom/3982","DOIUrl":"https://doi.org/10.1090/mcom/3982","url":null,"abstract":"<p>The active set method aims at finding the correct active set of the optimal solution and it is a powerful method for solving strictly convex quadratic problems with bound constraints. To guarantee the finite step convergence, existing active set methods all need strict conditions or some additional strategies, which can significantly impact the efficiency of the algorithm. In this paper, we propose a random active set method that introduces randomness in the active set’s update process. We prove that the algorithm can converge in a finite number of iterations with probability one, without any extra conditions on the problem or any supplementary strategies. At last, numerical experiments show that the algorithm can obtain the correct active set within a few iterations, and it has better efficiency and robustness than the existing methods.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141511718","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
Uniform error estimate of an asymptotic preserving scheme for the Lévy-Fokker-Planck equation 莱维-福克-普朗克方程渐近保留方案的均匀误差估计
IF 2 2区 数学 Q1 Mathematics Pub Date : 2024-05-01 DOI: 10.1090/mcom/3975
Weiran Sun, Li Wang

We establish a uniform-in-scaling error estimate for the asymptotic preserving (AP) scheme proposed by Xu and Wang [Commun. Math. Sci. 21 (2023), pp. 1–23] for the Lévy-Fokker-Planck (LFP) equation. The main difficulties stem not only from the interplay between the scaling and numerical parameters but also the slow decay of the tail of the equilibrium state. We tackle these problems by separating the parameter domain according to the relative size of the scaling parameter ε varepsilon : in the regime where ε varepsilon is large, we design a weighted norm to mitigate the issue caused by the fat tail, while in the regime where ε varepsilon is small, we prove a strong convergence of LFP towards its fractional diffusion limit with an explicit convergence rate. This method extends the traditional AP estimates to cases where uniform bounds are unavailable. Our result applies to any dimension and to the whole span of the fractional power.

我们为 Xu 和 Wang [Commun. Math. Sci. 21 (2023), pp.主要困难不仅来自比例参数和数值参数之间的相互作用,还来自平衡态尾部的缓慢衰减。我们根据缩放参数 ε varepsilon 的相对大小来分离参数域,从而解决这些问题:在 ε varepsilon 较大的情况下,我们设计了一种加权规范来缓解肥尾引起的问题;而在 ε varepsilon 较小的情况下,我们证明了 LFP 向其分数扩散极限的强收敛性,并给出了明确的收敛速率。这种方法将传统的 AP 估计扩展到了无法获得均匀边界的情况。我们的结果适用于任何维度和分数幂的整个跨度。
{"title":"Uniform error estimate of an asymptotic preserving scheme for the Lévy-Fokker-Planck equation","authors":"Weiran Sun, Li Wang","doi":"10.1090/mcom/3975","DOIUrl":"https://doi.org/10.1090/mcom/3975","url":null,"abstract":"<p>We establish a uniform-in-scaling error estimate for the asymptotic preserving (AP) scheme proposed by Xu and Wang [Commun. Math. Sci. 21 (2023), pp. 1–23] for the Lévy-Fokker-Planck (LFP) equation. The main difficulties stem not only from the interplay between the scaling and numerical parameters but also the slow decay of the tail of the equilibrium state. We tackle these problems by separating the parameter domain according to the relative size of the scaling parameter <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"epsilon\"> <mml:semantics> <mml:mi>ε</mml:mi> <mml:annotation encoding=\"application/x-tex\">varepsilon</mml:annotation> </mml:semantics> </mml:math> </inline-formula>: in the regime where <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"epsilon\"> <mml:semantics> <mml:mi>ε</mml:mi> <mml:annotation encoding=\"application/x-tex\">varepsilon</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is large, we design a weighted norm to mitigate the issue caused by the fat tail, while in the regime where <inline-formula content-type=\"math/mathml\"> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" alttext=\"epsilon\"> <mml:semantics> <mml:mi>ε</mml:mi> <mml:annotation encoding=\"application/x-tex\">varepsilon</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is small, we prove a strong convergence of LFP towards its fractional diffusion limit with an explicit convergence rate. This method extends the traditional AP estimates to cases where uniform bounds are unavailable. Our result applies to any dimension and to the whole span of the fractional power.</p>","PeriodicalId":18456,"journal":{"name":"Mathematics of Computation","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140942482","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
期刊
Mathematics of Computation
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1