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 121 for “"Polynomial Approximation"”.
-
Monotonio polynomial approximation
Not available
-
Polynomial approximation in weighted spaces
One of the most important problems in Approximation Theory is to connect the rate with which a function can be approximated and the smoothness of this function. The goal is to show direct and inverse estimates in terms of some measure of smoothness. Typically, results are of the following type: ``a …
-
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.
-
Polynomial Approximation of a Magnetization Curve
Developments in the production, distribution and control of electrical energy depend very largely on the correct knowledge and understanding of the laws representing the relation of electric current to magnetism. Modern developments in electrical engineering, particularly in the areas of electronic …
-
Polynomial approximation method for stochastic programming.
… the stochastic decomposition (SD) and stochastic approximation (SA), is poor in practice. This thesis replaces the objective function and constraints with their polynomial approximations. That is because polynomial counterpart has the following benefits: first, the polynomial approximation will …
-
Filtered polynomial approximation on the sphere
Localised polynomial approximations on the sphere have a variety of applications in areas such as signal processing, geomathematics and cosmology. Filtering is a simple and effective way of constructing a localised polynomial approximation. In this thesis we investigate the localisation properties …
-
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 …
-
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 …
-
A polynomial approximation to the inverse of a matrix.
We develop a surprisingly accurate polynomial approximation to the inverse of a large matrix, i.e. p(A) ⇡ A1. This polynomial is implemented using the roots of the GMRES polynomial, or harmonic Ritz values, and can be used to solve multiple right-hand sides as well as trace estimates to the inverse …
-
Orthogonal Polynomial Approximation in Higher Dimensions: Applications in Astrodynamics
We propose novel methods to utilize orthogonal polynomial approximation in higher dimension spaces, which enable us to modify classical differential equation solvers to perform high precision, long-term orbit propagation. These methods have immediate application to efficient propagation of catalogs …
-
Uniform polynomial approximation of even and odd functions on symmetric intervals
… two different ways, each using only one uniform polynomial approximation. It is of practical importance to know which method of evaluation takes fewer arithmetic operations. This is a special case of a more general problem, which is concerned with the optimal subdivision of the interval of …
-
Efficient Methods for Multidimensional Global Polynomial Approximation with Applications to Random PDEs
… ways to overcome the challenges associated with polynomial approximation and integration of smooth functions depending on a large number of inputs. We are motivated by the problem of forward uncertainty quantification (UQ), whereby inputs to mathematical models are considered as random variables. …
-
The Effects of Polynomial Approximation in Feedfoward Compensation of Control Systems With Time Delay.
… cope with this problem. The Pade' method of polynomial approximation is used to formulate a number of transfer functions which can be used in the two feedforward compensation schemes. To choose the best transfer function for a particular problem, a minimum integral square error analysis …
-
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 …
-
Three Body Interactions of Rare Gas Solids Calculated Within the Einstein Model
… approximate, averaging approach is based on a polynomial approximation of the three-body term. The polynomial approximation can be developed as a function of the symmetry coordinates of a triangle displaced from its average geometry and also as a function of the Cartesian zero point …
-
Reservoir Flooding Optimization by Control Polynomial Approximations
… production optimization problems, using polynomial approximation techniques. The methods project the original infinite dimensional controls space into a polynomial subspace. Our contribution includes new parameterization formulations using natural polynomials, orthogonal Chebyshev …
Page 1 of 7