Identification of a dissipation coefficient by a variational method

A generalized inverse problem for the identification of the absorption coefficient for a hyperbolic system is considered. The well-posedness of the problem is examined. It is proved that the regular part of the solution is an L ₂ function, which reduces the inverse problem to minimizing the error functional. The gradient of the functional is determined in explicit form from the adjoint problem, and approximate formulas for its calculation are derived. A regularization algorithm for the solution of the inverse problem is considered. Numerical results obtained for various excitation sources are displayed.     

On the convergence rate and optimization of a numerical method with splitting of boundary conditions for the stokes system in a spherical layer in the axisymmetric case: Modification for thick layers

The convergence rate of a fast-converging second-order accurate iterative method with splitting of boundary conditions constructed by the authors for solving an axisymmetric Dirichlet boundary value problem for the Stokes system in a spherical gap is studied numerically. For R/r exceeding about 30, where r and R are the radii of the inner and outer boundary spheres, it is established that the convergence rate of the method is lower (and considerably lower for large R/r) than the convergence rate of its differential version. For this reason, a really simpler, more slowly converging modification of the original method is constructed on the differential level and a finite-element implementation of this modification is built. Numerical experiments have revealed that this modification has the same convergence rate as its differential counterpart for R/r of up to 5 × 10³. When the multigrid method is used to solve the split and auxiliary boundary value problems arising at iterations, the modification is more efficient than the original method starting from R/r ～ 30 and is considerably more efficient for large values of R/r. It is also established that the convergence rates of both methods depend little on the stretching coefficient η of circularly rectangular mesh cells in a range of η that is well sufficient for effective use of the multigrid method for arbitrary values of R/r smaller than ～ 5 × 10³.     

General Aspects and Optimization of Enantioselective Biocatalysis in Organic Solvents: The Use of Lipases [New Synthetic Methods (76)]

Enantioselective biocatalysis in nonaqueous media is becoming increasingly important in preparative synthetic chemistry. This article discusses (1) the general catalytic properties of enzymes in nonaqueous environments, (2) the basic principles that govern lipase-catalyzed enantioselective esterification and transesterification reactions in organic media for the preparation of optically active acids and alcohols, (3) the determination of kinetic and thermodynamic parameters, and (4) the quantitative analysis of published data.     

自由基CH(X2Π,a4Σ-)的光谱数据从头算研究

用分子轨道从头算方法,对CH自由基的基态(X2Π)和低激发态(a4Σ-)的光谱数据进行了计算.计算结果表明,在基态CH(X2Π)时,在QCISD(T)/6-311G (3df,3pd)水平上,计算所得的键长R=0.1120981nm,偶极矩μ＝1.5891 Debye,ν＝2845.43cm-1均与实验值相吻合,在B3PW91/6-311G (3df,3pd)理论水平上,计算的基态能量为-38.496143 Hartree,误差仅为0.22%;对低激发态CH(a4Σ-),使用含时的密度泛函方法(TDDFT)和大基组6-311 G(3df,3pd)计算所得的R=0.1094nm,垂直跃迁能量为0.926eV,均与实验结果有较好的吻合.     

Homogeneous immunoassays

Applied Biochemistry and Biotechnology -     

Halogen Bonding： An AIM Analysis of the Weak Interactions

A series of complexes formed between halogen-containing molecules and ammonia have been investigated by means of the atoms in molecules （AIM） approach to gain a deeper insight into halogen bonding. The existence of the halogen bond critical points （XBCP） and the values of the electron density （Pb） and Laplacian of electron density （V2pb） at the XBCP reveal the closed-shell interactions in these complexes. Integrated atomic properties such as charge, energy, polarization moment, volume of the halogen bond donor atoms, and the corresponding changes （△） upon complexation have been calculated. The present calculations have demonstrated that the halogen bond represents different AIM properties as compared to the well-documented hydrogen bond. Both the electron density and the Laplacian of electron density at the XBCP have been shown to correlate well with the interaction energy, which indicates that the topological parameters at the XBCP can be treated as a good measure of the halogen bond strength In addition, an excellent linear relationship between the interatomic distance d（X…N） and the logarithm of Pb has been established.     

求解比例延迟微分方程的Rosenbrock方法的渐近稳定性(英文)

本文讨论了一类Rosenbrock方法求解比例延迟微分方程,y′(t)=λy(t) μy(qt),λ,μ∈C,0     

Vector-Orthogonality and Lanczos-Type Methods

A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open.     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.