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 27 for “"Chebyshev approximation"”.
-
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 …
-
Methods of Chebyshev approximation
This paper deals with methods of Chebyshev approximation. In particular polynomial approximation of continuous functions on a finite interval are discussed. Chapter I deals with the existence and uniqueness of Chebyshev or C-polynomials. In addition, some properties of the extremal points of the …
-
Algorithms for rational Chebyshev approximation
… in numerical analysis is to obtain a convenient approximation to a prescribed function. Rational approximating functions are frequently selected for this purpose. This thesis is a survey of several methods that have been proposed for obtaining best rational Chebyshev approximations to functions …
-
Chebyshev approximation by piecewise continuous functions
This paper discusses the following problem of approximation theory: a continuous function f(x) is to approximated over an interval alpha </= x </= B by N not necessarily connected polynomials of a given degree n, in such a way that the maximum error magnitude is a minimum. Each polynomial is …
-
Chebyshev approximation for non-recursive digital filters
… is presented. The algorithm obtains the optimum Chebyshev approximation on separate intervals corresponding to pass and/or stop bands, and is capable of designing very long filters. This approach allows the exact specification of arbitrary band-edge frequencies as opposed to previous algorithms …
-
Chebyshev Approximation of Discrete polynomials and Splines
… an integer processor. In many applications, Chebyshev approximation with polynomials and splines is useful in representing a stream of data or a function. Because the impulse/summation approach is developed for discrete systems, some aspects of traditional continuous approximation are not …
-
Chebyshev approximation with applications to the numerical solution of differential equations
Approximation with respect to what is now known as the Chebyshev norm was proposed by Laplace (1799) in a study of the approximate solution of inconsistent linear equations. However, the first systematic investigation of the problem was carried out by Chebyshev (1854, 1859, 1881). The mainstream of …
-
The Role of The Kolmogoroff Condition in The Characterization of Best Chebyshev Approximation of R('n)-Valued Continuous-Functions
Made available in DSpace on 2014-12-11T18:23:54Z (GMT). No. of bitstreams: 1 7310043.pdf: 2259609 bytes, checksum: f8f285bc98fdbc7497b6d0e58a2346ca (MD5) Previous issue date: 1972
-
Chebyshev approximate solution for stiff problems
<p>Chebyshev polynomial and collocation methods are adapted to solve general ordinary differential equations ( initial-value problems and boundary-value problems ). Approximate solutions of initial-value problems are obtained in step-by-step fasion. the solutions have minimax absolute error in the …
-
Existence and uniqueness of best approximants, with numerical applications
… which comprises both discrete and continuous Chebyshev approximation. Part II of the thesis contains numerical applications to the approximation of functions, data analysis, mathematical modelling, and optimization. Chapter 7 deals with a modified exchange algorithm for Chebyshev …
-
Regularized weighted Chebyshev approximations for support estimation
… analysis 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 …
-
Partially evaluating MATLAB
… in various programs, from the relatively simple Chebyshev approximation and Lagrange Interpolation codes (with speed-ups of up to 100%) to the several different Ordinary Differential Equations solvers (speed-ups range from 57% to 568%) to a Computational Fluid Dynamics solver, which was sped up …
-
Indexing spatiotemporal trajectories with Chebyshev polynomials
… which is called the minimax polynomial. Minimax approximation is particularly meaningful for indexing because in a branch-and-bound search (i.e., for finding nearest neighbours), the smaller the maximum deviation, the more pruning opportunities there exist. In general, among all the polynomials …
-
Tchebycheff approximation
Thesis (M.A.)--Boston University
-
Linear programming and the calculation of maximum norm approximations
… examines methods for the solution of a number of approximation problems which include multivariate approximation and the approximate solution of differential equations. After a brief discussion of the literature in Chapter 1, the best linear Chebyshev approximation prob l em is discussed in …
-
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, …
-
Design of a Direct-Modulation Transmitter with Self-Optimizing Feedback and a Highly Linear, Highly Reconfigurable, Continuously-Tunable Active-RC Baseband Filter for Multiple Standards
… Resistive/capacitive networks select between the Chebyshev and Inverse Chebyshev approximation types. Also, a new stability metric for biquads, Minimum Acceptable Phase Margin (MAPM), is presented and discussed in the context of filter compensation and passband ripple considerations. Experimental …
-
Linear programming and best approximation
… in this paper is that of finding a best approximation to a given real-valued function f(x) over a continuum by means of finding a best approximation over a discrete set of points. We are also seeking to find a numerical method of finding a best approximation over our discrete set of …
-
Minimax lower bounds in high order tensor models with applications to neuroimaging
Minimax principle is a very useful concept in mathematical statistics for finding optimal estimators. While unbiasedness and invariance principle are useful tools for finding optimal estimators, they are often restrictive and in certain cases may not even yield optimal estimators see Ferguson …
-
Adaptive Iterative Methods for Nonlinear Equations, Nonlinear Eigenvalue Problems, and Deep Learning
… eigenvalue problems based on a combined rational-Chebyshev approximation and linearization. The method places shifts automatically and refines them during the iteration, reducing the manual spectral information required by shift-and-invert and rational-Krylov projection methods. A reduced subspace …
Page 1 of 2