Divergence- and Curl-Preserving Prolongation and Restriction Formulas

We present new second-order prolongation and restriction formulas which preserve the divergence and, in some cases, the curl of a discretized vector field. The formulas are suitable for adaptive and hierarchical mesh algorithms with a factor-of-2 linear resolution change. We examine both staggered and collocated discretizations for the vector field on two- and three-dimensional Cartesian grids. The new formulas can be used in combination with numerical schemes that require a divergence-free solution in some discrete sense, such as the constrained transport schemes of computational magnetohydrodynamics. We also obtain divergence-preserving interpolation functions which may be used for streamline or field line tracing.     

Distinguishing new physics scenarios with polarized electron and positron beams

Contact-like nonstandard interactions can be revealed only through deviations of observables from the standard model (SM) predictions. We consider a number of such nonstandard scenarios, and discuss their identification as sources of deviations in fermion-pair production processes at the international linear collider (ILC), if they were observed. We emphasize the role of e ⁻ and e ⁺ polarization in enhancing the identification reaches.      

Solution of Time-Dependent Diffusion Equations with Variable Coefficients Using Multiwavelets

A new numerical algorithm is developed for the solution of time-dependent differential equations of diffusion type. It allows for an accurate and efficient treatment of multidimensional problems with variable coefficients, nonlinearities, and general boundary conditions. For space discretization we use the multiwavelet bases introduced by Alpert (1993,SIAM J. Math. Anal.24, 246–262), and then applied to the representation of differential operators and functions of operators presented by Alpert, Beylkin, and Vozovoi (Representation of operators in the multiwavelet basis, in preparation). An important advantage of multiwavelet basis functions is the fact that they are supported only on non-overlapping subdomains. Thus multiwavelet bases are attractive for solving problems in finite (non periodic) domains. Boundary conditions are imposed with a penalty technique of Hesthaven and Gottlieb (1996,SIAM J. Sci. Comput., 579–612) which can be used to impose rather general boundary conditions. The penalty approach was extended to a procedure for ensuring the continuity of the solution and its first derivative across interior boundaries between neighboring subdomains while time stepping the solution of a time dependent problem. This penalty procedure on the interfaces allows for a simplification and sparsification of the representation of differential operators by discarding the elements responsible for interactions between neighboring subdomains. Consequently the matrices representing the differential operators (on the finest scale) have block-diagonal structure. For a fixed order of multiwavelets (i.e., a fixed number of vanishing moments) the computational complexity of the present algorithm is proportional to the number of subdomains. The time discretization method of Beylkin, Keiser, and Vozovoi (1998, PAM Report 347) is used in view of its favorable stability properties. Numerical results are presented for evolution equations with variable coefficients in one and two dimensions.     

Improved Lanczos algorithms for blackbox MRS data quantitation

Magnetic resonance spectroscopy (MRS) has been shown to be a potentially important medical diagnostic tool. The success of MRS depends on the quantitative data analysis, i.e., the interpretation of the signal in terms of relevant physical parameters, such as frequencies, decay constants, and amplitudes. A variety of time-domain algorithms to extract parameters have been developed. On the one hand, there are so-called blackbox methods. Minimal user interaction and limited incorporation of prior knowledge are inherent to this type of method. On the other hand, interactive methods exist that are iterative, require user involvement, and allow inclusion of prior knowledge. We focus on blackbox methods. The computationally most intensive part of these blackbox methods is the computation of the singular value decomposition (SVD) of a Hankel matrix. Our goal is to reduce the needed computational time without affecting the accuracy of the parameters of interest. To this end, algorithms based on the Lanczos method are suitable because the main computation at each step, a matrix-vector product, can be efficiently performed by means of the fast Fourier transform exploiting the structure of the involved matrix. We compare the performance in terms of accuracy and efficiency of four algorithms: the classical SVD algorithm based on the QR decomposition, the Lanczos algorithm, the Lanczos algorithm with partial reorthogonalization, and the implicitly restarted Lanczos algorithm. Extensive simulation studies show that the latter two algorithms perform best.     

ℵ0-extended supergravity and Chern-Simons theories

We give generalizations of extended Poincaré supergravity with arbitrarily many supersymmetries in the absence of central charges in three dimensions by gauging its intrinsic global SO(N) symmetry. We call these ℵ₀ (Aleph-null) supergravity theories. We further couple a non-Abelian supersymmetric Chern-Simons theory and an Abelian topological BF theory to ℵ₀ supergravity. Our result overcomes the previous difficulty for supersymmetrization of Chern-Simons theories beyond N = 4. This feature is peculiar to the Chern-Simons and BF theories including supergravity in three dimensions. We also show that dimensional reduction schemes for four-dimensional theories such as N = 1 self-dual supersymmetric Yang-Mills theory or N = 1 supergravity theory that can generate ℵ₀ globally and locally supersymmetric theories in three dimensions. As an interesting application, we present ℵ₀ supergravity Liouville theory in two dimensions after appropriate dimensional reduction from three dimensions.     

