Similarity solution of unsteady boundary layer equations with a magnetic field

The unsteady laminar incompressible boundary layer flow of an electrically conducting fluid in the stagnation region of two-dimensional and axisymmetric bodies with an applied magnetic field has been studied. The boundary layer equations which are parabolic partial differential equations with three independent variables have been reduced to a system of ordinary differential equations by using suitable transformations and then solved numerically using a shooting method. Here, we have obtained new solutions which are solutions of both the boundary layer and Navier-Stokes equations.

The Equations of Equilibrium in Orthogonal Curvilinear Reference Coordinates

Analytical solutions to problems in finite elasticity are most often derived using the semi-inverse approach along with the spatial form of the equations of motion involving the Cauchy stress tensor. This procedure is somewhat indirect since the spatial equations involve derivatives with respect to spatial coordinates while the unknown functions are in terms of material coordinates, thus necessitating the use of the chain rule. In this classroom note, we derive compact expressions for the components of the divergence, with respect to orthogonal material coordinates, of the first Piola-Kirchhoff stress tensor. The spatial coordinate system is also assumed to be an orthogonal curvilinear one, although, not necessarily of the same type as the material coordinate system. We show by means of some example applications how analytical solutions can be derived more directly using the derived results.

Solutions of cubic equations in quadratic fields

Let K be any quadratic field with O-K its ring of integers. We study the solutions of cubic equations, which represent elliptic curves defined over Q, in quadratic fields and prove some interesting results regarding the solutions by using elementary tools. As an application we consider the Diophantine equation r + s + t = rst = 1 in O-K. This Diophantine equation gives an elliptic curve defined over Q with finite Mordell-Weil group. Using our study of the solutions of cubic equations in quadratic fields we present a simple proof of the fact that except for the ring of integers of Q(i) and Q(root 2), this Diophantine equation is not solvable in the ring of integers of any other quadratic fields, which is already proved in [4].

Multiple scales without center manifold reductions for delay differential equations near Hopf bifurcations

We study small perturbations of three linear Delay Differential Equations (DDEs) close to Hopf bifurcation points. In analytical treatments of such equations, many authors recommend a center manifold reduction as a first step. We demonstrate that the method of multiple scales, on simply discarding the infinitely many exponentially decaying components of the complementary solutions obtained at each stage of the approximation, can bypass the explicit center manifold calculation. Analytical approximations obtained for the DDEs studied closely match numerical solutions.

Pseudodynamic systems approach based on a quadratic approximation of update equations for diffuse optical tomography

We explore a pseudodynamic form of the quadratic parameter update equation for diffuse optical tomographic reconstruction from noisy data. A few explicit and implicit strategies for obtaining the parameter updates via a semianalytical integration of the pseudodynamic equations are proposed. Despite the ill-posedness of the inverse problem associated with diffuse optical tomography, adoption of the quadratic update scheme combined with the pseudotime integration appears not only to yield higher convergence, but also a muted sensitivity to the regularization parameters, which include the pseudotime step size for integration. These observations are validated through reconstructions with both numerically generated and experimentally acquired data. (C) 2011 Optical Society of America

A Multidimensional Kinetic Upwind Method for Euler Equations

The study of directional derivative lead to the development of a rotationally invariant kinetic upwind method (KUMARI)3 which avoids dimension by dimension splitting. The method is upwind and rotationally invariant and hence truly multidimensional or multidirectional upwind scheme. The extension of KUMARI to second order is as well presented.

Quasichemical equations for oxygen and sulphur in liquid binary alloys

An equation has been derived for predicting the activity coefficient of oxygen or sulphur in dilute solution in binary alloys, based on the quasichemical approach, where the metal atoms and the oxygen atoms are assigned different bond numbers. This equation is an advance on Alcock and Richardson's earlier treatment where all the three types of atoms were assigned the same coordination number. However, the activity coefficients predicted by this new equation appear to be very similar to those obtained through Alcock and Richardson's equation for a number of alloy systems, when the coordination number of oxygen in the new model is the same as the average coordination number used in the earlier equation. A second equation based on the formation of “molecular species” of the type XnO and YnO in solution is also derived, where X and Y atoms attached to oxygen are assumed not to make any other bonds. This equation does not fit experimental data in all the systems considered for a fixed value of n. Howover, if the strong oxygen-metal bonds are assumed to distort the electronic configuation around the metal atoms bonded to oxygen and thus reduce the strength of the bonds formed by these atoms with neighbouring metal atoms by approximately a factor of two, the resulting equation is found to predict the activity coefficients of oxygen that are in good agreement with experimental data in a number of binary alloys.

Biquadratic pulse transmission networks

A second order transfer function with two poles and two zeros exhibits a step response characterized by a sudden rise to the steady state value, followed by oscillations around this steady state. With proper choice of the coefficients, it is possible to obtain transfer functions suitable for pulse transmission purposes.

