Browsing by Subject "Variational techniques"

Now showing 1 - 3 of 3

Open Access
Energy and mass of 3D and 2D polarons in the overall range of the electron-phonon coupling strength
(Institute of Physics Publishing Ltd., 1994) Ercelebi, A.; Senger, R. T.
The ground-state characterization of the polaron problem is retrieved within the framework of a variational scheme proposed previously by Devreese et al for the bound polaron. The formulation is based on the standard canonical transformation of the strong coupling ansatz and consists of a variationally determined perturbative extension serving for the theory to interpolate in the overall range of the coupling constant. Specializing our considerations to the bulk and strict two-dimensional polaron models we see that the theory yields significantly improved energy upper bounds in the strong coupling regime and, moreover, extrapolates itself successfully towards the well-established weak coupling limits for all polaron quantities of general interest.
Open Access
Parameter identification for partially observed diffusions
(Kluwer Academic Publishers-Plenum Publishers, 1992) Dabbous, T.E.; Ahmed, N.U.
In this paper, we consider the identification problem of drift and dispersion parameters for a class of partially observed systems governed by Ito equations. Using the pathwise description of the Zakai equation, we formulate the original identification problem as a deterministic control problem in which the unnormalized conditional density (solution of the Zakai equation) is treated as the state, the unknown parameters as controls, and the likelihood ratio as the objective functional. The question of existence of elements in the parameter set that maximize the likelihood ratio is discussed. Further, using variational arguments and the Gateaux differentiability of the unnormalized density on the parameter set, we obtain the necessary conditions for optimal identification. © 1992 Plenum Publishing Corporation.
Open Access
Scheduling to minimize the coefficient of variation
(Elsevier, 1996) De, P.; Ghosh, J. B.; Wells, C. E.
In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We first show that, for high processing time values of the longest job, a variance (V) minimizing schedule also minimizes CV. Using this equivalence, we next demonstrate the invalidity of an earlier conjecture about the structure of a CV-optimal schedule and proceed to establish the NP-hardness of the CV problem. Finally, drawing from our prior work on the V problem, we provide a pseudo-polynomial dynamic programming algorithm for the solution of the CV problem.