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 347 for “"Approximation methods"”.

  1. Variational Piecewise Approximation Methods

    Consideration of the function approximation problem leads to the treatment of two distinct applications. One application involves the approximation of an analytical function f(x) by an approximate function y(x) over some finite region [a,b]. The second application involves the fitting of a set of …

    marquette Repository record for Variational Piecewise Approximation Methods (opens in a new tab)

  2. Process big data using approximation methods

    … consuming. Meanwhile, it has been shown that approximation method with probabilistic guarantee is sufficient in many real applications. In this thesis, we apply sampling and sketching techniques to obtain high-quality approximation results for four important queries. Firstly, we study the …

    unsw Repository record for Process big data using approximation methods (opens in a new tab)

  3. Uniform behavior of stochastic approximation methods

    Thesis (Ph. D.)--Michigan State University. Department of Statistics and Probability, 1996

    msu Repository record for Uniform behavior of stochastic approximation methods (opens in a new tab)

  4. Approximation methods in relativistic eigenvalue perturbation theory

    … this dissertation, three questions, concerning approximation methods for the eigenvalues of quantum mechanical systems, are investigated: (i) What is a pseudo-Hermitian Hamiltonian, and how can its eigenvalues be approximated via numerical calculations? This is a fairly broad topic, and the …

    must-thes Repository record for Approximation methods in relativistic eigenvalue perturbation theory (opens in a new tab)

  5. Solid Angle Measure Approximation Methods for Polyhedral Cones

    … this measure are unknown. Consequently, devising methods to estimate this quantity is imperative. In this dissertation, we endeavor to enhance our understanding of solid angle measures and provide valuable insights into the efficacy of various approximation techniques. Ribando and Aomoto …

    uky-thes Repository record for Solid Angle Measure Approximation Methods for Polyhedral Cones (opens in a new tab)

  6. Approximation methods for output regulation of nonlinear systems

    The goal of this work is to develop an iterative method for obtaining approximate feedback laws for solving problems of geometric output regulation for a nonlinear system governed by Burgers' equation. We also present a method for solving the linearized output regulation problem which provides …

    ttu Repository record for Approximation methods for output regulation of nonlinear systems (opens in a new tab)

  7. Error estimates for stabilized approximation methods for semigroups

    … work we analyze error estimates for rational approximation methods, and their stabilizations, for strongly continuous semigroups. Chapter 1 consists of a brief survey of time discretization methods for semigroups. In Chapter 2, we demonstrate a new method for obtaining convergent …

    lsu-thes Repository record for Error estimates for stabilized approximation methods for semigroups (opens in a new tab)

  8. Convex approximation methods for nonlinear model predictive control

    … found in sequential quadratic programming (SQP) methods for NMPC problems. Its main advantage is a convergence speedup, i.e. local quadratic convergence, under some assumptions compared to a quasi-Newton or a generalized Gauss-Newton approach.<br>A second new technique, called sequential convex …

    freiburg-diss Repository record for Convex approximation methods for nonlinear model predictive control (opens in a new tab)

  9. Stochastic Simulation: New Stochastic Approximation Methods and Sensitivity Analyses

    … we propose two new types of stochastic approximation (SA) methods and study the sensitivity of SA and of a stochastic gradient method to various input parameters. First, we summarize the most common stochastic gradient estimation techniques, both direct and indirect, as well as the two …

    maryland Repository record for Stochastic Simulation: New Stochastic Approximation Methods and Sensitivity Analyses (opens in a new tab)

  10. Fixed point approximation methods for nonexpansive mappings: optimization problems

    En esta tesis, se estudia los problemas que aparecen en la conexión entre las teorías de operadores monótonos y aplicaciones no expansivas tanto en espacios lineales como no lineales. El Capítulo 1 está dedicado a diferentes enfoques para aproximar puntos

    sevilla Repository record for Fixed point approximation methods for nonexpansive mappings: optimization problems (opens in a new tab)

  11. Approximation Methods for Convolution Operators on the Real Line

    … is concerned with the applicability of several approximation methods (finite section method, Galerkin and collocation methods with maximum defect splines for uniform and non uniform meshes) to operators belonging to the closed subalgebra generated by operators of multiplication bz piecewise …

    qucosa-diss

  12. Approximation Methods for Two Classes of Singular Integral Equations

    … of two parts. In the first part approximate methods for multidimensional weakly singular integral operators with operator-valued kernels are investigated. Convergence results and error estimates are given. There is considered an application of these methods to solving radiation transfer …

    qucosa-diss

  13. Sensitivity analysis and approximation methods for general eigenvalue problems

    … sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is …

    vt Repository record for Sensitivity analysis and approximation methods for general eigenvalue problems (opens in a new tab)

  14. New approximation methods for solving binary quadratic programming problem

    … developed in the data mining field. A 2-approximation algorithm for the clustering problem is presented. Numerical results based on the new relaxation model and the proposed algorithm are reported. The last Chapter mainly discusses some theoretical results we put forward on the derived …

    uiuc Repository record for New approximation methods for solving binary quadratic programming problem (opens in a new tab)

  15. Kernel-based Approximation Methods with Application in Uncertainty Quantification

    In the thesis "Kernel-based Approximation Methods with Applications in Uncertainty Quantification", we motivate the presented results by a partial differential equation that depends on random inputs, which we will therefore model using a random field. In applications, this random field is usually …

    bayreuth Repository record for Kernel-based Approximation Methods with Application in Uncertainty Quantification (opens in a new tab)

  16. Functional approximation methods for solving stochastic control problems in finance

    … a numerical method that combines functional approximations and dynamic programming to solve high-dimensional discrete-time stochastic control problems under general constraints. The method relies on three building blocks: first, a quasi-random grid and the radial basis function method are …

    texas Repository record for Functional approximation methods for solving stochastic control problems in finance (opens in a new tab)

  17. Highly Accurate Random Phase Approximation Methods With Linear Time Complexity

    … the so called double-hybrid density functional approximations become prohibitively expensive. Here, the random phase approximation, which is known to yield such higher accuracy results has been developed from a theory applicable only to molecules on the tens of atoms scale into a highly accurate …

    lmu-germany Repository record for Highly Accurate Random Phase Approximation Methods With Linear Time Complexity (opens in a new tab)

Page 1 of 18