Calculation of geometrical coupling coefficients for the hyperspherical harmonics approach

An elegant and fast method for the calculation of geometrical structure coefficients needed for an expansion of a few-body wavefunction and interaction in hyperspherical harmonics has been proposed. A sum rule for the GSC has also been derived, which is useful for an independent check of the coefficients. The proposed method of computation is many orders of magnitude faster than conventional methods.     

晶体中隐含的半群结构

序列性和莫比吾思反演已应用到物理中各类逆问题,诸如黑体辐射逆问题、比热逆问题和各类费米体系逆问题.文章要介绍这种方法对提取体材料中原子相互作用势的结合能逆问题的应用,以及对提取界面两侧原子间相互作用势的界面粘结能逆问题的应用.这些方法的关键是要发现对象体系中的半群结构.     

Remarks on scaling a model of Witten-Sander type

We try to prove rigorously that the perimeter of the large Witten-Sander cluster does not scale as the square root of its area, by making a forced comparison with the ill-posed Hele-Shaw problem of fluid dynamics. The attempt is not completely successful; nevertheless some interesting consequences of the comparison are derived.     

Liouville Integrable System and Associated Integrable Coupling

Liouville integrable discrete integrable system is derived based on discrete isospectral problem. It is shown that the hierarchy is completely integrable in the Liouville sense and possesses bi-Hamiltonian structure. Finally, integrable couplings of the obtained system is given by means of semi-direct sums of Lie algebras.     

Preconditioning techniques for iterative solvers in the Discrete Sources Method

Different preconditioning techniques for the iterative method MinRes as solver for the Discrete Sources Method (DSM) are presented. This semi-analytical method is used for light scattering computations by particles in the Mie scattering regime. Its numerical schema includes a linear least-squares problem commonly solved using the QR decomposition method. This could be the subject of numerical difficulties and instabilities for very large particles or particles with extreme geometry. In these cases, we showed that iterative methods with preconditioning techniques can provide a satisfying solution.In our previous paper, we studied four different iterative solvers (RGMRES, BiCGStab, BiCGStab(l), and MinRes) considering the performance and the accuracy of a solution. Here, we study several preconditioning techniques for the MinRes method for a variety of oblate and prolate spheroidal particles of different size and geometrical aspect ratio. Using preconditioning techniques we highly accelerated the iterative process especially for particles with a higher aspect ratio.     

Inverse problems of aggregation processes

The coagulation frequency is the key ingredient in the population balance (Smoluchowski) equation of coagulation kinetics. An inverse problem is formulated to extract the coagulation frequency from transient size distributions when these distributions are self-similar. Two numerical examples illustrate the procedure. The first demonstrates the inverse problem for the recovery of singular coagulation frequencies, while the second shows the procedure when self-similarity is approximate. Transient droplet coagulation experiments in a turbulent flow field have been performed. The resulting size distributions are observed to be self-similar. The inverse problem is used to determine the drop coagulation frequency. This frequency shows significant deviation from the coagulation frequencies derived from simple models of drop-drop interactions in a turbulent flow field.     

A nonlinear PDE model for reconstructing a regular surface from sampled data using a level set formulation on triangular meshes

In this paper, we propose a nonlinear PDE model for reconstructing a regular surface from sampled data. At first, we show the existence and the uniqueness of a viscosity solution to this problem. Then we propose a numerical scheme for solving the nonlinear level set equation on unstructured triangulations adapted to the data sample. We show the consistency of this scheme. In addition, we show how to compute nodewise first and second order derivatives. Some application examples of curve or surface construction are provided to illustrate the potential and to demonstrate the accuracy of this method.     

Analysis of banding problem in multiple beam scanning system of laser printer

In the slant scanning method of multiple beams a misalignment of the slant angle causes a beam spacing error and pitch irregularities of scan lines called “banding”. This paper evaluates the pitch irregularities and tries to clarify the allowable beam spacing error. The following results are obtained: (1) The maximum spacing error of print lines is proportional to m/(dpi), where m is the number of multiple beams and dpi print dot density. (2) The noticeable limit of periodic variations of print density at low spatial frequency was presumed to be a visibility between 1 and 2% in experiments. (3) The allowable beam spacing error was calculated introducing the human eye spatial frequency response. (4) The banding simulation experiments by laser recording on the photographic paper on the XY stage showed good coincidence with the theoretical evaluations.     

Accuracies and conservation errors of various ghost fluid methods for multi-medium Riemann problem

Since the (original) ghost fluid method (OGFM) was proposed by Fedkiw et al. in 1999 [5], a series of other GFM-based methods such as the gas–water version GFM (GWGFM), the modified GFM (MGFM) and the real GFM (RGFM) have been developed subsequently. Systematic analysis, however, has yet to be carried out for the various GFMs on their accuracies and conservation errors. In this paper, we develop a technique to rigorously analyze the accuracies and conservation errors of these different GFMs when applied to the multi-medium Riemann problem with a general equation of state (EOS). By analyzing and comparing the interfacial state provided by each GFM to the exact one of the original multi-medium Riemann problem, we show that the accuracy of interfacial treatment can achieve “third-order accuracy” in the sense of comparing to the exact solution of the original mutli-medium Riemann problem for the MGFM and the RGFM, while it is of at most “first-order accuracy” for the OGFM and the GWGFM when the interface approach is actually near in balance. Similar conclusions are also obtained in association with the local conservation errors. A special test method is exploited to validate these theoretical conclusions from the numerical viewpoint.     

Investigation of Simulated Trading — A multi agent based trading system for optimization purposes

Some years ago, Bachem, Hochstättler, and Malich proposed a heuristic algorithm called Simulated Trading for the optimization of vehicle routing problems. Computational agents place buy-orders and sell-orders for customers to be handled at a virtual financial market, the prices of the orders depending on the costs of inserting the customer in the tour or for his removal. According to a proposed rule set, the financial market creates a buy-and-sell graph for the various orders in the order book, intending to optimize the overall system. Here I present a thorough investigation for the application of this algorithm to the traveling salesman problem.