Crack growth on the basal plane in single crystal zinc: experiments and computations

Crack propagation on the basal planes in zinc was examined by means of in situ fracture testing of pre-cracked single crystals, with specific attention paid to the fracture mechanism. During quasistatic loading, crack propagation occurred in short bursts of dynamic crack extension followed by periods of arrests, the latter accompanied by plastic deformation and blunting of the crack-tip. In situ observations confirmed nucleation and propagation of microcracks on parallel basal planes and plastic deformation and failure of the linking ligaments. Pre-existing twins in the crack path serve as potent crack arrestors. The crystallographic orientation of the crack growth direction on the basal plane was found to influence both the fracture load as well as the deformation at the crack-tip, producing fracture surfaces of noticeably different appearances. Finite element analysis incorporating crystal plasticity was used to identify dominant slip systems and the stress distribution around the crack-tip in plane stress and plane strain. The computational results are helpful in rationalizing the experimental observations including the mechanism of crack propagation, the orientation dependence of crack-tip plasticity and the fracture surface morphology.     

On nonoscillating integrals for computing inhomogeneous Airy functions

Integral representations are considered of solutions of the inhomogeneous Airy differential equation . The solutions of these equations are also known as Scorer functions. Certain functional relations for these functions are used to confine the discussion to one function and to a certain sector in the complex plane. By using steepest descent methods from asymptotics, the standard integral representations of the Scorer functions are modified in order to obtain nonoscillating integrals for complex values of . In this way stable representations for numerical evaluations of the functions are obtained. The methods are illustrated with numerical results.

     

判定线性偏微分方程组解的完备性的一个符号计算方法

从微分代数的角度出发,借助于吴微分特征集理论,对于线性偏微分方程组,给出了判定它的解的完备性的一个符号计算方法.这个算法是一个机械化的算法,借助于符号计算软件Maple,可以在计算机上实现.     

一种气体低温吸附模型与计算

研究化学氧碘激光器中工作气体氧的低温吸附.考察气体流过沸石多孔床的压力与速度的关系,建立吸附剂吸收的物质量与气流中物质量关系的吸附平衡方程.由吸附物量较少的特点,得出在确定的压力梯度下速度近似为常数.吸附平衡方程与吸附速率方程,构成低温吸附模型方程,其中,亨利等温线方程作为辅助关系.对模型方程做数值求解,得到气流中单态氧浓度及吸收的单态氧浓度随时间变化的规律,及浓度分布的长时间渐近特征.     

从高质量半导体/超导体纳米线到马约拉纳零能模

作为马约拉纳费米子的"凝聚态版本",马约拉纳零能模是当前凝聚态物理领域的研究热点.马约拉纳零能模满足非阿贝尔统计,可以构建受拓扑保护的量子比特.这种由空间上分离的马约拉纳零能模构建的拓扑量子比特不易受局域噪声的干扰,具有长的退相干时间,在容错量子计算中具有重要的应用前景.半导体/超导体纳米线是研究马约拉纳零能模和拓扑量...     

关于完全气体无粘可压流动的解析解

本文导出了一套不定常二、三维完全气体无粘可压流动的代数显式解析解，这些解除在理论上有重要意义外，还可以用来作为检验与发展各种数值解法的标准解．另外，文中还将提出和讨论二维可压等熵流的一个很有意思的疑难．     

A Distributed Architecture for Secure Delegated Quantum Computation

In this paper, we propose a distributed secure delegated quantum computation protocol, by which an almost classical client can delegate a (dk)-qubit quantum circuit to d quantum servers, where each server is equipped with a 2k-qubit register that is used to process only k qubits of the delegated quantum circuit. None of servers can learn any information about the input and output of the computation. The only requirement for the client is that he or she has ability to prepare four possible qubits in the state of (|0〉+eiθ|1〉)/2, where θ∈{0,π/2,π,3π/2}. The only requirement for servers is that each pair of them share some entangled states (|0〉|+〉+|1〉|−〉)/2 as ancillary qubits. Instead of assuming that all servers are interconnected directly by quantum channels, we introduce a third party in our protocol that is designed to distribute the entangled states between those servers. This would simplify the quantum network because the servers do not need to share a quantum channel. In the end, we show that our protocol can guarantee unconditional security of the computation under the situation where all servers, including the third party, are honest-but-curious and allowed to cooperate with each other.     

Exact solutions of nonlinear Schrödinger equation by using symbolic computation

The (G′/G,1/G)‐expansion method and (1/G′)‐expansion method are interesting approaches to find new and more general exact solutions to the nonlinear evolution equations. In this paper, these methods are applied to construct new exact travelling wave solutions of nonlinear Schrödinger equation. The travelling wave solutions are expressed by hyperbolic functions, trigonometric functions and rational functions. It is shown that the proposed methods provide a powerful mathematical tool for solving nonlinear wave equations in mathematical physics and engineering. Copyright © 2015 John Wiley & Sons, Ltd.     

A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS

In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.     

Parallel computation of two-point boundary-value problems via particular solutions

Nonlinear two-point boundary-value problems (TPBVP) can be reduced to the iterative solution of a sequence of linear problems by means of quasilinearization techniques. Therefore, the efficient solution of linear problems is the key to the efficient solution of nonlinear problems.Among the techniques available for solving linear two-point boundary-value problems, the method of particular solutions (MPS) is particularly attractive in that it employs only one differential system, the original nonhomogeneous system, albeit with different initial conditions. This feature of MPS makes it ideally suitable for implementation on parallel computers in that the following requirements are met: the computational effort is subdivided into separate tasks (particular solutions) assigned to the different processors; the tasks have nearly the same size; there is little intercommunication between the tasks.For the TPBVP, the speedup achievable is ofO(n), wheren is the dimension of the state vector, hence relatively modest for the differential systems of interest in trajectory optimization and guidance. This being the case, we transform the TPBVP into a multi-point boundary-value problem (MPBVP) involvingm time subintervals, withm–1 continuity conditions imposed at the interface of contiguous subintervals. For the MPBVP, the speedup achievable is ofO(mn), hence substantially higher than that achievable for the TPBVP. It reduces toO(m) if the parallelism is implemented only in the time domain and not in the state domain.A drawback of the multi-point approach is that it requires the solution of a large linear algebraic system for the constants of the particular solutions. This drawback can be offset by exploiting the particular nature of the interface conditions: if the vector of constants for the first subinterval is known, the vector of constants for the subsequent subintervals can be obtained with linear transformations. Using decomposition techniques together with the discrete version of MPS, the size of the linear algebraic system for the multi-point case becomes the same as that for the two-point case.Numerical tests on the Intel iPSC/860 computer show that substantial speedup can be achieved via parallel algorithms vis-a-vis sequential algorithms. Therefore, the present technique has considerable interest for real-time trajectory optimization and guidance.Dedicated to the Memory of Professor Jan M. SkowronskiThis paper, based on Refs. 1–3, is a much condensed version of the material contained in these references.The technical assistance of the Research Center on Parallel Computation of Rice University, Houston, Texas is gratefully acknowledged.