On the approximate evaluation of Hadamard finite-part integrals

Grnwald's algorithms for the numerical evaluation of Hadamardfinite-part integrals with non-integer exponent are extendedto the case of integer exponent. These algorithms are basedon the use of Bernstein polynomials and it is shown how, byan appropriate modification of the first algorithm, a convergencerate of order 1/N² may be obtained, where N is the number offunction evaluations.     

Optimal policy for a general repair replacement model: average reward case

For a general repair replacement model, we study two types ofreplacement policy.Replacement policy T replaces the systemat time T since the installation or last replacement, whilereplacement policy N replaces the system at the time of Nthfailure. Let T^* and N^* be the optimal among all policies T andN respectively. Under the expected average reward criterion,then we show that the optimal policy N^* is at least as goodas the optimal policy T^*. Furthermore, for a monotone processmodel, we determine the optimal policy N^* explicitly throughtwo different approaches.     

Harmonic morphisms on heaven spaces

We prove that any (real or complex) analytic horizontally conformalsubmersion from a three-dimensional conformal manifold (M³,c_M) to a two-dimensional conformal manifold (N², c_N) can be,locally, ‘extended’ to a unique harmonic morphismfrom the (eaven)-space (H⁴, g) of (M³, c_N) to (N², c_N). Moreover,any positive harmonic morphism with two-dimensional fibres from(H⁴, g) is obtained in this way.     

A Fast Direct Method for the Least Squares Solution of Slightly Overdetermined Sets of Linear Equations

Noble (1969) has described a method for the solution of N+Mlinear equations in N unknowns, which is based on an initialpartitioning of the matrix A, and which requires only the solutionof square sets of equations. He assumed rank (A) = N. We describehere an efficient implementation of Noble's method, and showthat it generalizes in a simple way to cover also rank deficientproblems. In the common case that the equation is only slightlyoverdetermined (M << N) the resulting algorithm is muchfaster than the standard methods based on M.G.S. or Householderreduction of A, or on the normal equations, and has a very similaroperation count to the algorithm of Cline (1973). Slightly overdetermined systems arise from Galerkin methodsfor non-Hermitian partial differential equations. In these systems,rank (A) = N and advantage can be taken of the structure ofthe matrix A to yield a least squares solution in (N²) operations.     

Local Rigidity of Infinite-Dimensional Teichmuller Spaces

This paper presents a rigidity theorem for infinite-dimensionalBergman spaces of hyperbolic Riemann surfaces, which statesthat the Bergman space A¹(M), for such a Riemann surface M,is isomorphic to the Banach space of summable sequence, l¹.This implies that whenever M and N are Riemann surfaces thatare not analytically finite, and in particular are not necessarilyhomeomorphic, then A¹(M) is isomorphic to A¹(N). It is knownfrom V. Markovic that if there is a linear isometry betweenA¹(M) and A¹(N), for two Riemann surfaces M and N of non-exceptionaltype, then this isometry is induced by a conformal mapping betweenM and N. As a corollary to this rigidity theorem presented here,taking the Banach duals of A¹(M) and l¹ shows that the spaceof holomorphic quadratic differentials on M, Q(M), is isomorphicto the Banach space of bounded sequences, l. As a consequenceof this theorem and the Bers embedding, the Teichmüllerspaces of such Riemann surfaces are locally bi-Lipschitz equivalent.     

A Fast Galerkin Algorithm for Singular Integral Equations

A recent paper (Delves, 1977) described a variant of the Galerkinmethod for linear Fredholm integral equations of the secondkind with smooth kernels, for which the total solution timeusing N expansion functions is (N² ln N) compared with the standardGalerkin count of (N³). We describe here a modification of thismethod which retains this operations count and which is applicableto weakly singular Fredholm equations of the form where K₀(x, y) is a smooth kernel and Q contains a known singularity.Particular cases treated in detail include Fredholm equationswith Green's function kernels, or with kernels having logarithmicsingularities; and linear Volterra equations with either regularkernels or of Abel type. The case when g(x) and/or f(x) containsa known singularity is also treated. The method described yieldsboth a priori and a posteriori error estimates which are cheapto compute; for smooth kernels (Q = 1) it yields a modifiedform of the algorithm described in Delves (1977) with the advantagethat the iterative scheme required to solve the equations in(N²) operations is rather simpler than that given there.     

