A Comparative Study on Dynamic and Static Sparsity Patterns in Parallel Sparse Approximate Inverse Preconditioning

Sparse approximate inverse (SAI) techniques have recently emerged as a new class of parallel preconditioning techniques for solving large sparse linear systems on high performance computers. The choice of the sparsity pattern of the SAI matrix is probably the most important step in constructing an SAI preconditioner. Both dynamic and static sparsity pattern selection approaches have been proposed by researchers. Through a few numerical experiments, we conduct a comparable study on the properties and performance of the SAI preconditioners using the different sparsity patterns for solving some sparse linear systems. This revised version was published online in July 2006 with corrections to the Cover Date.     

Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

We introduce the concept of partially strictly monotone functions and apply it to construct a class of nonlinear penalty functions for a constrained optimization problem. This class of nonlinear penalty functions includes some (nonlinear) penalty functions currently used in the literature as special cases. Assuming that the perturbation function is lower semi-continuous, we prove that the sequence of optimal values of nonlinear penalty problems converges to that of the original constrained optimization problem. First-order and second-order necessary optimality conditions of nonlinear penalty problems are derived by converting the optimality of penalty problems into that of a smooth constrained vector optimization problem. This approach allows for a concise derivation of optimality conditions of nonlinear penalty problems. Finally, we prove that each limit point of the second-order stationary points of the nonlinear penalty problems is a second-order stationary point of the original constrained optimization problem.     

A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.     

Phase Measurement Algorithm in Wavelength Scanned Fizeau Interferometer

Wavelength scanned interferometry allows the simultaneous measurement of top surface shape and optical thickness variation of a transparent object consisting of several parallel surfaces. Interference signals from these surfaces can be separated in frequency space, and their phases are detected by discrete Fourier analysis. However, these signal frequencies are shifted from the detection frequency by the refractive index dispersion of the object and a nonlinearity of the wavelength scanning. The Fourier analysis is sensitive to the detuning of the signal frequency and suffers from the multiple-beam interference noise. Conventional error-compensating algorithms cannot be applied to an object consisting of more than three reflecting surfaces. We derive a new 2N-1 sample error-compensating algorithm, which allows the phase detection of any order of harmonic frequency among the interference signals. The new algorithm suppresses the effect of signal frequency detuning as well as the multiple-beam interference noise and can be applied to the measurement of complex objects consisting of more than three reflecting surfaces.     

旋转带电体磁矩计算的若干法则与算例

本文在文献 [1]、[2 ]等的基础上给出关于旋转带电体的磁矩计算的若干法则 ,均以定理形式表达 ,并列表枚举其相关算例     

FoxBASE与高级语言接口程序的设计

在计算机的应用编程中，经常会遇到在ＦｏｘＢＡＳＥ环境下使用高级语言的问题。本文通过实例及对数据库结构的分析，介绍了ＦｏｘＢＡＳＥ与高级语言接口程序的功能、原理及简单的设计方法。     

Ring resonators with N × M couplers

Multiple-zero multiple-pole optical filter transfer functions may be implemented more efficiently in an integrated optics architecture if higher order N × M optical couplers are utilized. For example, a coherent ring resonator made from two 3×3 couplers offers some advantages over the three mirror Fabry-Perot etalon, which is its analog. To this end we develop the formalism for obtaining the transfer functions and scattering matrices of ring resonators made from two N × M couplers. We then present a methodology for analyzing serial and parallel systems of N × M optical coupler ring resonators.     

The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs

We consider a class of non-linear mixed integer programs with n integer variables and k continuous variables. Solving instances from this class to optimality is an NP-hard problem. We show that for the cases with k=1 and k=2, every optimal solution is integral. In contrast to this, for every k≥3 there exist instances where every optimal solution takes non-integral values. Received: August 2001 / Accepted: January 2002?Published online March 27, 2002