A New Version of the Fast Multipole Method for Screened Coulomb Interactions in Three Dimensions

We present a new version of the fast multipole method (FMM) for screened Coulomb interactions in three dimensions. Existing schemes can compute such interactions in O(N) time, where N denotes the number of particles. The constant implicit in the O(N) notation, however, is dominated by the expense of translating far-field spherical harmonic expansions to local ones. For each box in the FMM data structure, this requires 189p⁴ operations per box, where p is the order of the expansions used. The new formulation relies on an expansion in evanescent plane waves, with which the amount of work can be reduced to 40p²+6p³ operations per box.     

Nonstandard extension of quantum logic and Dirac's bra-ket formalism of quantum mechanics

An extension of the quantum logical approach to the axiomatization of quantum mechanics usingnonstandard analysis methods is proposed. The physical meaning of a quantum logic as a lattice of propositions is conserved by its nonstandard extension. But not only the usual Hubert space formalism of quantum mechanics can be derived from the nonstandard extended quantum logic. Also the Dirac bra-ket quantum mechanics can be derived as a consequence of such an extended quantum logic.     

Angular Flow in Toroid Cavity Probes

NMR signals from samples that rotate uniformly about the central conductor of a TCD (toroid cavity detector) exhibit frequency shifts that are directly proportional to the sample's angular velocity. This newly observed effect is based on the unique radiofrequency field inside TCDs, which is variable in direction. If a liquid sample is pumped through a capillary tube wound about the central conductor, the frequency shift is proportional to the flow rate. A mathematical relationship between a volumetric flow rate and the frequency shift is established and experimentally verified to high precision. Additionally, two-dimensional flow-resolved NMR spectroscopy for discrimination between components with different flow velocities yet retaining chemical shift information for structural analysis is presented. The application of the two-dimensional method in chromatographic NMR is suggested. Furthermore, utilization of the frequency-shift effect for rheologic studies if combined with toroid-cavity rotating-frame imaging is proposed.     

Unconditionally Stable Methods for Hamilton–Jacobi Equations

We present new numerical methods for constructing approximate solutions to the Cauchy problem for Hamilton–Jacobi equations of the form u_t+H(D_xu)=0. The methods are based on dimensional splitting and front tracking for solving the associated (non-strictly hyperbolic) system of conservation laws p_t+D_xH(p)=0, where p=D_xu. In particular, our methods depend heavily on a front tracking method for one-dimensional scalar conservation laws with discontinuous coefficients. The proposed methods are unconditionally stable in the sense that the time step is not limited by the space discretization and they can be viewed as “large-time-step” Godunov-type (or front tracking) methods. We present several numerical examples illustrating the main features of the proposed methods. We also compare our methods with several methods from the literature.     

Moving Mesh Methods in Multiple Dimensions Based on Harmonic Maps

In practice, there are three types of adaptive methods using the finite element approach, namely the h-method, p-method, and r-method. In the h-method, the overall method contains two parts, a solution algorithm and a mesh selection algorithm. These two parts are independent of each other in the sense that the change of the PDEs will affect the first part only. However, in some of the existing versions of the r-method (also known as the moving mesh method), these two parts are strongly associated with each other and as a result any change of the PDEs will result in the rewriting of the whole code. In this work, we will propose a moving mesh method which also contains two parts, a solution algorithm and a mesh-redistribution algorithm. Our efforts are to keep the advantages of the r-method (e.g., keep the number of nodes unchanged) and of the h-method (e.g., the two parts in the code are independent). A framework for adaptive meshes based on the Hamilton–Schoen–Yau theory was proposed by Dvinsky. In this work, we will extend Dvinsky's method to provide an efficient solver for the mesh-redistribution algorithm. The key idea is to construct the harmonic map between the physical space and a parameter space by an iteration procedure. Each iteration step is to move the mesh closer to the harmonic map. This procedure is simple and easy to program and also enables us to keep the map harmonic even after long times of numerical integration. The numerical schemes are applied to a number of test problems in two dimensions. It is observed that the mesh-redistribution strategy based on the harmonic maps adapts the mesh extremely well to the solution without producing skew elements for multi-dimensional computations.     

The Three Dimensional Non-conforming Finite Element Solution of the Chapman–Ferraro Problem