A Fast Method for the Solution of Fredholm Integral Equations

Methods described to date for the solution of linear Fredholmintegral equations have a computing time requirement of O(N³),where N is the number of expansion functions or discretizationpoints used. We describe here a Tchebychev expansion method,based on the FFT, which reduces this time to O(N² ln N), andreport some comparative timings obtained with it. We give alsoboth a priori and a posteriori error estimates which are cheapto compute, and which appear more reliable than those used previously.     

Connected Sums of 4-Manifolds as Codimension-k Fibrators

The main result provides mild conditions under which a closed,orientable, PL 4-manifold N = N₁#N₂ with ₁(N_e) residually finite(e=1,2) is a codimension-5 PL fibrator. The paper also presentsa rich variety of conditions on a closed 4-manifold N⁴ underwhich every PL map between manifolds, where the domain is orientableand all point inverses are copies of N⁴, must be an approximatefibration.     

Error estimates for the approximate solutions of a nonlinear hyperbolic equation given by finite volume schemes

This paper is devoted to the study of an error estimate of thefinite volume, approximation to the solution u L(R_N x R) ofthe equation u_t + div(Vf(u)) = 0, where v is a vector functiondepending on time and space. A 'h' error estimate for an initialvalue in BV(R^N) is shown for a large variety of finite volumemonotonous flux schemes, with an explicit or implicit time discretization.For this purpose, the error estimate is given for the generalsetting of approximate entropy solutions, where the error isexpressed in terms of measures in R^N and R^N x R. The study ofthe implicit schemes involves the study of the existence anduniqueness of the approximate solution. The cases where an 'h'error estimate can be achieved are also discussed.     

A Factorization-Related Method for Elliptic Partial Differential Equations with Iterative Improvement

We consider a method for solving elliptic boundary-value problems.The method arises from a finite-difference discretization whichhas one form in the interior region, but is modified near theboundary. This permits the problem to be solved in terms ofsparse upper and lower triangular matrices. The result of thisdirect method is then improved by an iterative technique, whichis further enhanced by a multigrid-type process. For the type of problems we consider here, the total combinedmethod requires only O(N²) time and O(N²) space to compute thesolution of a system of N x N mesh points to good accuracy.The method is applied to a case where normal discretizationleads to a matrix that is not positive definite.     

Linear Independence of Hecke Operators in the Homology of X0(N)

In Merel's recent proof [7] of the uniform boundedness conjecturefor the torsion of elliptic curves over number fields, a keystep is to show that for sufficiently large primes N, the Heckeoperators T₁, T₂, ..., T_D are linearly independent in theiractions on the cycle e from 0 to i in H₁(X₀(N) (C), Q). In particular,he shows independence when max(D⁸, 400D⁴) < N/(log N)⁴. Inthis paper we use analytic techniques to show that one can chooseD considerably larger than this, provided that N is large.     

A Criterion for Finite Topological Determinacy of Map-Germs

