A nonconforming combination of the finite element and volume methods with an anisotropic mesh refinement for a singularly perturbed convection-diffusion equation

In this paper we formulate and analyze a discretization method for a 2D linear singularly perturbed convection-diffusion problem with a singular perturbation parameter . The method is based on a nonconforming combination of the conventional Galerkin piecewise linear triangular finite element method and an exponentially fitted finite volume method, and on a mixture of triangular and rectangular elements. It is shown that the method is stable with respect to a semi-discrete energy norm and the approximation error in the semi-discrete energy norm is bounded by with independent of the mesh parameter , the diffusion coefficient and the exact solution of the problem.

     

Elliptic curves with nonsplit mod representations

We calculate explicitly the -invariants of the elliptic curves corresponding to rational points on the modular curve by giving an expression defined over of the -function in terms of the function field generators and of the elliptic curve . As a result we exhibit infinitely many elliptic curves over with nonsplit mod representations.

     

Strong tractability of multivariate integration using quasi-Monte Carlo algorithms

We study quasi-Monte Carlo algorithms based on low discrepancy sequences for multivariate integration. We consider the problem of how the minimal number of function evaluations needed to reduce the worst-case error from its initial error by a factor of depends on and the dimension . Strong tractability means that it does not depend on and is bounded by a polynomial in . The least possible value of the power of is called the -exponent of strong tractability. Sloan and Wozniakowski established a necessary and sufficient condition of strong tractability in weighted Sobolev spaces, and showed that the -exponent of strong tractability is between 1 and 2. However, their proof is not constructive.

In this paper we prove in a constructive way that multivariate integration in some weighted Sobolev spaces is strongly tractable with -exponent equal to 1, which is the best possible value under a stronger assumption than Sloan and Wozniakowski's assumption. We show that quasi-Monte Carlo algorithms using Niederreiter's -sequences and Sobol sequences achieve the optimal convergence order for any 0$"> independent of the dimension with a worst case deterministic guarantee (where is the number of function evaluations). This implies that strong tractability with the best -exponent can be achieved in appropriate weighted Sobolev spaces by using Niederreiter's -sequences and Sobol sequences.

     

A sensitive algorithm for detecting the inequivalence of Hadamard matrices

A Hadamard matrix of side is an matrix with every entry either or , which satisfies . Two Hadamard matrices are called equivalent if one can be obtained from the other by some sequence of row and column permutations and negations. To identify the equivalence of two Hadamard matrices by a complete search is known to be an NP hard problem when increases. In this paper, a new algorithm for detecting inequivalence of two Hadamard matrices is proposed, which is more sensitive than those known in the literature and which has a close relation with several measures of uniformity. As an application, we apply the new algorithm to verify the inequivalence of the known inequivalent Hadamard matrices of order ; furthermore, we show that there are at least pairwise inequivalent Hadamard matrices of order . The latter is a new discovery.

     

An estimate for the number of integers without large prime factors

denotes the number of positive integers and free of prime factors y$">. Hildebrand and Tenenbaum provided a good approximation of . However, their method requires the solution to the equation , and therefore it needs a large amount of time for the numerical solution of the above equation for large . Hildebrand also showed approximates for , where and is the unique solution to . Let be defined by for 0$">. We show approximates , and also approximates , where . Using these approximations, we give a simple method which approximates within a factor in the range , where is any positive constant.

     

Bounds for computing the tame kernel

The tame kernel of the of a number field  is the kernel of some explicit map , where the product runs over all finite primes  of  and is the residue class field at . When is a set of primes of , containing the infinite ones, we can consider the -unit group  of . Then has a natural image in . The tame kernel is contained in this image if  contains all finite primes of  up to some bound. This is a theorem due to Bass and Tate. An explicit bound for imaginary quadratic fields was given by Browkin. In this article we give a bound, valid for any number field, that is smaller than Browkin's bound in the imaginary quadratic case and has better asymptotics. A simplified version of this bound says that we only have to include in  all primes with norm up to  , where  is the discriminant of . Using this bound, one can find explicit generators for the tame kernel, and a ``long enough' search would also yield all relations. Unfortunately, we have no explicit formula to describe what ``long enough' means. However, using theorems from Keune, we can show that the tame kernel is computable.

     

The convergence of harmonic Ritz values, harmonic Ritz vectors, and refined harmonic Ritz vectors

