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 201 for “"approximation scheme"”.
-
A VARIATIONAL APPROXIMATION SCHEME FOR RADIAL POLYCONVEX ELASTICITY THAT PRESERVES THE POSITIVITY OF DETERMINANTS
… conservation laws. We construct a variational approximation scheme that decreases the total mechanical energy and at the same time leads to physically realizable motions that avoid interpenetration of matter. In addition, we consider a variational scheme developed by S. Demoulini, D. Stuart and …
-
Discrete Approximations to Time-changed Brownian Motions
We give a general discrete approximation scheme of time-changed Brownian motions on $\mathbb{R}^d$. Our approximation scheme works for any smooth measure with full quasi-support on $\mathbb{R}^d$ with suitable initial distributions. Under some mild conditions on the smooth measure, the discrete …
-
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 …
-
Approximation algorithms for minimum knapsack problem
… one. In this thesis we study several existing approximation algorithms for the minimization version of the problem and propose a scaling based fully polynomial time approximation scheme for the minimum knapsack problem. We compare the performance of this algorithm with existing algorithms. Our …
-
Development of a Meshfree and Matrix-Free Method for Compressible Computational Fluid Dynamics
… between an implicit sequential function approximation scheme and an explicit Runge-Kutta time marching scheme. In the sequential function approximation scheme, a solution is improved incrementally as a summation of Gaussian radial basis functions (RBFs) which have been optimized using a …
-
Numerical Case Study of an Atom-Photon Interaction in a Cavity Exploring Quantum Control
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 by …
-
Scheduling Fork-Join Structures in Parallel Systems
… results include an Efficient Polynomial Time Approximation Scheme (EPTAS) for scheduling to homogeneous systems, as well as more practical approximations and polynomial time algorithms for further sub-cases. In addition to classifying the problem in regards to approximability, the EPTAS …
-
Various classes of stochastic differential equations: existence, uniqueness, and approximation /
… convergence rates for the backward Euler approximation scheme, and devises high-quality estimators for the Hurst index. Concrete examples of classical models adhering to theorem conditions are provided for practical applicability. Additionally, the thesis investigates one-dimensional SDEs …
-
Price-setting Problems and Matroid Bayesian Online Selection
… order, there is a polynomial-time approximation scheme for maximizing the seller's revenue. We also show that such a result is impossible for the related case when the underlying constraints correspond to a graphic matroid. In particular, it is PSPACE-hard to approximate the …
-
Approximation in batch and multiprocessor scheduling
… to find polynomial time algorithms with provable approximation guarantee, preferably in an on-line setting. <br> <br>In the first part of this thesis, we consider batch scheduling problems for the case that each job has a deadline, and hence two jobs may be added to the same batch if their due …
-
Parameterized complexity and polynomial-time approximation schemes
… in dealing with NPhard problems, among them are approximation algorithms and parameterized algorithms. The study of approximation algorithms tries to find good enough solutions instead of optimal solutions in polynomial time, while parameterized algorithms try to give exact solutions when a …
-
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.
-
The complexity of counting problems
… some partial results are given.</p><p>Turning to approximation, a polynomial-time uniform generator for forests of dense graphs is given. Using this, a fully polynomial randomised approximation scheme (fpras) for the number of forests of a dense graph is created. This leads to the following …
-
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 …
-
Long term stability of numerical solutions of differential equations
… computer. Many of which require the efficient approximation of the solution to some governing equation. Unfortunately, the existing software for many applications is not adequate for the demands being placed upon it. In this paper, we consider the problem of approximating the solution to an …
-
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 …
-
Approximation Schemes for Machine Scheduling
… P=NP. There is, however, a polynomial time approximation scheme (PTAS) for machine scheduling, that is, a family of approximation algorithms with ratios arbitrarily close to one. Whether a problem admits an approximation scheme or not is a fundamental question in approximation theory. In the …
-
FPRAS Approximation of the Matrix Permanent in Practice
… sizes, and significant research has been done on approximation algorithms for the matrix permanent. We present an implementation and detailed runtime analysis of one such Markov Chain Monte Carlo (MCMC) based Fully Polynomial Randomized Approximation Scheme (FPRAS) for the matrix permanent which …
Page 1 of 11