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 31 for “"Approximation of functions"”.
-
Norm Preserving Approximation of Functions
… in DSpace on 2014-12-11T18:24:13Z (GMT). No. of bitstreams: 1 7511754.pdf: 2327476 bytes, checksum: 92f9fddc2c17d3b4c6d1daeefc28f16e (MD5) Previous issue date: 1974
-
The approximation of functions with branch points
… years Pade approximants have proved to be one of the most useful computational tools in many areas of theoretical physics, most notably in statistical mechanics and strong interaction physics. The underlying reason for this is that very often the equations describing a physical process are so …
-
Neural Networks and Nonlinear Optimisation Applied to the Approximation of Functions
The literature abounds with papers on the subject of function approximation using neural networks. Many of these attempt to improve some aspect of the approximation by imposing a constraint, or introducing a new algorithm. <br></br> The underlying strategy of our work has been to attempt to pull …
-
Degree Of Aproximation Of Hölder Continuous Functions
… to Utkal University proved results on degree of approximation of functions by operators associated with their Fourier series. In this dissertation, we consider degree of approximation of functions in Hα,ρ by different operators. In Chapter 1 we mention basic definitions needed for our work. In …
-
Detection And Approximation Of Function Of Two Variables In High Dimensions
… originates from the deterministic algorithm of DeVore, Petrova, and Wojtaszcsyk for the detection and approximation of functions of one variable in high dimensions. We propose a deterministic algorithm for the detection and approximation of function of two variables in high dimensions.
-
Best rotated minimax approximation
In this dissertation we consider the minimax approximation of functions f(x) E"C[O, l] rotated about the origin, and the characterization of the optimal rotation, a*, of f in the sense of least minimax error over all possible rotations. The paper divides naturally into two sections: a) Existence, …
-
Efficient multivariate approximation with transformed rank-1 lattices
We study the approximation of functions defined on different domains by trigonometric and transformed trigonometric functions. We investigate which of the many results known from the approximation theory on the d-dimensional torus can be transfered to other domains. We define invertible …
-
Applications of entire function theory to an imbedding theorem for differentiable functions of several real variables
The subject of this thesis is the fractional order Sobolev space, H[superscript]r[subscript]p, as considered by Nikol'skii; the goal is to demonstrate an imbedding theorem for H[superscript]r[subscript]p analogous to the classical imbedding theorem for W[superscript]m[subscript]p which was first …
-
Rational approximations, with applications to the approximate solution of systems of ordinary differential equations
<p>Approximation of functions by quotients of polynomials, called rational approximation, has attracted investigation since the middle 1800's. Recently the advent of high-speed computers has encouraged this interest, as previously impractical applications have gained value by accessibility. One …
-
Adaptive triangulations
In this dissertation, we consider the problem of piecewise polynomial approximation of functions over sets of triangulations. Recently developed adaptive methods, where the hierarchy of triangulations is not fixed in advance and depends on the local properties of the function, have received …
-
Variations on methods of Lorentz and Lorentz for dimensions two and three
This dissertation will address the problem of polynomial interpolation: finding a polynomial P(x), which goes through points pi with multiplicity mi at each point. Although polynomials are the building block for many numerical methods, such as finite elements and splines, and theorems about …
-
Algorithms for polynomial and rational approximation
<p>Robust algorithms for the approximation of functions are studied and developed in this thesis. Novel results and algorithms on piecewise polynomial interpolation, rational interpolation and best polynomial and rational approximations are presented.</p> <p>Algorithms for the extension of Chebfun, …
-
Algorithms for trigonometric polynomial and rational approximation
… new numerical algorithms for approximating functions by trigonometric polynomials and trigonometric rational functions. We begin by reviewing trigonometric polynomial interpolation and the barycentric formula for trigonometric polynomial interpolation in Chapter 1. Another feature of this …
-
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 …
-
Existence and uniqueness of best approximants, with numerical applications
Part I of the thesis deals with existence and uniqueness theorems. Strengthening a result due to J. Blatter, it is proved in chapter 3 that a normed linear space is complete if every closed, bounded, and convex set is proximinal. It is also shown, that in a semi-reflexive, locally convex, real …
-
PHYSICS-INFORMED MACHINE LEARNING: THEORY, ALGORITHMS AND APPLICATIONS
The remarkable potential of deep learning in areas from computer vision to natural language processing has now found profound implications in modeling and simulating physical systems. Central to these advancements is the emerging field of physics-informed machine learning, a fusion of physical …
-
Quantum Algorithms for Scientific Computation
This thesis presents a mathematical analysis of several quantum algorithms and their applications in scientific computation. It is organized into two parts. The first part investigates quantum algorithms for the quantum simulation problem, with particular emphasis on methods based on …
-
Rigorous high-precision enclosures of fixed points and their invariant manifolds
The well established concept of Taylor Models is introduced, which offer highly accurate $C^{0}$ enclosures of functional dependencies, combining high-order polynomial approximation of functions and rigorous estimates of the truncation error, performed using verified arithmetic. The focus of this …
Page 1 of 2