Let f, g: (Rⁿ, 0) (R^p, 0) be two C map-germs. Then f and gare C⁰-equivalent if there exist homeomorphism-germs h and lof (Rⁿ, 0) and (R^p, 0) respectively such that g = l f h^–1.Let k be a positive integer. A germ f is k-C⁰-determined ifevery germ g with j^k g(0) = j^k f(0) is C⁰-equivalent to f. Moreover,we say that f is finitely topologically determined if f is k-C⁰-determinedfor some finite k. We prove a theorem giving a sufficient conditionfor a germ to be finitely topologically determined. We explainthis condition below. Let N and P be two C manifolds. Consider the jet bundle J^k(N,P) with fiber J^k(n, p). Let z in J^k(n, p) and let f be suchthat z = j^kf(0). Define Whether (f) < k depends only on z, not on f. We can thereforedefine the set Let W^k(N, P) be the subbundle of J^k(N, P) with fiber W^k(n, p).Mather has constructed a finite Whitney (b)-regular stratificationS^k(n, p) of J^k(n, p) – W^k(n, p) such that all strata aresemialgebraic and K-invariant, having the property that if S^k(N,P) denotes the corresponding stratification of J^k(N, P) –W^k(N, P) and f C(N, P) is a C map such that j^kf is multitransverseto S^k(N, P), j^kf(N) W^k(N, P) = and N is compact (or f is proper),then f is topologically stable. For a map-germ f: (Rⁿ, 0) (R^p, 0), we define a certain ojasiewiczinequality. The inequality implies that there exists a representativef: U R^p such that j^kf(U – 0) W^k (Rⁿ, R^p = and suchthat j^kf is multitransverse to S^k (Rⁿ, R^p) at any finite setof points S U – 0. Moreover, the inequality controlsthe rate j^kf becomes non-transverse as we approach 0. We showthat if f satisfies this inequality, then f is finitely topologicallydetermined. 1991 Mathematics Subject Classification: 58C27.     

A Fast Implementation of the Global Element Method

A straightforward implementation of the Global Element Method(Delves & Hall, 1979) for two-dimensional partial differentialequations has an operation count: Set up equations: (MN⁶); solve: (M³N⁶) where M is the number of elements and N the number of one-dimensionalexpansion functions used in each element. We describe here analternative implementation in which both of these counts arereduced to (MN⁴). The method used generalizes to p dimensions, with operationcount (MN^2p) compared with the "standard" count (MP^3p + M³N^3p).     

Sharp Results Concerning the Expression of Functions as Sums of Finite Differences

Let * denote convolution and let _x denote the Dirac measureat a point x. A function in L²(R)) is called a difference oforder 1 if it is of the form g-_x * g for some x R and g L²(R)).Also, a difference of order 2 is a function of the form for some x R and g L²(R)). In fact,the concept of a ‘difference of order s’ may bedefined in a similar manner for each s 0. If f denotes the Fouriertransform of f, it is known that a function f in L²(R)) is afinite sum of differences of order s if and only if , and the vector space of all suchfunctions is denoted by D_s (L²(R)). Every function in D_s (L²(R))is a sum of int(2s) + 1 differences of order s, where int(t)denotes the integer part of t. Thus, every function in D₁ (L²(R))is a sum of three first order differences, but it was provedin 1994 that there is a function in D₁ (L(R)) which is neverthe sum of two first order differences. This complemented, forthe group R, the corresponding result for first order differencesobtained by Meisters and Schmidt in 1972 for the circle group.The results show that there is a function in L₂ R such that,for each s 1/2, this function is a sum of int (2s) + 1 differencesof order s but it is never the sum of int (2s) differences oforder s. The proof depends upon extending to higher dimensionsthe following result in two dimensions obtained by Schmidt in1972 in connection with Heilbronn's problem: if x₁, x__n arepoints in the unit square, Following on from the work of Meisters and Schmidt, this workfurther develops a connection between certain estimates in combinatorialgeometry and some questions of sharpness in harmonic analysis.2000 Mathematics Subject Classification 42A38 (primary), 52A40(secondary).     

Numerical analysis of subspace-breaking Takens-Bogdanov points

It is assumed that a two-parameter-dependent family of smoothvector fields on R^N leaves a proper subspace u of R^N invariant.Takens-Bogdanov bifurcation points on u are considered. Computationof these points together with their computer-aided asymptoticanalysis are discussed. The asymptotic formulae are appliedas analytical predictors of, for example, Hopf bifurcation pointsthat emanate from a detected Takens-Bogdanov point. Anotherapplication is a local stability analysis of imperfect bifurcationdiagrams.     