We demonstrate the feasibility of using a non-conforming, piecewise harmonic finite element method on an unstructured grid in solving a magnetospheric physics problem. We use this approach to construct a global discrete model of the magnetic field of the magnetosphere that includes the effects of shielding currents at the outer boundary (the magnetopause). As in the approach of F. R. Toffolettoet al.(1994,Geophys. Res. Lett.21, 7) the internal magnetospheric field model is that of R. V. Hilmer and G.-H. Voigt (1995,J. Geophys. Res.) while the magnetopause shape is based on an empirically determined approximation (1997, J. Shueet al.,J. Geophys. Res.102, 9497). The results is a magnetic field model whose field lines are completely confined within the magnetosphere. The presented numerical results indicate that the discrete non-conforming finite element model is well-suited for magnetospheric field modeling.     

多块结构网格上的Kershaw扩散格式

Kershaw格式是在四边形结构网格上求解扩散方程的-种经典格式.基于对Kershaw格式中"流"的深入理解,将其拓展到包含非结构点的多块结构网格,分别推导退化非结构点和强化非结构点情况下的Kershaw格式,拓展的Kershaw格式满足流连续条件.三个数值算例的计算结果与精确解吻合得很好,表明将Kershaw格式拓展到多块结构网格的正确性和有效性.     

A Roe Scheme for Ideal MHD Equations on 2D Adaptively Refined Triangular Grids

In this paper we present a second order finite volume method for the resolution of the bidimensional ideal MHD equations on adaptively refined triangular meshes. Our numerical flux function is based on a multidimensional extension of the Roe scheme proposed by Cargo and Gallice for the 1D MHD system. If the mesh is only composed of triangles, our scheme is proved to be weakly consistent with the condition …B=0. This property fails on a cartesian grid. The efficiency of our refinement procedure is shown on 2D MHD shock capturing simulations. Numerical results are compared in case of the interaction of a supersonic plasma with a cylinder on the adapted grid and several non-refined grids. We also present a mass loading simulation which corresponds to a 2D version of the interaction between the solar wind and a comet.     

A Triangulated Vortex Method for the Axisymmetric Euler Equations

A new method is presented for the prediction of unsteady axisymmetric inviscid flows. By combining a triangulated vortex approach with a novel evaluation technique for the Biot–Savart integrals, a Lagrangian vortex method is developed which eliminates the singularities usually present in axisymmetric methods, without recourse to normalizations or other approximations. Furthermore, the computational effort scales as the number of control points N and, in the large N limit, depends only on the order of quadrature employed. The accuracy and computational effort are assessed by comparison with the velocity field of a Gaussian core vortex ring and the use of the technique is illustrated by computation of the motion of Norbury rings and of vortex ring pairing.     

An Error Indicator Monitor Function for an r-Adaptive Finite-Element Method

An r-adaptive finite-element method based on moving-mesh partial differential equations (PDEs) and an error indicator is presented. The error indicator is obtained by applying a technique developed by Bank and Weiser to elliptic equations which result in this case from temporal discretization of the underlying physical PDEs on moving meshes. The construction of the monitor function based on the error indicator is discussed. Numerical results obtained with the current method and the commonly used method based on solution gradients are presented and analyzed for several examples.     

Minimization of the Truncation Error by Grid Adaptation

A new grid adaptation strategy, which minimizes the truncation error of a pth-order finite difference approximation, is proposed. The main idea of the method is based on the observation that the global truncation error associated with discretization on nonuniform meshes can be minimized if the interior grid points are redistributed in an optimal sequence. The method does not explicitly require the truncation error estimate, and at the same time, it allows one to increase the design order of approximation globally by one, so that the same finite difference operator reveals superconvergence properties on the optimal grid. Another very important characteristic of the method is that if the differential operator and the metric coefficients are evaluated identically by some hybrid approximation, then the single optimal grid generator can be employed in the entire computational domain independently of points where the hybrid discretization switches from one approximation to another. Generalization of the present method to multiple dimensions is presented. Numerical calculations of several one-dimensional and one two-dimensional test examples demonstrate the performance of the method and corroborate the theoretical results.     

The Adjoint Method for an Inverse Design Problem in the Directional Solidification of Binary Alloys

