Well‐balanced finite difference weighted essentially non‐oscillatory schemes for the blood flow model

The blood flow model maintains the steady‐state solutions, in which the flux gradients are non‐zero but exactly balanced by the source term. In this paper, we design high order finite difference weighted essentially non‐oscillatory (WENO) schemes to this model with such well‐balanced property and at the same time keeping genuine high order accuracy. Rigorous theoretical analysis as well as extensive numerical results all indicate that the resulting schemes verify high order accuracy, maintain the well‐balanced property, and keep good resolution for smooth and discontinuous solutions. Copyright © 2016 John Wiley & Sons, Ltd.     

Efficient evaluation of Coulomb integrals in a mixed Gaussian and plane‐wave basis

An efficient way of calculation is presented for matrix elements between two plane waves interacting with a molecular Coulombic field. In concurrence with the absolute value of the momentum transfer vector, K = k₁ ? k ₂ , the most effective method of calculation is selected. The case of K = 0 requires special treatment. For 0 < |K| ≤ 0.3, it is profitable to evaluate the integrals by means of the multipole expansion, and for |K| > 0.3 the density fitting can be applied. For the large |K| the electronic part of the integral is much smaller than the nuclear part and the integral may be approximated by the nuclear contribution only. Some examples for testing the accuracy and time saved are presented. The primary purpose of this paper is to accelerate electron scattering calculations, but it also may be profitable for the electronic structure theory in attempts to use mixed Gaussian and plane‐wave basis sets. © 2006 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

EXPLICIT BOUNDS OF EIGENVALUES FOR STIFFNESS MATRICES BY QUADRATIC HIERARCHICAL BASIS METHOD)

The bounds for the eigenvalues of the stiffness matrices in the finite element discretiza-tion corresponding to Lu:=-u″with zero boundary conditions by quadratic hierarchical basic are shown explicitly.The condition numberof the resulting system behaves like O(1/h)where h is the mesh size.We also analyze a main diagonal preconditioner of the stiffness matrix which reduces the condition number of the preconditioned system to O(1).     

An algorithm for mixed integer optimization

This paper introduces a new algorithm for solving mixed integer programs. The core of the method is an iterative technique for changing the representation of the original mixed integer optimization problem. Supported by grants FKZ 0037KD0099 and FKZ 2495A/0028G of the Kultusministerium of Sachsen-Anhalt.Supported by a Gerhard-Hess-Preis and grant WE 1462 of the Deutsche Forschungsgemeinschaft, and by the European DONET program TMR ERB FMRX-CT98-0202.Mathematics Subject Classification (1991):90C11     

The Uniformity of Non-Uniform Gabor Bases

There have been extensive studies on non-uniform Gabor bases and frames in recent years. But interestingly there have not been a single example of a compactly supported orthonormal Gabor basis in which either the frequency set or the translation set is non-uniform. Nor has there been an example in which the modulus of the generating function is not a characteristic function of a set. In this paper, we prove that in the one dimension and if we assume that the generating function g(x) of an orthonormal Gabor basis is supported on an interval, then both the frequency and the translation sets of the Gabor basis must be lattices. In fact, the Gabor basis must be the trivial one in the sense that |g(x)|=c(x) for some fundamental interval of the translation set. We also give examples showing that compactly supported non-uniform orthonormal Gabor bases exist in higher dimensions.     

Short rational generating functions for lattice point problems

We prove that for any fixed the generating function of the projection of the set of integer points in a rational -dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice points, notably integer semigroups and (minimal) Hilbert bases of rational cones, have short rational generating functions provided certain parameters (the dimension and the number of generators) are fixed. It follows then that many computational problems for such sets (for example, finding the number of positive integers not representable as a non-negative integer combination of given coprime positive integers ) admit polynomial time algorithms. We also discuss a related problem of computing the Hilbert series of a ring generated by monomials.

     

The minimum number of acute dihedral angles of a simplex

For any -dimensional simplex , we confirm a conjecture of Klamkin and Pook (1988) that there are always at least acute dihedral angles in .

     

The Basis Number of Some Special Non-Planar Graphs

The basis number of a graph G was defined by Schmeichel to be the least integer h such that G has an h-fold basis for its cycle space. He proved that for m, n 5, the basis number b(K _m,n ) of the complete bipartite graph K _m,n is equal to 4 except for K _6,10, K _5,n and K _6,n with n = 5, 6, 7, 8. We determine the basis number of some particular non-planar graphs such as K _5,n and K _6,n , n = 5, 6, 7, 8, and r-cages for r = 5, 6, 7, 8, and the Robertson graph.     

Partially Well-Ordered Closed Sets of Permutations

It is known that the pattern containment order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially well-ordered, in which case they have a strong finite basis property. Several classes are proved to be partially well-ordered under pattern containment. Conversely, a number of new antichains are exhibited that give some insight as to where the boundary between partially well-ordered and not partially well-ordered classes lies.