Galois Theory and Solvable Equations of Prime Degree

In this article we review classical and modern Galois theory with historical evolution and prove a criterion of Galois for solvability of an irreducible separable polynomial of prime degree over an arbitrary field k and give many illustrative examples.

On the solution of bivariate population balance equations for aggregation: X-discretization of space for expansion and contraction of computational domain

A new structured discretization of 2D space, named X-discretization, is proposed to solve bivariate population balance equations using the framework of minimal internal consistency of discretization of Chakraborty and Kumar [2007, A new framework for solution of multidimensional population balance equations. Chem. Eng. Sci. 62, 4112-4125] for breakup and aggregation of particles. The 2D space of particle constituents (internal attributes) is discretized into bins by using arbitrarily spaced constant composition radial lines and constant mass lines of slope -1. The quadrilaterals are triangulated by using straight lines pointing towards the mean composition line. The monotonicity of the new discretization makes is quite easy to implement, like a rectangular grid but with significantly reduced numerical dispersion. We use the new discretization of space to automate the expansion and contraction of the computational domain for the aggregation process, corresponding to the formation of larger particles and the disappearance of smaller particles by adding and removing the constant mass lines at the boundaries. The results show that the predictions of particle size distribution on fixed X-grid are in better agreement with the analytical solution than those obtained with the earlier techniques. The simulations carried out with expansion and/or contraction of the computational domain as population evolves show that the proposed strategy of evolving the computational domain with the aggregation process brings down the computational effort quite substantially; larger the extent of evolution, greater is the reduction in computational effort. (C) 2011 Elsevier Ltd. All rights reserved.

A computational procedure to generate difference equations from differential equations

In this paper we have developed methods to compute maps from differential equations. We take two examples. First is the case of the harmonic oscillator and the second is the case of Duffing's equation. First we convert these equations to a canonical form. This is slightly nontrivial for the Duffing's equation. Then we show a method to extend these differential equations. In the second case, symbolic algebra needs to be used. Once the extensions are accomplished, various maps are generated. The Poincare sections are seen as a special case of such generated maps. Other applications are also discussed.

Dilations of Gamma-contractions by solving operator equations

For a contraction P and a bounded commutant S of P. we seek a solution X of the operator equation S - S*P = (1 - P* P)(1/2) X (1 - P* P)(1/2) where X is a bounded operator on (Ran) over bar (1 - P* P)(1/2) with numerical radius of X being not greater than 1. A pair of bounded operators (S, P) which has the domain Gamma = {(z(1) + z(2), z(2)): vertical bar z(1)vertical bar < 1, vertical bar z(2)vertical bar <= 1} subset of C-2 as a spectral set, is called a P-contraction in the literature. We show the existence and uniqueness of solution to the operator equation above for a Gamma-contraction (S, P). This allows us to construct an explicit Gamma-isometric dilation of a Gamma-contraction (S, P). We prove the other way too, i.e., for a commuting pair (S, P) with parallel to P parallel to <= 1 and the spectral radius of S being not greater than 2, the existence of a solution to the above equation implies that (S, P) is a Gamma-contraction. We show that for a pure F-contraction (S, P), there is a bounded operator C with numerical radius not greater than 1, such that S = C + C* P. Any Gamma-isometry can be written in this form where P now is an isometry commuting with C and C. Any Gamma-unitary is of this form as well with P and C being commuting unitaries. Examples of Gamma-contractions on reproducing kernel Hilbert spaces and their Gamma-isometric dilations are discussed. (C) 2012 Elsevier Inc. All rights reserved.

On the solution of bivariate population balance equations for aggregation: Pivotwise expansion of solution domain

The solution of a bivariate population balance equation (PBE) for aggregation of particles necessitates a large 2-d domain to be covered. A correspondingly large number of discretized equations for particle populations on pivots (representative sizes for bins) are solved, although at the end only a relatively small number of pivots are found to participate in the evolution process. In the present work, we initiate solution of the governing PBE on a small set of pivots that can represent the initial size distribution. New pivots are added to expand the computational domain in directions in which the evolving size distribution advances. A self-sufficient set of rules is developed to automate the addition of pivots, taken from an underlying X-grid formed by intersection of the lines of constant composition and constant particle mass. In order to test the robustness of the rule-set, simulations carried out with pivotwise expansion of X-grid are compared with those obtained using sufficiently large fixed X-grids for a number of composition independent and composition dependent aggregation kernels and initial conditions. The two techniques lead to identical predictions, with the former requiring only a fraction of the computational effort. The rule-set automatically reduces aggregation of particles of same composition to a 1-d problem. A midway change in the direction of expansion of domain, effected by the addition of particles of different mean composition, is captured correctly by the rule-set. The evolving shape of a computational domain carries with it the signature of the aggregation process, which can be insightful in complex and time dependent aggregation conditions. (c) 2012 Elsevier Ltd. All rights reserved.