A pseudo-dynamical systems approach to a class of inverse problems in engineering

A pseudo-dynamical approach for a class of inverse problems involving static measurements is proposed and explored. Following linearization of the minimizing functional associated with the underlying optimization problem, the new strategy results in a system of linearized ordinary differential equations (ODEs) whose steady-state solutions yield the desired reconstruction. We consider some explicit and implicit schemes for integrating the ODEs and thus establish a deterministic reconstruction strategy without an explicit use of regularization. A stochastic reconstruction strategy is then developed making use of an ensemble Kalman filter wherein these ODEs serve as the measurement model. Finally, we assess the numerical efficacy of the developed tools against a few linear and nonlinear inverse problems of engineering interest.

An algebraic theory of functional and multivalued dependencies in relational databases

Computation of the dependency basis is the fundamental step in solving the membership problem for functional dependencies (FDs) and multivalued dependencies (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 a dependency-lattice and develop an algebraic characterization of inference basis using simple notions from lattice theory. We also establish several interesting properties of dependency-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 membership problem for MVDs. We also show that our results naturally extend to incorporate FDs also in a way that enables the solution of the membership problem for both FDs and MVDs put together. We finally show that our algorithms are more efficient than existing ones, when used to solve what we term the ‘generalized membership problem’.

The Implication Problem for Functional and Multivalued Dependencies

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.

On the nature of power flow equations in security analysis

The power system network is assumed to be in steady-state even during low frequency transients. However, depending on generator dynamics, and toad and control characteristics, the system model and the nature of power flow equations can vary The nature of power flow equations describing the system during a contingency is investigated in detail. It is shown that under some mild assumptions on load-voltage characteristics, the power flow equations can be decoupled in an exact manner. When the generator dynamics are considered, the solutions for the load voltages are exact if load nodes are not directly connected to each other

Approximate solutions of Fredholm integral equations of the second kind

This note is concerned with the problem of determining approximate solutions of Fredholm integral equations of the second kind. Approximating the solution of a given integral equation by means of a polynomial, an over-determined system of linear algebraic equations is obtained involving the unknown coefficients, which is finally solved by using the least-squares method. Several examples are examined in detail. (c) 2009 Elsevier Inc. All rights reserved.

On the direct parallel solution of systems of linear equations: New algorithms and systolic structures

The paper presents two new algorithms for the direct parallel solution of systems of linear equations. The algorithms employ a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors. Comparing their performance with the Gaussian elimination algorithm (GE), we show that they are almost 100% faster than the latter. This speedup is achieved by dispensing with all the computation involved in the back-substitution phase of GE. It is also shown that the new algorithms exhibit error characteristics which are superior to GE. An n(n + 1) systolic array structure is proposed for the implementation of the new algorithms. We show that complete solutions can be obtained, through these single-phase solution methods, in 5n−log2n−4 computational steps, without the need for intermediate I/O operations.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

The three faces of Maxwell�s equations

In dealing with electromagnetic phenomena and in particular the phenomena of optics, despite the recognition of the quanta of light people tend to talk of the amplitudes and field strengths, as if the electromagnetic field were a classical field. For example we measure the wavelength of light by studying interference fringes. In this paper we study the inter-relationship of three ways of looking at the problem: in terms of classical wave fields, wave function of the photon; and the quantized wave field. The comparison and contrasts of these three modes of description are carefully analyzed in this paper. The ways in which these different modes complement our intuition and insight are also discussed.

On exact solutions of the unsteady navierstokes equationsâ the vortex with instantaneous curvilinear axis

The unsteady pseudo plane motions have been investigated in which each point of the parallel planes is subjected to non-torsional oscillations in their own plane and at any given instant the streamlines are concentric circles. Exact solutions are obtained and the form of the curve , the locus of the centers of these concentric circles, is discussed. The existence of three infinite sets of exact solutions, for the flow in the geometry of an orthogonal rheometer in which the above non-torsional oscillations are superposed on the disks, is established. Three cases arise according to whether is greater than, equal to or less than , where is angular velocity of the basic rotation and is the frequency of the superposed oscillations. For a symmetric solution of the flow these solutions reduce to a single unique solution. The nature of the curve is illustrated graphically by considering an example of the flow between coaxial rotating disks.

A new algorithm for parallel solution of linear equations

Abstract is not available.

Generalized Burgers equations and Euler-Painleve transcendents. II

It was proposed earlier [P. L. Sachdev, K. R. C. Nair, and V. G. Tikekar, J. Math. Phys. 27, 1506 (1986)] that the Euler Painlevé equation yy[script `]+ay[script ']2+ f(x)yy[script ']+g(x) y2+by[script ']+c=0 represents the generalized Burgers equations (GBE's) in the same manner as Painlevé equations do the KdV type. The GBE was treated with a damping term in some detail. In this paper another GBE ut+uaux+Ju/2t =(gd/2)uxx (the nonplanar Burgers equation) is considered. It is found that its self-similar form is again governed by the Euler Painlevé equation. The ranges of the parameter alpha for which solutions of the connection problem to the self-similar equation exist are obtained numerically and confirmed via some integral relations derived from the ODE's. Special exact analytic solutions for the nonplanar Burgers equation are also obtained. These generalize the well-known single hump solutions for the Burgers equation to other geometries J=1,2; the nonlinear convection term, however, is not quadratic in these cases. This study fortifies the conjecture regarding the importance of the Euler Painlevé equation with respect to GBE's. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

A multi-microprocessor architecture for solving partial differential equations

This paper presents the architecture of a fault-tolerant, special-purpose multi-microprocessor system for solving Partial Differential Equations (PDEs). The modular nature of the architecture allows the use of hundreds of Processing Elements (PEs) for high throughput. Its performance is evaluated by both analytical and simulation methods. The results indicate that the system can achieve high operation rates and is not sensitive to inter-processor communication delay.

Derivation of the solution of certain singular integral equations

It is shown that the a;P?lication of the Poincare-Bertrand fcm~ulaw hen made in a suitable manner produces the s~lutiano f certain singular integral equations very quickly, thc method of arriving at which, otherwise, is too complicaled. Two singular integral equations are considered. One of these quaiions is with a Cauchy-tyge kcrnel arid the other is an equalion which appears in the a a w guide theory and the theory of dishcations. Adifferent approach i? alw made here to solve the singular integralquation> of the waveguide theor? ind this i ~ v o l v eth~e use of the inversion formula of the Cauchy-type singular integral equahn and dudion to a system of TIilberl problems for two unknowns which can be dwupled wry easily to obi& tbe closed form solutim of the irilegral equatlou at band. The methods of the prescnt paper avoid all the complicaled approaches of solving the singular integral equaticn of the waveguide theory knowr todate.

On a linear steady-state system of equations in microcontinuum fluid mechanics

Galerkin representations and integral representations are obtained for the linearized system of coupled differential equations governing steady incompressible flow of a micropolar fluid. The special case of 2-dimensional Stokes flows is then examined and further representation formulae as well as asymptotic expressions, are generated for both the microrotation and velocity vectors. With the aid of these formulae, the Stokes Paradox for micropolar fluids is established.