This paper presents a systematic procedure based on the adjoint method for solving a class of inverse directional alloy solidification design problems in which a desired growth velocityv_fis achieved under stable growth conditions. To the best of our knowledge, this is the first time that a continuum adjoint formulation is proposed for the solution of an inverse problem with simultaneous heat and mass transfer, thermo-solutal convection, and phase change. In this paper, the interfacial stability is considered to imply a sharp solid–liquid freezing interface. This condition is enforced using the constitutional undercooling criterion in the form of an inequality constraint between the thermal and solute concentration gradients,GandG_c, respectively, at the freezing front. The main unknowns of the design problem are the heating and/or cooling boundary conditions on the mold walls. The inverse design problem is formulated as a functional optimization problem. The cost functional is defined by the square of theL₂norm of the deviation of the freezing interface temperature from the temperature corresponding to thermodynamic equilibrium. A continuum adjoint system is derived to calculate the adjoint temperature, concentration, and velocity fields such that the gradient of the cost functional can be expressed analytically. The cost functional minimization process is realized by the conjugate gradient method via the finite element method solutions of the continuum direct, sensitivity, and adjoint problems. The developed formulation is demonstrated with an example of designing the directional solidification of a binary aqueous solution in a rectangular mold such that a stable vertical interface advances from left to right with a desired growth velocity.     

Implementation Aspects of 3D Lattice-BGK: Boundaries, Accuracy, and a New Fast Relaxation Method

In many realistic fluid-dynamical simulations the specification of the boundary conditions, the error sources, and the number of time steps to reach a steady state are important practical considerations. In this paper we study these issues in the case of the lattice-BGK model. The objective is to present a comprehensive overview of some pitfalls and shortcomings of the lattice-BGK method and to introduce some new ideas useful in practical simulations. We begin with an evaluation of the widely used bounce-back boundary condition in staircase geometries by simulating flow in an inclined tube. It is shown that the bounce-back scheme is first-order accurate in space when the location of the non-slip wall is assumed to be at the boundary nodes. Moreover, for a specific inclination angle of 45 degrees, the scheme is found to be second-order accurate when the location of the non-slip velocity is fitted halfway between the last fluid nodes and the first solid nodes. The error as a function of the relaxation parameter is in that case qualitatively similar to that of flat walls. Next, a comparison of simulations of fluid flow by means of pressure boundaries and by means of body force is presented. A good agreement between these two boundary conditions has been found in the creeping-flow regime. For higher Reynolds numbers differences have been found that are probably caused by problems associated with the pressure boundaries. Furthermore, two widely used 3D models, namelyD₃Q₁₅andD₃Q₁₉, are analysed. It is shown that theD₃Q₁₅model may induce artificial checkerboard invariants due to the connectivity of the lattice. Finally, a new iterative method, which significantly reduces the saturation time, is presented and validated on different benchmark problems.     

Separating Structure and Dynamics in CSA/DD Cross-Correlated Relaxation: A Case Study on Trehalose and Ubiquitin

We present two new sensitivity enhanced gradient NMR experiments for measuring interference effects between chemical shift anisotropy (CSA) and dipolar coupling interactions in a scalar coupled two-spin system in both the laboratory and rotating frames. We apply these methods for quantitative measurement of longitudinal and transverse cross-correlation rates involving interference of ¹³C CSA and ¹³C–¹H dipolar coupling in a disaccharide, α,α- -trehalose, at natural abundance of ¹³C as well as interference of amide ¹⁵N CSA and ¹⁵N–¹H dipolar coupling in uniformly ¹⁵N-labeled ubiquitin. We demonstrate that the standard heteronuclear T₁, T₂, and steady-state NOE autocorrelation experiments augmented by cross-correlation measurements provide sufficient experimental data to quantitatively separate the structural and dynamic contributions to these relaxation rates when the simplifying assumptions of isotropic overall tumbling and an axially symmetric chemical shift tensor are valid.     

New High-Resolution Semi-discrete Central Schemes for Hamilton–Jacobi Equations

We introduce a new high-resolution central scheme for multidimensional Hamilton–Jacobi equations. The scheme retains the simplicity of the non-oscillatory central schemes developed by C.-T. Lin and E. Tadmor (in press, SIAM J. Sci. Comput.), yet it enjoys a smaller amount of numerical viscosity, independent of 1/Δt. By letting Δt↓0 we obtain a new second-order central scheme in the particularly simple semi-discrete form, along the lines of the new semi-discrete central schemes recently introduced by the authors in the context of hyperbolic conservation laws. Fully discrete versions are obtained with appropriate Runge–Kutta solvers. The smaller amount of dissipation enables efficient integration of convection-diffusion equations, where the accumulated error is independent of a small time step dictated by the CFL limitation. The scheme is non-oscillatory thanks to the use of nonlinear limiters. Here we advocate the use of such limiters on second discrete derivatives, which is shown to yield an improved high resolution when compared to the usual limitation of first derivatives. Numerical experiments demonstrate the remarkable resolution obtained by the proposed new central scheme.