A variable-stepsize Jacobian-free exponential integrator for simulating transport in heterogeneous porous media : application to wood drying

A Jacobian-free variable-stepsize method is developed for the numerical integration of the large, stiff systems of differential equations encountered when simulating transport in heterogeneous porous media. Our method utilises the exponential Rosenbrock-Euler method, which is explicit in nature and requires a matrix-vector product involving the exponential of the Jacobian matrix at each step of the integration process. These products can be approximated using Krylov subspace methods, which permit a large integration stepsize to be utilised without having to precondition the iterations. This means that our method is truly "Jacobian-free" - the Jacobian need never be formed or factored during the simulation. We assess the performance of the new algorithm for simulating the drying of softwood. Numerical experiments conducted for both low and high temperature drying demonstrates that the new approach outperforms (in terms of accuracy and efficiency) existing simulation codes that utilise the backward Euler method via a preconditioned Newton-Krylov strategy.

Jacobian-free Newton-Krylov methods with GPU acceleration for computing nonlinear ship wave patterns

The nonlinear problem of steady free-surface flow past a submerged source is considered as a case study for three-dimensional ship wave problems. Of particular interest is the distinctive wedge-shaped wave pattern that forms on the surface of the fluid. By reformulating the governing equations with a standard boundary-integral method, we derive a system of nonlinear algebraic equations that enforce a singular integro-differential equation at each midpoint on a two-dimensional mesh. Our contribution is to solve the system of equations with a Jacobian-free Newton-Krylov method together with a banded preconditioner that is carefully constructed with entries taken from the Jacobian of the linearised problem. Further, we are able to utilise graphics processing unit acceleration to significantly increase the grid refinement and decrease the run-time of our solutions in comparison to schemes that are presently employed in the literature. Our approach provides opportunities to explore the nonlinear features of three-dimensional ship wave patterns, such as the shape of steep waves close to their limiting configuration, in a manner that has been possible in the two-dimensional analogue for some time.

Addendum to ``Reconciling grand unification with strings by anisotropic compactifications''

In this brief addendum, we clarify a point which we left unaddressed in a previous publication [Phys. Rev. D 78, 066006 (2008)]. In particular, we show that a specific vacuum configuration constructed in one of our models satisfies the condition D=0. In the previous publication, we only showed F=0. Both D=0 and F=0 are necessary to ensure that supersymmetry survives to the weak scale.

A Jacobian-Based Algorithm for Planning Attitude Maneuvers Using Forward and Reverse Rotations

Algorithms for planning quasistatic attitude maneuvers based on the Jacobian of the forward kinematic mapping of fully-reversed (FR) sequences of rotations are proposed in this paper. An FR sequence of rotations is a series of finite rotations that consists of initial rotations about the axes of a body-fixed coordinate frame and subsequent rotations that undo these initial rotations. Unlike the Jacobian of conventional systems such as a robot manipulator, the Jacobian of the system manipulated through FR rotations is a null matrix at the identity, which leads to a total breakdown of the traditional Jacobian formulation. Therefore, the Jacobian algorithm is reformulated and implemented so as to synthesize an FR sequence for a desired rotational displacement. The Jacobian-based algorithm presented in this paper identifies particular six-rotation FR sequences that synthesize desired orientations. We developed the single-step and the multiple-step Jacobian methods to accomplish a given task using six-rotation FR sequences. The single-step Jacobian method identifies a specific FR sequence for a given desired orientation and the multiple-step Jacobian algorithm synthesizes physically feasible FR rotations on an optimal path. A comparison with existing algorithms verifies the fast convergence ability of the Jacobian-based algorithm. Unlike closed-form solutions to the inverse kinematics problem, the Jacobian-based algorithm determines the most efficient FR sequence that yields a desired rotational displacement through a simple and inexpensive numerical calculation. The procedure presented here is useful for those motion planning problems wherein the Jacobian is singular or null.

Embedding Of Non-Simple Lie-Groups, Coupling-Constant Relations And Non-Uniqueness Of Models Of Unification

