Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 61 for “"approximation scheme"”.
-
Implementing an approximation scheme for all terminal network reliability
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Application of classical non-linear Liouville dynamic approximations
… operator to problems in classical mechanics. An approximation scheme or methodology is sought that would allow the calculation of the position and momentum of an object at a specified later time, given the initial values of the object's position and momentum at some specified earlier time. The …
-
Approximation of integro-partial differential equations of hyperbolic type
… type which arise in viscoelasticity. An approximation scheme is developed based on a spline approximation in the spatial variable and an averaging approximation in the de1ay variable. Techniques from linear semigroup theory are used to discuss the well-posedness of the state space model …
-
Numerical Case Study of an Atom-Photon Interaction in a Cavity Exploring Quantum Control
<p>We study Magnus expansion (ME) approximation scheme for the interaction between an atom and a single quantized cavity mode (Jaynes-Cumming model) in a closed quantum system in resonance or near resonance for a time-dependent coupling coefficient g(t) in both the interaction and rotating picture …
-
Faster fully polynomial approximation schemes for Knapsack problems
A fully polynomial time approximation scheme (FPTAS) is an algorithm that returns ... -optimal solution to a maximization problem of size n, which runs in polynomial time in both ... We develop faster FPTASs for several classes of knapsack problems. In this thesis, we will first survey the relevant …
-
Nonlinear neutral functional differential equations in product spaces
… This formulation is used to develop a general approximation scheme for those systems. Convergence of this scheme is analyzed. It is also shown how spline based approximating methods fall within this general framework. An illustrative example is presented.
-
Parametric Coordination in Hierarchical Computation of Decentralized Controls
… two time-scales. The latter is used in a new approximation scheme for solving Lyapunov equations of systems with multiple time-scales.
-
Superconvergence in Iterated Solutions of Integral Equations
… through integral operators. A general operator approximation scheme for the second kind linear equation is described that can be used to explain some of the existing superconvergence results. Moreover, a corollary to the general approximation scheme will be given which can be used to establish …
-
Dynamic Programming meets Fine-grained Complexity
… is an improved FPTAS (Fully Polynomial-Time Approximation Scheme) for Partition, and the third application is an improved FPTAS for Knapsack.
-
Closing the memory gap in stochastic functional differential equations
… convergence, we obtain a new existence proof and approximation scheme for stochastic functional differential equations (SFDEs) whose coefficients have linear growth. In mathematical finance, an option pricing formula with full finite memory is obtained through convergence of stock dynamics with …
-
Fully polynomial time approximation schemes for sequential decision problems
… the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for a large class of problems that we call list scheduling problems. Our approach is simple and unifying, and many …
-
A multiscale approximation algorithm for the cardinality constrained knapsack problem
I develop a multiscale approximation algorithm for the cardinality constrained knapsack problem. The algorithm consists of three steps: a rounding and reduction step where a hierarchical representation of the problem data ranging from coarse to fine is generated, a solution step where a coarse …
-
Algorithms for discrete, non-linear and robust optimization problems with applications in scheduling and service operations
… we present a general framework for designing approximation schemes for combinatorial optimization problems in which the objective function is a combination of more than one function. Examples of such problems include those in which the objective function is a product or ratio of two or more …
-
Heuristics for Inventory Systems Based on Quadratic Approximation of L-Natural-Convex Value Functions
<p>We propose an approximation scheme for single-product periodic-review inventory systems with L-natural-convex structure. We lay out three well-studied inventory models, namely the lost-sales system, the perishable inventory system, and the joint inventory-pricing problem. We approximate the …
-
Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples
… We also present an algorithm for medial axis approximation that computes a piece-wise linear core for the given sample. This core is guaranteed to be homotopy equivalent to the medial axis of the shape enclosed by the original surface. We then show that the core can be enhanced by any …
-
A strong maximum principle for reaction-diffusion systems and a weak convergence scheme for reflected stochastic differential equations by Lawrence Christopher Evans.
… system takes its values. The second result is an approximation scheme for reflected stochastic differential equations (SDE) of the Stratonovich type. This is a joint result with Professor Daniel W. Stroock. We show that the distribution of the solution to such a reflected SDE is the weak limit of …
-
Graphs, Principal Minors, and Eigenvalue Problems
… Kamada-Kawai objective, proving hardness of approximation and structural results regarding optimal layouts, and providing a polynomial time randomized approximation scheme for low diameter graphs. Finally, we consider the Lanczos method for computing extremal eigenvalues of a symmetric matrix …
-
Approximation of the LQR control problem for systems governed by partial functional differential equations
… in the choice of state space. We discuss an approximation scheme using spline in the spatial variable and an averaging scheme in the delay variable. We compare a uniform mesh to a nonuniform mesh and give numerical results which indicate that the non-uniform mesh, which gives a better …
-
Finite Sample Bounds and Path Selection for Sequential Monte Carlo
… conditions under which SMC provides a randomized approximation scheme, showing how to choose the number of of particles and Markov kernel transitions at each SMC step in order to ensure an accurate approximation with bounded error. These conditions rely on the sequence of SMC interpolating …
-
One-Dimensional Fractal Wave Equations
… and obtain estimates for the convergence of this approximation scheme.
Page 1 of 4