Characterization of measures by potentials

Let μ be a measure in a Banach spaceE, f be an even function onR. We consider the potentialg(a)=f _E f(‖x?a‖)dμ(x). The question is as follows: For whichf does the potentialg determine μ uniquely? In this article we give answers in the cases whereE=l _∞ ⁿ and wheref(t)=|t| ^p andE is a finite dimensional Banach space with symmetric analytic norm. Calculating the Fourier transform of the functionf(‖x‖ _∞) we give a new proof of the J. Misiewicz's result that the functionf(‖x‖ _∞) is positive definite only iff is a constant function.     

Migration of seismic data

Prospecting for oil and gas resources poses the problem of determining the geological structure of the earth's crust from indirect measurements. Seismic migration is an acoustic image reconstruction technique based on the inversion of the scalar wave equation. Extensive computation is necessary before reliable information can be extracted from large sets of recorded data. In this paper a collection of industrial migration techniques, each giving rise to a data parallel algorithm, is outlined. Computer simulations on synthetic seismic data illustrate the problem and the approach.     

PRIRODA-04: a quantum-chemical program suite. New possibilities in the study of molecular systems with the application of parallel computing

Main characteristics are described of the PRIRODA quantum-chemical program suite designed for the study of complex molecular systems by the density functional theory, at the MP2, MP3, and MP4 levels of multiparticle perturbation theory, and by the coupled-cluster single and double excitations method (CCSD) with the application of parallel computing. A number of examples of calculations are presented.__________Published in Russian in Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 3, pp. 804–810, March, 2005.     

A Procedure for Transforming Impedance Spectra for the Determination of Mechanism of Electrochemical Reactions

Transformation of impedance spectra into relaxation time spectra (RTS) is used for determining contributions of individual processes of the oxygen electroreduction reaction (OER) to the polarization resistance of the electrochemical cell. The transformation technique involves the solution of the convolution equation found with the aid of a modified Van Cittert iteration algorithm checked on model impedance spectra. The technique, when used to analyze impedance spectra of electrochemical cells air|Pt|YSZ|YSZ + Pt|air, shows that the conversion of a globular structure of the YSZ + Pt cermet layer to a columnar one is accompanied by a change of peak amplitudes in RTS. The revealed RTS dynamics when heated to 750°C is compared with peculiarities of individual processes in OER.     

用重复卷积法求解物理宽化函数

用重复卷积法求解物理宽化函数吴万国,林嘉　（福州大学中心实验室,福州３５０００２）（中国（福建）对外贸易中心集团,福州３５０００１）关键词Ｘ射线衍射,晶粒度,晶格畸变,重复卷积粉末试样的Ｘ射线衍射谱线一般具有一定的宽度,引起话线宽化的主要原因有仪器致...     

光周期敏感不育水稻中激素的二阶导数卷积伏安法研究

二阶导数卷积伏安法应用于水稻中痛量雌雄激素的检测，具有快速，灵敏，干扰少的特点。本文以光周期敏感核不育水稻农垦５８Ｓ为材料，以农垦５８作对照，了叶焉和穗中雌，雄性激素的含量，研究了不同光周期条件下两类激素的变化。     

A parallel implementation of the COLUMBUS multireference configuration interaction program

Summary In this work a parallel implementation of the COLUMBUS MRSDCI program system is presented. A coarse grain parallelization approach using message passing via the portable toolkit TCGMSG is used. The program is very well portable and runs on shared memory machines like the Cray Y-MP, Alliant FX/2800 or Convex C2 and on distributed memory machines like the iPSC/860. Further implementations on a network of workstations and on the Intel Touchstone Delta are in progress. Overall, results are quite satisfactory considering the complexity and the prodigious requirements, especially the I/O bandwidth, of MRCI programs in general. For our largest test case we obtain a speedup of a factor of 7.2 on an eight processor Cray Y-MP for that section of the program (hamiltonian matrix times trial vector product) which has been parallelized. The speedup for one complete diagonalization iteration amounts to 5.9. An absolute speed close to 1 GFLOPS is found. Results for the iPSC/860 show that ordinary disk I/O is certainly not sufficient in order to guarantee a satisfactory performance. As a solution for that problem, the implementation of a fully asynchronous distributed-memory model for certain data files is in preparation. On leave from: Bereich Informatik, Universität Leipzig, Augustusplatz 10/11, O-7010 Leipzig, Germany     

Benchmark studies of the BCRLM reactive scattering code: Implications for accurate quantum calculations

Summary The Bending Corrected Rotating Linear Model (BCRLM), developed by Hayes and Walker, is a simple approximation to the true multidimensional scattering problem for reactions of the type: A + BC AB + C. While the BCRLM method is simpler than methods designed to obtain accurate three-dimensional quantum scattering results, this turns out to be a major advantage in terms of our benchmarking studies. The computer code used to obtain BCRLM scattering results is written for the most part in standard FORTRAN and has been ported to several scalar, vector, and parallel architecture computers including the IBM 3090-600J, the Cray XMP and YMP, the Ardent Titan, IBM RISC System/6000, Convex C-1 and the MIPS 2000. Benchmark results will be reported for each of these machines with an emphasis on comparing the scalar, vector, and parallel performance for the standard code with minimum modifications. Detailed analysis of the mapping of the BCRLM approach onto both shared and distributed memory parallel architecture machines indicates the importance of introducing several key changes in the basic strategy and algorithms used to calculate scattering results. This analysis of the BCRLM approach provides some insights into optimal strategies for mapping three-dimensional quantum scattering methods, such as the Parker-Pack method, onto shared or distributed memory parallel computers.     

Numerical solution of minimax problems of optimal control,part 1

This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance.     

Discontinuous Galerkin methods on graphics processing units for nonlinear hyperbolic conservation laws

We present a novel implementation of the modal DG method for hyperbolic conservation laws in two dimensions on graphics processing units (GPUs) using NVIDIA's Compute Unified Device Architecture. Both flexible and highly accurate, DG methods accommodate parallel architectures well as their discontinuous nature produces element‐local approximations. High‐performance scientific computing suits GPUs well, as these powerful, massively parallel, cost‐effective devices have recently included support for double‐precision floating‐point numbers. Computed examples for Euler equations over unstructured triangle meshes demonstrate the effectiveness of our implementation on an NVIDIA GTX 580 device. Profiling of our method reveals performance comparable with an existing nodal DG‐GPU implementation for linear problems. Copyright © 2014 John Wiley & Sons, Ltd.