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 15566 for “"Approximation"”.
-
GCS approximation
The discipline of Computer Aided Geometric Design (CAGD) deals with the computational aspects of geometric objects. This thesis is concerned with the construction of one of the most primitive geometric objects, curves. More specifically, it relates to the construction of a high quality planar …
-
Tchebycheff approximation
Thesis (M.A.)--Boston University
-
Monotonio polynomial approximation
Not available
-
Direct Chebyshev approximation
The Approximation Problem and specifically, "direct" rational Chebyshev approximation is discussed. A brief summary is made of "direct" Chebyshev approximation. The remainder of the thesis is devoted to various aspects of a "Remes-type" Algorithm for rational Chebyshev approximation, as proposed by …
-
Interactive spline approximation
… spline basis functions in solving least squares approximation problems is investigated. The question as to which are appropriate basis functions to use is discussed along with the reasons why the final choice was made. The Householder transformation method for solving the fixed knot spline …
-
Sparse image approximation
… thesis addresses the problem associated with the approximation of signals as linear superposition of elementary components often called 'atoms'. `After highlighting the limitations of using only orthogonal elements, approximation technique is extended to consider the selection of atoms from a …
-
The peratization approximation
The peratization program is investigated in the field of singular potential scattering, as an analog to the unrenormalizable field theories. We review some known results on the scattering amplitude, and establish the applicability of the commonly used regularizations. A general argument for …
-
Orientation preserving approximation
… we study the following problem on constrained approximation. Let f be a continuous mapping defined on a bounded domain with piecewise smooth boundary in R^n and taking values in R^n. What are necessary and sufficient conditions for f to be uniformly approximable by C^1-smooth mappings with …
-
Approximation and elections
… cases of these problems that there exist approximation algorithms that can find a good solution with a reasonable amount of computation. That is, while a voting system may seem “resistant” to a particular form of manipulation as described by previous research, it may be that the problem is …
-
Interpolation and Approximation
… the second chapter a theorem about the uniform approximation to continuous functions is proven. Then the best approximation and the least squares approximation (a special case of best approximation) is discussed. In the third chapter orthogonal polynomials as discussed as well as bounded linear …
-
On stochastic approximation
… is the desired level of response. A stochastic approximation is a sequential estimation procedure where future observation points are determined on the basis of past information. The two most-discussed procedures for the problem described are the Robbins-Monro (R-M) procedure and the up-and-down …
-
Enhanced Uniform Manifold Approximation and Projection via Simultaneous Perturbation Stochastic Approximation
… processing, e.g. clustering. Uniform Manifold Approximation and Projection (UMAP) (McInnes et al. 2020) is a state-of-the-art non-linear dimension reduction algorithm that constructs a topologically motivated graph representation of the data, before optimizing the low-dimensional representation …
-
Gaussian approximation and bootstrap approximation in high dimensional inference, beyond linear statistics
… for high-dimensional data, focusing on Gaussian approximation (GA) and bootstrap. Thresholding statistics, which sums selectively thresholded and standardized components, are shown to offer greater power for global hypothesis testing and multiple hypothesis testing, especially in detecting sparse …
-
Topics in sparse approximation
Sparse approximation problems request a good approximation of an input signal as a linear combination of elementary signals, yet they stipulate that the approximation may involve only a few of the elementary signals. This class of problems arises throughout applied mathematics, statistics, and …
-
Approximation of Invariant Subspaces
<p>For a real number α [alpha] the Dirichlet-type spaces 𝔇<sub>α</sub> [script D sub alpha] are the family of Hilbert spaces consisting of all analytic functions f(z) = ∑<sub>n=0</sub><sup>∞</sup>[sum over n equals zero to infinity] ˆf(n) [f hat of n] z<sup>n</sup> [z to the n] defined on the open …
-
Topics in Diophantine Approximation
We discuss some topics about number theory including continued fractions, Hausdorff measure, $p$-adic analysis and analytic number theory in the preliminary knowledge part. In the next section, we investigate the problem of how well points in finite dimensional $p$-adic solenoids can be …
Page 1 of 779