Variable Elimination in Linear Constraints

Gauss and Fourier have together provided us with the essential techniques for symbolic computation with linear arithmetic constraints over the reals and the rationals. These variable elimination techniques for linear constraints have particular significance in the context of constraint logic programming languages that have been developed in recent years. Variable elimination in linear equations (Guassian Elimination) is a fundamental technique in computational linear algebra and is therefore quite familiar to most of us. Elimination in linear inequalities (Fourier Elimination), on the other hand, is intimately related to polyhedral theory and aspects of linear programming that are not quite as familiar. In addition, the high complexity of elimination in inequalities has forces the consideration of intricate specializations of Fourier's original method. The intent of this survey article is to acquaint the reader with these connections and developments. The latter part of the article dwells on the thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains.

Accelerating Numerical Linear Algebra Kernels on a Scalable Run Time Reconfigurable Platform

Numerical Linear Algebra (NLA) kernels are at the heart of all computational problems. These kernels require hardware acceleration for increased throughput. NLA Solvers for dense and sparse matrices differ in the way the matrices are stored and operated upon although they exhibit similar computational properties. While ASIC solutions for NLA Solvers can deliver high performance, they are not scalable, and hence are not commercially viable. In this paper, we show how NLA kernels can be accelerated on REDEFINE, a scalable runtime reconfigurable hardware platform. Compared to a software implementation, Direct Solver (Modified Faddeev's algorithm) on REDEFINE shows a 29X improvement on an average and Iterative Solver (Conjugate Gradient algorithm) shows a 15-20% improvement. We further show that solution on REDEFINE is scalable over larger problem sizes without any notable degradation in performance.

A new approach for fixed point smoothing in linear distributed parameter systems

In this paper, we solve the distributed parameter fixed point smoothing problem by formulating it as an extended linear filtering problem and show that these results coincide with those obtained in the literature using the forward innovations method.

Fluorescent resonant excitation energy transfer in linear polyenes

We have studied the dynamics of excitation transfer between two conjugated polyene molecules whose intermolecular separation is comparable to the molecular dimensions. We have employed a correlated electron model that includes both the charge-charge, charge-bond, and bond-bond intermolecular electron repulsion integrals. We have shown that the excitation transfer rate varies as inverse square of donor-acceptor separation R-2 rather than as R-6, suggested by the Foumlrster type of dipolar approximation. Our time-evolution study alsom shows that the orientational dependence on excitation transfer at a fixed short donor-acceptor separation cannot be explained by Foumlrster type of dipolar approximation beyond a certain orientational angle of rotation of an acceptor polyene with respect to the donor polyene. The actual excitation transfer rate beyond a certain orientational angle is faster than the Foumlrster type of dipolar approximation rate. We have also studied the excitation transfer process in a pair of push-pull polyenes for different push-pull strengths. We have seen that, depending on the push-pull strength, excitation transfer could occur to other dipole coupled states. Our study also allows for the excitation energy transfer to optically dark states which are excluded by Foumlrster theory since the one-photon transition intensity to these states (from the ground state) is zero.

Drag interaction effects in linear sphere-assemblies

Free-fall terminal velocities of single spheres and of single-row assemblies containing up to six spheres, with line of centres of spheres perpendicular to the direction of motion, have been determined in the particle Reynolds numbers range 0.2-4, and interaction effects obtained in the case of assemblies relative to drag on single isolated spheres, are discussed. The observed decrease in the drag on a sphere of an assembly is explained on the basis of theoretical considerations governing flow phenomena in such systems.

On the momentum balance in linear-combination models for the transition zone

The momentum balance of the linear-combination integral model for the transition zone is investigated for constant pressure flows. The imbalance is found to be small enough to be negligible for all practical purposes. [S0889-504X(00)00703-0].

Actuator fault detection and isolation in linear systems

A scheme for the detection and isolation of actuator faults in linear systems is proposed. A bank of unknown input observers is constructed to generate residual signals which will deviate in characteristic ways in the presence of actuator faults. Residual signals are unaffected by the unknown inputs acting on the system and this decreases the false alarm and miss probabilities. The results are illustrated through a simulation study of actuator fault detection and isolation in a pilot plant doubleeffect evaporator.

A note on the observed anisotropy in linear compressibility and thermal expansion of quasicrystals

The linear compressibility and the thermal expansion of Al-Fe and Al-Mn quasicrystals have been reported to be anisotropic. The authors suggest that the observed anisotropy in these properties could be due to the presence of decagonal quasicrystals rather than icosahedral quasicrystals.

On duality in linear fractional programming

In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality theory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate the theory in this connection. The equivalence of Charnes and Cooper dual and Dinkelbach’s parametric dual of a linear fractional program is also established.

A note on resolving infeasibility in linear programs by constraint relaxation

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.

Qualitative theorem proving in linear constraints

We know, from the classical work of Tarski on real closed fields, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take place through the elimination of middle terms, and because the computational complexity of the proof is not an issue. Indeed what we need is the existence of the proof and not its mechanization. In this paper, we treat the linear case and illustrate the power of this paradigm by giving extremely simple proofs of two central theorems in the complexity and geometry of linear programming.

Bounds on Defect Level and Fault Coverage in Linear Analog Circuit Testing

Transfer function coefficients (TFC) are widely used to test linear analog circuits for parametric and catastrophic faults. This paper presents closed form expressions for an upper bound on the defect level (DL) and a lower bound on fault coverage (FC) achievable in TFC based test method. The computed bounds have been tested and validated on several benchmark circuits. Further, application of these bounds to scalable RC ladder networks reveal a number of interesting characteristics. The approach adopted here is general and can be extended to find bounds of DL and FC of other parametric test methods for linear and non-linear circuits.

Conservation Properties of the Trapezoidal Rule in Linear Time Domain Analysis of Acoustics and Structures

The trapezoidal rule, which is a special case of the Newmark family of algorithms, is one of the most widely used methods for transient hyperbolic problems. In this work, we show that this rule conserves linear and angular momenta and energy in the case of undamped linear elastodynamics problems, and an ``energy-like measure'' in the case of undamped acoustic problems. These conservation properties, thus, provide a rational basis for using this algorithm. In linear elastodynamics problems, variants of the trapezoidal rule that incorporate ``high-frequency'' dissipation are often used, since the higher frequencies, which are not approximated properly by the standard displacement-based approach, often result in unphysical behavior. Instead of modifying the trapezoidal algorithm, we propose using a hybrid finite element framework for constructing the stiffness matrix. Hybrid finite elements, which are based on a two-field variational formulation involving displacement and stresses, are known to approximate the eigenvalues much more accurately than the standard displacement-based approach, thereby either bypassing or reducing the need for high-frequency dissipation. We show this by means of several examples, where we compare the numerical solutions obtained using the displacement-based and hybrid approaches against analytical solutions.

A micropolar peridynamic theory in linear elasticity

A state-based micropolar peridynamic theory for linear elastic solids is proposed. The main motivation is to introduce additional micro-rotational degrees of freedom to each material point and thus naturally bring in the physically relevant material length scale parameters into peridynamics. Non-ordinary type modeling via constitutive correspondence is adopted here to define the micropolar peridynamic material. Along with a general three dimensional model, homogenized one dimensional Timoshenko type beam models for both the proposed micropolar and the standard non-polar peridynamic variants are derived. The efficacy of the proposed models in analyzing continua with length scale effects is established via numerical simulations of a few beam and plane-stress problems. (C) 2015 Elsevier Ltd. All rights reserved.

Construction of inverses with prescribed zero minors and applications to decentralized stabilization

We examine the following question: Suppose R is a principal ideal domain, and that F is an n × m matrix with elements in R, with n>m. When does there exist an m × n matrix G such that GF = Im, and such that certain prescribed minors of G equal zero? We show that there is a simple necessary condition for the existence of such a G, but that this condition is not sufficient in general. However, if the set of minors of G that are required to be zero has a certain pattern, then the condition is necessary as well as sufficient. We then show that the pattern mentioned above arises naturally in connection with the question of the existence of decentralized stabilizing controllers for a given plant. Hence our result allows us to derive an extremely simple proof of the fact that a necessary and sufficient condition for the existence of decentralized stabilizing controllers is the absence of unstable decentralized fixed modes, as well as to derive a very clean expression for these fixed modes. In addition to the application to decentralized stabilization, we believe that the result is of independent interest.