On Laporta’s 4-loop sunrise formulae

The Ramanujan Journal - By means of the linearization method, we establish analytical formulae for a class of terminating balanced $$_{4}F_{3}$$ -series and the associated well-poised $$_{7}F_{6}$$...     

Corrected Nonconservative Schemes

Derivatives of discontinuities being Dirac singularities, it is usually not possible to multiply them by discontinuous functions. However in the context of conservation laws we have shown in a recent paper that it can be done. We shall make use of this new framework to revisit some upwind methods, mostly characteristic schemes, and show that they can be corrected to be conservative and to work on difficult problems such as Euler's equations for fluids. Numerous numerical results are given.     

Euler-Maclaurin 公式与渐近估计

若 f(x)是连续可微函数,那么我们可以用 f(x)及其导函数 f′(x)的有关积分表示有限和 sum from k=n+1 to m f(k),这就是重要的 Euler-Maclaurin 公式.令 m 趋于无穷,我们就可以用广义积分表示出相应的无穷级数.更一般地,当级数是函数项级数 sum from k=1 to ∞ f(k,t)时,这个级数可用含参数 t 的广义积分表示出来.这对于研究级数的和函数的渐近性质常常是很有用的.本文先介绍 Euler-Maclaurin 公式,然后给出它在渐近估计方面的几个例子.     

高维的Euler-Maclaurin求和公式

1 设闭区域D由可求长的简单闭曲线C围成。令A=α~2/αxαy表微分算子。又设A~mF(x,y)和A~mP(x,y)在D上连续。重复应用Gieen公式和数学归纳法可得下列积分关系式     

关于Euler-Maclaurin公式的一个注记

利用梯形公式的余项,将被积函数的二阶导数做幂级数展开,证明了余项是关于求积区间长度的奇数次幂级数.推导出了复合梯形公式的一类渐近展开式,从另一方面印证了Euler-Maclaurin公式.     

Reich’s problem concerning Halpern’s convergence

We discuss Halpern’s convergence for nonexpansive mappings in Hilbert spaces. We prove that one of the conditions in [R. Wittmann, Approximation of fixed points of nonexpansive mappings, Arch. Math. (Basel), 58 (1992), 486–491] is the weakest sufficient condition among the conditions known to us. We also improve a necessary condition, which is close to Wittmann’s. This is one step to solve the problem raised by Reich in 1974 and 1983. Received: 15 July 2008     

Warfield’s Duality and Malcev’s Matrix

In this work, we investigate relations between Malcev’s matrices of a torsion-free group G of finite rank and Malcev’s matrices of groups Hom(R,G) and Hom(G,R), where G is a locally free group and R is a torsion-free group of rank 1.     

Bergmann’s Dilemma and Internalism’s Escape

Michael Bergmann has argued that internalist accounts of justification face an insoluble dilemma. This paper begins with an explanation of Bergmann??s dilemma. Next, I review some recent attempts to answer the dilemma, which I argue are insufficient to overcome it. The solution I propose presents an internalist account of justification through direct acquaintance. My thesis is that direct acquaintance can provide subjective epistemic assurance without falling prey to the quagmire of difficulties that Bergmann alleges all internalist accounts of justification cannot surmount.     

Euler-Maclaurin求和公式的新证明

本文用带积分余项的Taylor展开式,将Euler-Maclaurin求和公式的证明转化成一个特殊的上三角线性代数方积组的求解,避免了引进Bermoulli多项式。     

Generalizations of Sherman’s Inequality Via Fink’s Identity and Green’s Function

Ukrainian Mathematical Journal - New generalizations of Sherman’s inequality for n-convex functions are obtained with the help of Fink’s identity and Green’s function. By using...     

On Andrunakievich’s chain and Koethe’s problem

In 1969 Andrunakievich asked whether one gets a ring without nonzero nil left ideals from an arbitrary ring R by factoring out the ideal A(R) which is the sum of all nil left ideals of R. Recently, it was shown that this problem is equivalent to Koethe’s problem. In this context one may consider the chain of ideals, which starts with A ₁(R) = A(R) ⊆ A ₂(R), where A ₂(R)/A ₁(R) = A(R/A ₁(R)), and extends by repeating this process. We study the properties of this chain and show that, assuming a negative solution of Koethe’s problem, this chain can terminate at any given ordinal number.     