This paper concerns a harmonic projection method for computing an approximation to an eigenpair of a large matrix . Given a target point and a subspace that contains an approximation to , the harmonic projection method returns an approximation to . Three convergence results are established as the deviation of from approaches zero. First, the harmonic Ritz value converges to if a certain Rayleigh quotient matrix is uniformly nonsingular. Second, the harmonic Ritz vector converges to if the Rayleigh quotient matrix is uniformly nonsingular and remains well separated from the other harmonic Ritz values. Third, better error bounds for the convergence of are derived when converges. However, we show that the harmonic projection method can fail to find the desired eigenvalue --in other words, the method can miss if it is very close to . To this end, we propose to compute the Rayleigh quotient of with respect to and take it as a new approximate eigenvalue. is shown to converge to once tends to , no matter how is close to . Finally, we show that if the Rayleigh quotient matrix is uniformly nonsingular, then the refined harmonic Ritz vector, or more generally the refined eigenvector approximation introduced by the author, converges. We construct examples to illustrate our theory.

     

Recurrence relations and convergence theory of the generalized polar decomposition on Lie groups

The subject matter of this paper is the analysis of some issues related to generalized polar decompositions on Lie groups. This decomposition, depending on an involutive automorphism , is equivalent to a factorization of , being a Lie group, as with and , and was recently discussed by Munthe-Kaas, Quispel and Zanna together with its many applications to numerical analysis. It turns out that, contrary to , an analysis of is a very complicated task. In this paper we derive the series expansion for , obtaining an explicit recurrence relation that completely defines the function in terms of projections on a Lie triple system and a subalgebra of the Lie algebra , and obtain bounds on its region of analyticity. The results presented in this paper have direct application, among others, to linear algebra, integration of differential equations and approximation of the exponential.

     

Class numbers of imaginary quadratic fields

The classical class number problem of Gauss asks for a classification of all imaginary quadratic fields with a given class number . The first complete results were for by Heegner, Baker, and Stark. After the work of Goldfeld and Gross-Zagier, the task was a finite decision problem for any . Indeed, after Oesterlé handled , in 1985 Serre wrote, ``No doubt the same method will work for other small class numbers, up to 100, say.' However, more than ten years later, after doing , Wagner remarked that the case seemed impregnable. We complete the classification for all , an improvement of four powers of 2 (arguably the most difficult case) over the previous best results. The main theoretical technique is a modification of the Goldfeld-Oesterlé work, which used an elliptic curve -function with an order 3 zero at the central critical point, to instead consider Dirichlet -functions with low-height zeros near the real line (though the former is still required in our proof). This is numerically much superior to the previous method, which relied on work of Montgomery-Weinberger. Our method is still quite computer-intensive, but we are able to keep the time needed for the computation down to about seven months. In all cases, we find that there is no abnormally large ``exceptional modulus' of small class number, which agrees with the prediction of the Generalised Riemann Hypothesis.

     

Computation of relative class numbers of CM-fields by using Hecke -functions

We develop an efficient technique for computing values at of Hecke -functions. We apply this technique to the computation of relative class numbers of non-abelian CM-fields which are abelian extensions of some totally real subfield . We note that the smaller the degree of the more efficient our technique is. In particular, our technique is very efficient whenever instead of simply choosing (the maximal totally real subfield of ) we can choose real quadratic. We finally give examples of computations of relative class numbers of several dihedral CM-fields of large degrees and of several quaternion octic CM-fields with large discriminants.

     

The hyperdeterminant and triangulations of the 4-cube

The hyperdeterminant of format is a polynomial of degree in unknowns which has terms. We compute the Newton polytope of this polynomial and the secondary polytope of the -cube. The regular triangulations of the -cube are classified into -equivalence classes, one for each vertex of the Newton polytope. The -cube has coarsest regular subdivisions, one for each facet of the secondary polytope, but only of them come from the hyperdeterminant.

     

Some new kinds of pseudoprimes

We define some new kinds of pseudoprimes to several bases, which generalize strong pseudoprimes. We call them Sylow -pseudoprimes and elementary Abelian -pseudoprimes. It turns out that every which is a strong pseudoprime to bases 2, 3 and 5, is not a Sylow -pseudoprime to two of these bases for an appropriate prime

