Computing border bases

This paper presents several algorithms that compute border bases of a zero-dimensional ideal. The first relates to the FGLM algorithm as it uses a linear basis transformation. In particular, it is able to compute border bases that do not contain a reduced Gröbner basis. The second algorithm is based on a generic algorithm by Bernard Mourrain originally designed for computing an ideal basis that need not be a border basis. Our fully detailed algorithm computes a border basis of a zero-dimensional ideal from a given set of generators. To obtain concrete instructions we appeal to a degree-compatible term ordering σ and hence compute a border basis that contains the reduced σ-Gröbner basis. We show an example in which this computation actually has advantages over Buchberger's algorithm. Moreover, we formulate and prove two optimizations of the Border Basis Algorithm which reduce the dimensions of the linear algebra subproblems.     

Wavelet sparse approximate inverse preconditioners

We show how to use wavelet compression ideas to improve the performance of approximate inverse preconditioners. Our main idea is to first transform the inverse of the coefficient matrix into a wavelet basis, before applying standard approximate inverse techniques. In this process, smoothness in the entries ofA ⁻¹ are converted into small wavelet coefficients, thus allowing a more efficient approximate inverse approximation. We shall justify theoretically and numerically that our approach is effective for matrices with smooth inverses. Supported by grants from ONR: ONR-N00014-92-J-1890, and the Army Research Office: DAAL-03-91-C-0047 (Univ. of Tenn. subcontract ORA4466.04 Amendment 1 and 2). The first and the third author also acknowledge support from RIACS/NASA Ames NAS 2-96027 and the Alfred P. Sloan Foundation as Doctoral Dissertation Fellows, respectively. the work was supported by the Natural Sciences and Engineering Research Council of Canada, the Information Technology Research Centre (which is funded by the Province of Ontario), and RIACS/NASA Ames NAS 2-96027.     

High performance solution of the complex symmetric eigenproblem

Complex symmetric matrices often appear in quantum physics in the solution methods of partial differential equations such as the Schrödinger equation. We have recently introduced a new fast and efficient direct eigensolver for this problem in [4], and reported its performance in the eigenvalue calculation in [3]. In this paper, we further report on some benchmark tests for computing the full and partial eigenspectrum on a variety of super computing machines, i.e., the Cray J-932, the DEC Alfa 8400, and the SGI Power Challenge 8000 and 10000. We observe that in all cases the new algorithm is much faster than codes available in standard state of the art eigensolver packages such as LAPACK.     

Parallel implementation of the p‐version of the finite element method for elliptic equations on a shared‐memory architecture

An implementation of the p‐version of the finite element method for solving two‐dimensional linear elliptic problems on a shared‐memory parallel computer is analyzed. The idea is to partition the problem among the available processors and perform computations corresponding to different elements in parallel. The parallelization is based on a domain decomposition technique using the Lagrange multipliers. The numerical experiments carried out on the Sequent system indicate very high performance of the mixed finite element algorithm in terms of attained speedups. This revised version was published online in August 2006 with corrections to the Cover Date.     

丙酮+环己烷+甲醇组成的最低共沸混合物热力学性质的研究

Mesoporous molecular sieves Al-MSU-S has been prepared from the precursor of zeolite Y using ionic liquids 1-hexadecane-3-methylimidazolium bromide （CMIMB） as a template in basic medium, which exhibited larger pore diameter, pore volume and surface area than that synthesized using cetyl trimethyl ammonium bromide （CTAB） template.     

态|Ψ(3)〉q中广义磁场的不等幂次高次振幅压缩

利用多模压缩态理论,研究了一种新型的三态叠加多模叠加态光场|Ψ⁽³⁾〉_q中广义磁场分量(即第一正交相位分量)的不等幂次高次振幅压缩特性.结果表明:态|Ψ⁽³⁾〉_q是一种典型的三态叠加多模非经典光场,其广义磁场分量在一定条件下可呈现出周期性变化的、偶数次的不等幂次高次振幅压缩效应.     

Methods for parallel integration of stiff systems of odes

This paper presents a class of parallel numerical integration methods for stiff systems of ordinary differential equations which can be partitioned into loosely coupled sub-systems. The formulas are called decoupled backward differentiation formulas, and they are derived from the classical formulas by restricting the implicit part to the diagnonal sub-system. With one or several sub-systems allocated to each processor, information only has to be exchanged after completion of a step but not during the solution of the nonlinear algebraic equations.The main emphasis is on the formula of order 1, the decoupled implicit Euler formula. It is proved that this formula even for a wide range of multirate formulations has an asymptotic global error expansion permitting extrapolation. Besides, sufficient conditions for absolute stability are presented.