A general derivation of the coupling constant relations which result on embedding a non-simple group like SU L (2) @ U(1) in a larger simple group (or graded Lie group) is given. It is shown that such relations depend only on the requirement (i) that the multiplet of vector fields form an irreducible representation of the unifying algebra and (ii) the transformation properties of the fermions under SU L (2). This point is illustrated in two ways, one by constructing two different unification groups containing the same fermions and therefore have same Weinberg angle; the other by putting different SU L (2) structures on the same fermions and consequently have different Weinberg angles. In particular the value sin~0=3/8 is characteristic of the sequential doublet models or models which invoke a large number of additional leptons like E 6, while addition of extra charged fermion singlets can reduce the value of sin ~ 0 to 1/4. We point out that at the present time the models of grand unification are far from unique.

A constraint Jacobian based approach for static analysis of pantograph masts

This paper presents a constraint Jacobian matrix based approach to obtain the stiffness matrix of widely used deployable pantograph masts with scissor-like elements (SLE). The stiffness matrix is obtained in symbolic form and the results obtained agree with those obtained with the force and displacement methods available in literature. Additional advantages of this approach are that the mobility of a mast can be evaluated, redundant links and joints in the mast can be identified and practical masts with revolute joints can be analysed. Simulations for a hexagonal mast and an assembly with four hexagonal masts is presented as illustrations.

Seyfert Galaxies: Nuclear Radio Structure And Unification

A radio study of a carefully selected sample of 20 Seyfert galaxies that are matched in orientation-independent parameters, which are measures of intrinsic active galactic nucleus power and host galaxy properties, is presented to test the predictions of the unified scheme hypothesis. Our sample sources have core flux densities greater than 8 mJy at 5 GHz on arcsec scales due to the feasibility requirements. These simultaneous parsec-scale and kiloparsec-scale radio observations reveal (1) that Seyfert 1 and Seyfert 2 galaxies have an equal tendency to show compact radio structures on milliarcsecond scales, (2) the distributions of parsec-scale and kiloparsec-scale radio luminosities are similar for both Seyfert 1 and Seyfert 2 galaxies, (3) there is no evidence for relativistic beaming in Seyfert galaxies, (4) similar distributions of source spectral indices in spite of the fact that Seyferts show nuclear radio flux density variations, and (5) the distributions of the projected linear size for Seyfert 1 and Seyfert 2 galaxies are not significantly different as would be expected in the unified scheme. The latter could be mainly due to a relatively large spread in the intrinsic sizes. We also find that a starburst alone cannot power these radio sources. Finally, an analysis of the kiloparsec-scale radio properties of the CfA Seyfert galaxy sample shows results consistent with the predictions of the unified scheme.

A unification-based decision procedure for cryptographic protocol analysis

We present a sound and complete decision procedure for the bounded process cryptographic protocol insecurity problem, based on the notion of normal proofs [2] and classical unification. We also show a result about the existence of attacks with “high” normal cuts. Our proof of correctness provides an alternate proof and new insights into the fundamental result of Rusinowitch and Turuani [9] for the same setting.

A New Voltage Stability Index based on the Tangent Vector of the Power Flow Jacobian

This paper presents a new voltage stability index based on the tangent vector of the power flow jacobian. This index is capable of providing the relative vulnerability information of the system buses from the point of view of voltage collapse. In an effort to compare this index with a similar index, the popular voltage stability index L is studied and it is shown through system studies that the L index is not a very consistent indicator of the voltage collapse point of the system but is only a reasonable indicator of the vulnerability of the system buses to voltage collapse. We also show that the new index can be used in the voltage stability analysis of radial systems which is not possible with the L index. This is a significant result of this investigation since there is a lot of contemporary interest in distributed generation and microgrids which are by and large radial in nature. Simulation results considering several test systems are provided to validate the results and the computational needs of the proposed scheme is assessed in comparison with other schemes

Global stabilization of feedforward systems with exponentially unstable Jacobian linearization

The global stabilization of a class of feedforward systems having an exponentially unstable Jacobian linearization is achieved by a high-gain feedback saturated at a low level. The control law forces the derivatives of the state variables to small values along the closed-loop trajectories. This "slow control" design is illustrated with a benchmark example and its limitations are emphasized. © 1999 Elsevier Science B.V. All rights reserved.

Proceedings of Sixth International Workshop on Unification

Swiss National Science Foundation; Austrian Federal Ministry of Science and Research; Deutsche Forschungsgemeinschaft (SFB 314); Christ Church, Oxford; Oxford University Computing Laboratory