We also give examples of strong pseudoprimes to many bases which are not Sylow -pseudoprimes to two bases only, where or

     

The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension

Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problems of mathematical finance. This paper considers quasi-Monte Carlo integration algorithms for weighted classes of functions of infinitely many variables, in which the dependence of functions on successive variables is increasingly limited. The dependence is modeled by a sequence of weights. The integrands belong to rather general reproducing kernel Hilbert spaces that can be decomposed as the direct sum of a series of their subspaces, each subspace containing functions of only a finite number of variables. The theory of reproducing kernels is used to derive a quadrature error bound, which is the product of two terms: the generalized discrepancy and the generalized variation.

Tractability means that the minimal number of function evaluations needed to reduce the initial integration error by a factor is bounded by for some exponent and some positive constant . The -exponent of tractability is defined as the smallest power of in these bounds. It is shown by using Monte Carlo quadrature that the -exponent is no greater than 2 for these weighted classes of integrands. Under a somewhat stronger assumption on the weights and for a popular choice of the reproducing kernel it is shown constructively using the Halton sequence that the -exponent of tractability is 1, which implies that infinite dimensional integration is no harder than one-dimensional integration.

     

Biquadratic reciprocity and a Lucasian primality test

Let be the sequence defined from a given initial value, the seed, , by the recurrence . Then, for a suitable seed , the number (where is odd) is prime iff . In general depends both on and on . We describe a slight modification of this test which determines primality of numbers with a seed which depends only on , provided . In particular, when , odd, we have a test with a single seed depending only on , in contrast with the unmodified test, which, as proved by W. Bosma in Explicit primality criteria for , Math. Comp. 61 (1993), 97-109, needs infinitely many seeds. The proof of validity uses biquadratic reciprocity.

     

Real zeros of real odd Dirichlet -functions

Let be a real odd Dirichlet character of modulus , and let be the associated Dirichlet -function. As a consequence of the work of Low and Purdy, it is known that if and , , , then has no positive real zeros. By a simple extension of their ideas and the advantage of thirty years of advances in computational power, we are able to prove that if , then has no positive real zeros.

     

Chebyshev's bias for composite numbers with restricted prime divisors

Let denote the number of primes with . Chebyshev's bias is the phenomenon for which ``more often' \pi(x;d,r)$">, than the other way around, where is a quadratic nonresidue mod and is a quadratic residue mod . If for every up to some large number, then one expects that for every . Here denotes the number of integers such that every prime divisor of satisfies . In this paper we develop some tools to deal with this type of problem and apply them to show that, for example, for every .

In the process we express the so-called second order Landau-Ramanujan constant as an infinite series and show that the same type of formula holds for a much larger class of constants.

     

The probability that a slightly perturbed numerical analysis problem is difficult

We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs. Several applications to linear and polynomial equation solving show that the estimates obtained in this way are easy to derive and quite accurate. The main theorem is based on a volume estimate of -tubular neighborhoods around a real algebraic subvariety of a sphere, intersected with a spherical disk of radius . Besides and , this bound depends only on the dimension of the sphere and on the degree of the defining equations.

     

Sequential and parallel synchronous alternating iterative methods

The so-called parallel multisplitting nonstationary iterative Model A was introduced by Bru, Elsner, and Neumann [Linear Algebra and its Applications 103:175-192 (1988)] for solving a nonsingular linear system using a weak nonnegative multisplitting of the first type. In this paper new results are introduced when is a monotone matrix using a weak nonnegative multisplitting of the second type and when is a symmetric positive definite matrix using a -regular multisplitting. Also, nonstationary alternating iterative methods are studied. Finally, combining Model A and alternating iterative methods, two new models of parallel multisplitting nonstationary iterations are introduced. When matrix is monotone and the multisplittings are weak nonnegative of the first or of the second type, both models lead to convergent schemes. Also, when matrix is symmetric positive definite and the multisplittings are -regular, the schemes are also convergent.

     

Constructing representations of higher degrees of finite simple groups and covers

Let be a finite group and an irreducible character of . A simple method for constructing a representation affording can be used whenever has a subgroup such that has a linear constituent with multiplicity 1. In this paper we show that (with a few exceptions) if is a simple group or a covering group of a simple group and is an irreducible character of of degree between 32 and 100, then such a subgroup exists.