Plateau’s Problem and Riemann’s Mapping Theorem

First the connection between conformal mappings and Plateau’s problem is pointed out. Then the relation between minimizers of area and energy under Plateau boundary conditions is discussed (joint work with F. Sauvigny). Finally, generalizations of the mapping theorems of Riemann and Koebe for Riemannian metrics are presented (joint work with H. von der Mosel).     

Kantorovich’s majorants principle for Newton’s method

We prove Kantorovich’s theorem on Newton’s method using a convergence analysis which makes clear, with respect to Newton’s method, the relationship of the majorant function and the non-linear operator under consideration. This approach enables us to drop out the assumption of existence of a second root for the majorant function, still guaranteeing Q-quadratic convergence rate and to obtain a new estimate of this rate based on a directional derivative of the derivative of the majorant function. Moreover, the majorant function does not have to be defined beyond its first root for obtaining convergence rate results. The research of O.P. Ferreira was supported in part by FUNAPE/UFG, CNPq Grant 475647/2006-8, CNPq Grant 302618/2005-8, PRONEX–Optimization(FAPERJ/CNPq) and IMPA. The research of B.F. Svaiter was supported in part by CNPq Grant 301200/93-9(RN) and by PRONEX–Optimization(FAPERJ/CNPq).     

Dedekind’s and Frege’s views on logic

A contextual and comparative analysis shows that Dedekind and Frege do not understand the terms “logic” and “arithmetic” in the same way. More specifically the meaning and the scope of the corresponding concepts are essentially different for them. Consequently Dedekind and Frege have different conceptions of the relationship between arithmetic and logic.     

On Hilbert’s solution of Waring’s problem

In 1909, Hilbert proved that for each fixed k, there is a number g with the following property: Every integer N ≥ 0 has a representation in the form N = x ₁ ^k + x ₂ ^k + … + x _g ^k , where the x _i are nonnegative integers. This resolved a conjecture of Edward Waring from 1770. Hilbert’s proof is somewhat unsatisfying, in that no method is given for finding a value of g corresponding to a given k. In his doctoral thesis, Rieger showed that by a suitable modification of Hilbert’s proof, one can give explicit bounds on the least permissible value of g. We show how to modify Rieger’s argument, using ideas of F. Dress, to obtain a better explicit bound. While far stronger bounds are available from the powerful Hardy-Littlewood circle method, it seems of some methodological interest to examine how far elementary techniques of this nature can be pushed.     

High-order Gauss–Lobatto formulae

Currently, the method of choice for computing the (n+2)-point Gauss–Lobatto quadrature rule for any measure of integration is to first generate the Jacobi matrix of order n+2 for the measure at hand, then modify the three elements at the right lower corner of the matrix in a manner proposed in 1973 by Golub, and finally compute the eigenvalues and first components of the respective eigenvectors to produce the nodes and weights of the quadrature rule. In general, this works quite well, but when n becomes large, underflow problems cause the method to fail, at least in the software implementation provided by us in 1994. The reason is the singularity (caused by underflow) of the 2×2 system of linear equations that is used to compute the modified matrix elements. It is shown here that in the case of arbitrary Jacobi measures, these elements can be computed directly, without solving a linear system, thus allowing the method to function for essentially unrestricted values of n. In addition, it is shown that all weights of the quadrature rule can also be computed explicitly, which not only obviates the need to compute eigenvectors, but also provides better accuracy. Numerical comparisons are made to illustrate the effectiveness of this new implementation of the method.     

Gol’dberg’s constants

We study two extremal problems of geometric function theory introduced by A. A. Gol’dberg in 1973. For one problem we find the exact solution, and for the second one we obtain partial results. In the process, we study the lengths of hyperbolic geodesics in the twice punctured plane, prove several results about them, and make a conjecture. Gol’dberg’s problems have important applications to control theory.