On the Existence of Extremals for the Sobolev Trace Embedding Theorem with Critical Exponent

In this paper, the existence problem is studied for extremalsof the Sobolev trace inequality W^1,p()L^p*(), where is a boundedsmooth domain in R^N, p*=p(N–1)/(N–p), is the criticalSobolev exponent, and 1 < p < N. 2000 Mathematics SubjectClassification 35J65 (primary), 35B33 (secondary).     

On the Least Q-order of Convergence of Variable Metric Algorithms

It is shown in this paper that the infimum of the Q-order ofthe convergence of variable metric algorithms is only 1, eventhough the objective function is twice continuously differentiableand uniformly convex. It is shown by example that the Q-ordercan be 1 + 1/N for any large N, though the R-order is (1+N)^1/2.     

Fast evaluation of polyharmonic splines in three dimensions

M. J. D. Powell ^{This paper concerns the fast evaluation of radial basis functions.It describes the mathematics of hierarchical and fast multipolemethods for fast evaluation of splines of the form where is a positive integer andp is a low-degree polynomial. Splines s of this form are polyharmonicsplines in 3 and have been found to be very useful for providingsolutions to scattered data interpolation problems in 3. Asit is now well known, hierarchical methods reduce the incrementalcost of a single extra evaluation from O(N) to O(log N) operationsand reduce the cost of a matrix–vector product (evaluationof s at all the centres) from O(N2) to O(N log N) operations.We give appropriate far- and near-field expansions, togetherwith error estimates, uniqueness theorems and translation formulae.A hierarchical code based on these formulae is detailed andsome numerical results are given.}     

On the Greatest Prime Divisor of the Sum of Two Squares of Primes

One of the most famous theorems in number theory states thatthere are infinitely many positive prime numbers (namely p =2 and the primes p 1 mod4) that can be represented in the formx²₁+x²₂, where x₁ and x₂ are positive integers. In a recentpaper, Fouvry and Iwaniec [2] have shown that this statementremains valid even if one of the variables, say x₂, is restrictedto prime values only. In the sequel, the letter p, possiblywith an index, is reserved to denote a positive prime number.As p²₁=p²₂ = p is even for p₁, p₂ > 2, it is reasonable toconjecture that the equation p²₁=p²₂ = 2p has an infinity ofsolutions. However, a proof of this statement currently seemsfar beyond reach. As an intermediate step in this direction,one may quantify the problem by asking what can be said aboutlower bounds for the greatest prime divisor, say P(N), of thenumbers p²₁=p²₂, where p₁, p₂ N, as a function of the realparameter N 1. The well-known Chebychev–Hooley methodcombined with the Barban–Davenport–Halberstam theoremalmost immediately leads to the bound P(N) N^1–, if N N_o(); here, denotes some arbitrarily small fixed positivereal number. The first estimate going beyond the exponent 1has been achieved recently by Dartyge [1, Théorème1], who showed that P(N) N^10/9–. Note that Dartyge'sproof provides the more general result that for any irreduciblebinary form f of degree d 2 with integer coefficients the greatestprime divisor of the numbers |f(p₁, p₂)|, p₁, p₂ N, exceedsN^_d–, where _d = 2 – 8/(d = 7). We in particular wantto point out that Dartyge does not make use of the specificfeatures provided by the form x²₁+x²₂. By taking advantage ofsome special properties of this binary form, we are able toimprove upon the exponent ₂ = 10/9 considerably.     

A Classification of Horizontally Homothetic Submersions from Space Forms of Nonnegative Curvature

In this paper, it is proved that for n 2, any horizontallyhomothetic submersion : Rⁿ⁺¹ (Nⁿ, h) is a Riemannian submersionup to a homothety. It is also shown that if : Sⁿ⁺¹ (Nⁿ, h)is a horizontally homothetic submersion, then n = 2m, (Nⁿ, h)is isometric to CP^m and, up to a homothety, is a standard Hopffibration S^2m+1 CP^m. 2000 Mathematics Subject Classification53C20, 53C12.