A posteriori error estimation with finite element methods of lines for one-dimensional parabolic systems

Summary Consider the solution of one-dimensional linear initial-boundary value problems by a finite element method of lines using a piecewiseP ^th -degree polynomial basis. A posteriori estimates of the discretization error are obtained as the solutions of either local parabolic or local elliptic finite element problems using piecewise polynomial corrections of degreep+1 that vanish at element ends. Error estimates computed in this manner are shown to converge in energy under mesh refinement to the exact finite element discretization error. Computational results indicate that the error estimates are robust over a wide range of mesh spacings and polynomial degrees and are, furthermore, applicable in situations that are not supported by the analysis.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 90-0194; by the U.S. Army Research Office under Contract Number DAAL03-91-G-0215; and by the National Science Foundation under Institutional Infrastructure Grant Number CDA-8805910     

Optimal tristance anticodes in certain graphs

For z₁,z₂,z₃∈Zⁿ, the tristance d₃(z₁,z₂,z₃) is a generalization of the L₁-distance on Zⁿ to a quantity that reflects the relative dispersion of three points rather than two. A tristance anticodeA_d of diameter d is a subset of Zⁿ with the property that d₃(z₁,z₂,z₃)?d for all z₁,z₂,z₃∈A_d. An anticode is optimal if it has the largest possible cardinality for its diameter d. We determine the cardinality and completely classify the optimal tristance anticodes in Z² for all diameters d?1. We then generalize this result to two related distance models: a different distance structure on Z² where d(z₁,z₂)=1 if z₁,z₂ are adjacent either horizontally, vertically, or diagonally, and the distance structure obtained when Z² is replaced by the hexagonal lattice A₂. We also investigate optimal tristance anticodes in Z³ and optimal quadristance anticodes in Z², and provide bounds on their cardinality. We conclude with a brief discussion of the applications of our results to multi-dimensional interleaving schemes and to connectivity loci in the game of Go.     

镧系金属一氢化物有效芯势研究

采用Cundari和Stevens等推导的有效芯势对镧系金属一氢化物进行了理论计算，以探讨镧系金属元素与氢的相互作用。结果表明所有镧系金属一氢化物基态时理论上是稳定的，最稳定的是SmH,最不稳定的是DyH;键长计算结果显示，基态时镧系金属一招兵买马花物有独立王国 收缩现象发生；红外振动频率理论计算值与实验结果一致；成键轨道中，金属原子轨道的贡献主要是s轨道和d轨道：从CeH至ErH(GdH)例外）随着外层电子的增加s轨道成分逐渐增大d轨道成分逐渐减小；从TmH和LuH（包括GdH)，成键轨道中金属原子轨道的贡献主要是d轨道，约为90％；约大多数镧系金属一氧化物的成键轨道中金属原子轨道f成分小于1％。     

Absolutely indecomposable symmetric matrices

Let A be a symmetric matrix of size n×n with entries in some (commutative) field K. We study the possibility of decomposing A into two blocks by conjugation by an orthogonal matrix T∈Mat_n(K). We say that A is absolutely indecomposable if it is indecomposable over every extension of the base field. If K is formally real then every symmetric matrix A diagonalizes orthogonally over the real closure of K. Assume that K is a not formally real and of level s. We prove that in Mat_n(K) there exist symmetric, absolutely indecomposable matrices iff n is congruent to 0, 1 or −1 modulo 2s.     

理论研究C8H80-（H2O）n（n=1～5）团簇

应用密度泛函B3LYP／6—31＋G（d，p）方法对C8H80-（H2O）n（n=1～5）团簇这种弱相互作用体系进行垒自由度能量梯度优化，得到该系列团簇的稳定蛄构．计算结果表明。在该系列二元团簇中，一方面水分子数目的多少对苯基丙酮分子的结构影响很小，另一方面由于苯基丙酮分子的存在，破坏了团簇中水分子的对称性结构，在团簇内部极力形成O—H—O这样弯曲的有方向性的氢键．对苯基丙酮-水这样结构复杂的团簇，指认光谱的难度非常大，本文只讨论了与C=O有关的振动峰和水分子的对称伸缩振动的最强峰．     

On the realization of Riemannian symmetric spaces in Lie groups

In this paper we give a realization of some symmetric space G/K as a closed submanifold P of G. We also give several equivalent representations of the submanifold P. Some properties of the set gK∩P are also discussed, where gK is a coset space in G.     

New examples of Osserman metrics with nondiagonalizable Jacobi operators

Explicit examples of Osserman 4-manifolds with exactly two distinct eigenvalues of the Jacobi operators, α and β=4α≠0, are given. The former has multiplicity two and is a double root of the minimal polynomial of the Jacobi operators.