131 resultados para Neumann Problem
em Indian Institute of Science - Bangalore - Índia
Resumo:
In this paper, we study the propagation of a shock wave in water, produced by the expansion of a spherical piston with a finite initial radius. The piston path in the x, t plane is a hyperbola. We have considered the following two cases: (i) the piston accelerates from a zero initial velocity and attains a finite velocity asymptotically as t tends to infinity, and (ii) the piston decelerates, starting from a finite initial velocity. Since an analytic approach to this problem is extremely difficult, we have employed the artificial viscosity method of von Neumann & Richtmyer after examining its applicability in water. For the accelerating piston case, we have studied the effect of different initial radii of the piston, different initial curvatures of the piston path in the x, t plane and the different asymptotic speeds of the piston. The decelerating case exhibits the interesting phenomenon of the formation of a cavity in water when the deceleration of the piston is sufficiently high. We have also studied the motion of the cavity boundary up to 550 cycles.
Resumo:
In this paper, we study the exact controllability of a second order linear evolution equation in a domain with highly oscillating boundary with homogeneous Neumann boundary condition on the oscillating part of boundary. Our aim is to obtain the exact controllability for the homogenized equation. The limit problem with Neumann condition on the oscillating boundary is different and hence we need to study the exact controllability of this new type of problem. In the process of homogenization, we also study the asymptotic analysis of evolution equation in two setups, namely solution by standard weak formulation and solution by transposition method.
Resumo:
A new theory of shock dynamics has been developed in the form of a finite number of compatibility conditions along shock rays. It has been used to study the growth or decay of shock strength for accelerating or decelerating piston starting with a nonzero piston velocity. The results show good agreement with those obtained by Harten's high resolution TVD scheme.
Resumo:
In this paper, we first recast the generalized symmetric eigenvalue problem, where the underlying matrix pencil consists of symmetric positive definite matrices, into an unconstrained minimization problem by constructing an appropriate cost function, We then extend it to the case of multiple eigenvectors using an inflation technique, Based on this asymptotic formulation, we derive a quasi-Newton-based adaptive algorithm for estimating the required generalized eigenvectors in the data case. The resulting algorithm is modular and parallel, and it is globally convergent with probability one, We also analyze the effect of inexact inflation on the convergence of this algorithm and that of inexact knowledge of one of the matrices (in the pencil) on the resulting eigenstructure. Simulation results demonstrate that the performance of this algorithm is almost identical to that of the rank-one updating algorithm of Karasalo. Further, the performance of the proposed algorithm has been found to remain stable even over 1 million updates without suffering from any error accumulation problems.
Resumo:
Compulsators are power sources of choice for use in electromagnetic launchers and railguns. These devices hold the promise of reducing unit costs of payload to orbit. In an earlier work, the author had calculated the current distribution in compulsator wires by considering the wire to be split into a finite number of separate wires. The present work develops an integral formulation of the problem of current distribution in compulsator wires which leads to an integrodifferential equation. Analytical solutions, including those for the integration constants, are obtained in closed form. The analytical solutions present a much clearer picture of the effect of various input parameters on the cross-sectional current distribution and point to ways in which the desired current density distribution can be achieved. Results are graphically presented and discussed, with particular reference to a 50-kJ compulsator in Bangalore. Finite-element analysis supports the results.
Resumo:
Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.
Resumo:
Formulation of quantum first passage problem is attempted in terms of a restricted Feynman path integral that simulates an absorbing barrier as in the corresponding classical case. The positivity of the resulting probability density, however, remains to be demonstrated.
Resumo:
A direct and simple approach, utilizing Watson's lemma, is presented for obtaining an approximate solution of a three-part Wiener-Hopf problem associated with the problem of diffraction of a plane wave by a soft strip.
Resumo:
Abstract is not available.
Resumo:
In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). The objective is to find a sequence that performs well with respect to both the objectives: the total completion time and the total absolute differences in completion times. In an earlier study, a method of solving bi-criteria transportation problem is presented. In this paper, we use the methodology of solvin bi-criteria transportation problem, to our bi-criteria single machine scheduling problem with a learning effect, and obtain the set of optimal sequences,. Numerical examples are presented for illustrating the applicability and ease of understanding.
Resumo:
Plywood manufacture includes two fundamental stages. The first is to peel or separate logs into veneer sheets of different thicknesses. The second is to assemble veneer sheets into finished plywood products. At the first stage a decision must be made as to the number of different veneer thicknesses to be peeled and what these thicknesses should be. At the second stage, choices must be made as to how these veneers will be assembled into final products to meet certain constraints while minimizing wood loss. These decisions present a fundamental management dilemma. Costs of peeling, drying, storage, handling, etc. can be reduced by decreasing the number of veneer thicknesses peeled. However, a reduced set of thickness options may make it infeasible to produce the variety of products demanded by the market or increase wood loss by requiring less efficient selection of thicknesses for assembly. In this paper the joint problem of veneer choice and plywood construction is formulated as a nonlinear integer programming problem. A relatively simple optimal solution procedure is developed that exploits special problem structure. This procedure is examined on data from a British Columbia plywood mill. Restricted to the existing set of veneer thicknesses and plywood designs used by that mill, the procedure generated a solution that reduced wood loss by 79 percent, thereby increasing net revenue by 6.86 percent. Additional experiments were performed that examined the consequences of changing the number of veneer thicknesses used. Extensions are discussed that permit the consideration of more than one wood species.
Resumo:
Some recent developments with respect to the resolution of the gauge hierarchy problem in grand unified theories by supersymmetry are presented. A general argument is developed to show how global supersymmetry maintains the stability of the different mass-scales under perturbative effects.
Resumo:
A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.
Resumo:
The breakdown of the usual method of Fourier transforms in the problem of an external line crack in a thin infinite elastic plate is discovered and the correct solution of this problem is derived using the concept of a generalised Fourier transform of a type discussed first by Golecki [1] in connection with Flamant's problem.