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 4075 for “"approximation"”.
-
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 …
-
Orthogonalität und beste Approximation
… the present thesis is the determination of good approximations through orthonormal basis expansion. This method is based on fundamental mathematical ideas which transcend traditional boundaries between disciplines. In recent decades the method turned out to be exceptionally viable and (even …
-
Approximation polynomiale pondérée généralisée
… est d'une part, la résolution du problème d'approximation polynomiale pondérée généralisée dans les LP(R*+) (1 ~ p < ?)ou Co (R*+) (p = ?) et d'autre part l'étude du problème de la non-totalité dans ces mêmes espaces.
-
Algebraische Approximation von Kählermannigfaltigkeiten
Eine kompakte komplexe Mannigfaltigkeit heißt algebraisch approximierbar, wenn sie beliebig kleine projektive Deformationen besitzt. Eine natürliche Fragestellung ist, ob jede kompakte Kählermannigfaltigkeit algebraisch approximierbar ist. Während dies in Dimension 2 nach den Arbeiten von Kodaira …
-
Anisotropic piecewise linear approximation
… the design of new partitioning methods for the approximation of a function f on a domain C Rd, d 2, by piecewise linear functions, and the derivation of errors estimations in Lp-norm and W1 p - seminorm. In the two-dimensional setting, we develop a construction of a sequence of anisotropic …
-
Image Approximation using Triangulation
An image is a set of quantized intensity values that are sampled at a finite set of sample points on a two-dimensional plane. Images are crucial to many application areas, such as computer graphics and pattern recognition, because they discretely represent the information that the human eyes …
-
Sparse Approximation In Banach Spaces
<p>The sparse approximation problems ask for complete recovery of functions in a given space that are supported by few of the elements of a system of generators for the space or for approximate recovery that involves a limited number of generators.</p> <p>Traditionally, these problems have been …
-
Consensus-type stochastic approximation algorithms
… control is achieved by designing stochastic approximation algorithms. In the setup, the regime-switching process (the Markov chain) contains a rate parameter</p> <p>"Ε> 0 in the transition probability matrix that characterizes how frequently the topology switches. On the other hand, the …
-
Some Topics in Diophantine Approximation
L'abstract è presente nell'allegato / the abstract is in the attachment
-
Semilineare Approximation in der Bildrekonstruktion
In der Bildverarbeitung spielen Segmentierungsalgorithmen, bei denen die Art der zu segmentierenden Menge schon im Voraus festgelegt werden kann und nur noch ihre Größe und Lage angepasst werden muss, eine eher untergeordnete Rolle. Gründe hierfür sind vor allem komplizierte Zielfunktionen und …
-
Best Approximation With Geometric Constraints
<p>This is a study of best approximation with certain geometric constraints. Two major problem areas are considered: best L<sub>p</sub> approximation to a function in L<sub>p </sub>(0,1) by convex functions, (m, n)-convex functions, (m, n)-convex functions and (m, n)-convex splines, for 1 < p < ∞ , …
-
On the Kirkwood superposition approximation
<p>"When the Kirkwood superposition approximation for the triplet distribution function is used in the Born-Green equation for the pair distribution function of a liquid, the fourth virial coefficient is given incorrectly. In view of this, two suggestions for improving the approximation have been …
-
Approximation Algorithms for Geometric Networks
The main contribution of this thesis is approximation algorithms for several computational geometry problems. The underlying structure for most of the problems studied is a geometric network. A geometric network is, in its abstract form, a set of vertices, pairwise connected with an edge, such that …
-
Approximation of Multiobjective Optimization Problems
… problem, to efficiently obtain a ``good'' approximation to the entire solution space with ``few'' solutions. This has been the underlying goal in much of the research in the multiobjective area, with many heuristics proposed for this purpose, typically however without any performance …
-
Norm Preserving Approximation of Functions
Made available in DSpace on 2014-12-11T18:24:13Z (GMT). No. of bitstreams: 1 7511754.pdf: 2327476 bytes, checksum: 92f9fddc2c17d3b4c6d1daeefc28f16e (MD5) Previous issue date: 1974
-
On Approximation of Analytic Functions
Made available in DSpace on 2014-12-05T21:49:59Z (GMT). No. of bitstreams: 1 0005962.pdf: 1669648 bytes, checksum: 50f9d29984eb3a95e4745fe57a0f338d (MD5) Previous issue date: 1953
Page 1 of 204