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 41 for “"polynomial approximation"”.

  1. Chaos control using local polynomial approximation

    … of chaos control was [CCdF99], in which a polynomial model is used. This dissertation proposes using local Taylor polynomial models as a basis for chaos control.

    cape-town Repository record for Chaos control using local polynomial approximation (opens in a new tab)

  2. 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 …

    mit Repository record for Faster fully polynomial approximation schemes for Knapsack problems (opens in a new tab)

  3. Subnormal operators, hyponormal operators, and mean polynomial approximation

    … belong to the (norm) closure of the (analytic) polynomials. J. Thomson in [T] has shown that the set of bounded point evaluations, <i>bpe μ</i>, for <i>P<sup>t</sup>(μ)</i> is a nonempty simply connected region <i>G</i>. We prove that the measure μ restricted to the boundary of <i>G</i> is …

    vt Repository record for Subnormal operators, hyponormal operators, and mean polynomial approximation (opens in a new tab)

  4. Some aspects of discrete least squares polynomial approximation

    … investigate the method of discrete least squares polynomial approximation and to provide an extension of the method which would allow for a reasonable data-fit while lowering the number of undetermined coefficients. Also, computer programs were to be provided so that one may use the extended …

    vt Repository record for Some aspects of discrete least squares polynomial approximation (opens in a new tab)

  5. Polynomial approximation and Carleson measures on a general domain and equivalence classes of subnormal operators

    … study the problem of when P, the set of analytic polynomials, is dense in the Hardy space H<sup>t</sup>(G) or the Bergman space L<sup>t</sup><sub>n</sub>G, where G is a bounded domain and t ∈ [1,∞). Characterizations of special domains are also given. In Chapter 3 we generalize the definition of a …

    vt Repository record for Polynomial approximation and Carleson measures on a general domain and equivalence classes of subnormal operators (opens in a new tab)

  6. Regularized weighted Chebyshev approximations for support estimation

    … relies on introducing a new weighted Chebyshev polynomial approximation method, jointly optimizing the bias and variance components of the risk, and combining the weighted minmax polynomial approximation method with discretized semi-infinite programming solvers. Such a setting allows for casting …

    uiuc Repository record for Regularized weighted Chebyshev approximations for support estimation (opens in a new tab)

  7. Optimal entropy estimation on large alphabet: fundamental limits and fast algorithms

    … entropy estimation scales. The apparatus of best polynomial approximation plays a key role in both the construction of optimal estimators and, via a duality argument, the minimax lower bound.

    uiuc Repository record for Optimal entropy estimation on large alphabet: fundamental limits and fast algorithms (opens in a new tab)

  8. 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 …

    mit Repository record for A multiscale approximation algorithm for the cardinality constrained knapsack problem (opens in a new tab)

  9. Variable-Complexity Response Surface Approximations For Wing Structural Weight in HSCT Design

    A procedure for generating and using a polynomial approximation to wing bending material weight of a High Speed Civil Transport (HSCT) is presented. Response surface methodology is used to fit a quadratic polynomial to data gathered from a series of structural optimizations. Several techniques are …

    vt Repository record for Variable-Complexity Response Surface Approximations For Wing Structural Weight in HSCT Design (opens in a new tab)

  10. Understanding neural network sample complexity and interpretable convergence-guaranteed deep learning with polynomial regression

    … dimension and its width. Then, we introduce polynomial regression as a proxy for neural networks through a polynomial approximation of their activation function. This method operates in the lifted space of tensor products of input variables, and is trained by simply optimizing a standard …

    mit Repository record for Understanding neural network sample complexity and interpretable convergence-guaranteed deep learning with polynomial regression (opens in a new tab)

  11. Advances in Copula Estimation and Distribution Theory

    … estimation methodologies, including Bernstein’s polynomial approximation, are proposed and criteria for the selection of their tuning parameters are provided. These four approaches were found to produce similar density estimates, which validates their suitability. Moreover, the copula associated …

    uwo Repository record for Advances in Copula Estimation and Distribution Theory (opens in a new tab)

  12. Boundary method-based domain decomposition on multiprocessors

    … of interface values. The HPA (harmonic polynomial approximation), including the AHPA (augmented HPA), has been identified as a preferred boundary method to be used with BMDD, based on our analysis and numerical experiments. A new parallel Poisson solver has been obtained, which consists …

    uiuc Repository record for Boundary method-based domain decomposition on multiprocessors (opens in a new tab)

  13. Integral Equation Methodologies for the Signal Integrity Analysis of PCB and Interconnect Structures in Layered Media From DC to Multi-Ghz Frequencies

    … media Green's function based on a Chebyshev polynomial approximation of the spectrum of the spatial Green's function is introduced capable of handling arbitrary, lossy, layered substrates. A model compatible with the CG-FFT methodology is proposed for efficiently handling the frequency …

    uiuc Repository record for Integral Equation Methodologies for the Signal Integrity Analysis of PCB and Interconnect Structures in Layered Media From DC to Multi-Ghz Frequencies (opens in a new tab)

  14. Immersed Discontinuous Galerkin Methods for Acoustic Wave Propagation in Inhomogeneous Media

    … Galerkin finite element formulation with polynomial approximation on elements that contain one fluid while on interface elements containing more than one fluid they use specially-built piecewise polynomial shape functions that satisfy appropriate interface jump conditions. The finite …

    vt Repository record for Immersed Discontinuous Galerkin Methods for Acoustic Wave Propagation in Inhomogeneous Media (opens in a new tab)

  15. Aircraft Multidisciplinary Design Optimization using Design of Experiments Theory and Response Surface Modeling Methods

    … and least squares surface fitting to yield polynomial approximation models. The second method, in which only a preliminary investigation has been performed, uses Bayesian statistics and an adaptation of the Kriging process in Geostatistics to create exponential function-based interpolating …

    vt Repository record for Aircraft Multidisciplinary Design Optimization using Design of Experiments Theory and Response Surface Modeling Methods (opens in a new tab)

  16. Polynomial methods in statistical inference: Theory and practice

    … of samples. In this dissertation, we apply the polynomial methods to several statistical questions with rich history and wide applications. The goal is to understand the fundamental limits of the problems in the large domain regime, and to design sample optimal and time efficient algorithms with …

    uiuc Repository record for Polynomial methods in statistical inference: Theory and practice (opens in a new tab)

Page 1 of 3