Multi-Polynomial Higher Order Neural Network Group Models (MPHONNG) program developed by the author will be studied in this thesis. The thesis also investigates the use of MPHONNG for financial data and rainfall data simulation and prediction. The MPHONNG is combined with characteristics of Polynomial function, Trigonometric polynomial function and Sigmoid polynomial function. The models are constructed with three layers Multi-Polynomial Higher Order Neural Network and the weights of the models are derived directly from the coefficents of the Polynomial form, Trignometric polynomial form and Sigmoid polynomial form. To the best of the authors knowledge, it is the first attempt to use MPHONNG for financial data and rainfall data simulation and prediction. Results proved satisfactory, and confirmed that MPHONNG is capable of handling high frequency, high order nonlinear and discontinuous data. / Master of Science (Hons)

Изучаются коэффициенты тригонометрического полинома при односторонних ограничениях на отрезках [0, π] и [0, 2π]. Для нечетных тригонометрических полиномов степени не выше двух получены точные верхние и нижние границы первого коэффициента при линейном одностороннем ограничении. Для полиномов более высоких степеней определено поведение максимальных и минимальных возможных значений при одностороннем линейном ограничении. Проведено исследование поведения максимальных и минимальных значений первых коэффициентов синус-полиномов при двусторонних линейных ограничениях. / We study coefficients of a trigonometric polynomial under a one-sided constraint on the intervals [0, π] и [0, 2π]. We obtain sharp upper and lower estimates of the first coefficient of an odd trigonometric polynomial of degree at most two under a linear constraint. For polynomials of higher degree, we find the behavior of maximal and minimal coefficients of a sine-polynomial under two-sided linear constraints.

This thesis is concerned with the numerical solutions of initial value problems with ordinary differential equations and covers single step integration methods. focus is to study the numerical the various aspects of Specifically, its main methods of non-linear integration formula with a variety of means based on the Contraharmonic mean (C.M) (Evans and Yaakub [1995]), the Centroidal mean (C.M) (Yaakub and Evans [1995]) and the Root-Mean-Square (RMS) (Yaakub and Evans [1993]) for solving initial value problems. the applications of the second It includes a study of order C.M method for parallel implementation of extrapolation methods for ordinary differential equations with the ExDaTa schedule by Bahoshy [1992]. Another important topic presented in this thesis is that a fifth order five-stage explicit Runge Kutta method or weighted Runge Kutta formula [Evans and Yaakub [1996]) exists which is contrary to Butcher [1987] and the theorem in Lambert ([1991] ,pp 181). The thesis is organized as follows. An introduction to initial value problems in ordinary differential equations and parallel computers and software in Chapter 1, the basic preliminaries and fundamental concepts in mathematics, an algebraic manipulation package, e.g., Mathematica and basic parallel processing techniques are discussed in Chapter 2. Following in Chapter 3 is a survey of single step methods to solve ordinary differential equations. In this chapter, several single step methods including the Taylor series method, Runge Kutta method and a linear multistep method for non-stiff and stiff problems are also considered. Chapter 4 gives a new Runge Kutta formula for solving initial value problems using the Contraharmonic mean (C.M), the Centroidal mean (C.M) and the Root-MeanSquare (RMS). An error and stability analysis for these variety of means and numerical examples are also presented. Chapter 5 discusses the parallel implementation on the Sequent 8000 parallel computer of the Runge-Kutta contraharmonic mean (C.M) method with extrapolation procedures using explicit assignment scheduling Kutta RK(4, 4) method (EXDATA) strategies. A is introduced and the data task new Rungetheory and analysis of its properties are investigated and compared with the more popular RKF(4,5) method, are given in Chapter 6. Chapter 7 presents a new integration method with error control for the solution of a special class of second order ODEs. In Chapter 8, a new weighted Runge-Kutta fifth order method with 5 stages is introduced. By comparison with the currently recommended RK4 ( 5) Merson and RK5(6) Nystrom methods, the new method gives improved results. Chapter 9 proposes a new fifth order Runge-Kutta type method for solving oscillatory problems by the use of trigonometric polynomial interpolation which extends the earlier work of Gautschi [1961]. An analysis of the convergence and stability of the new method is given with comparison with the standard Runge-Kutta methods. Finally, Chapter 10 summarises and presents conclusions on the topics discussed throughout the thesis.

Soit P(z):=\sum_{\nu=0}^na_\nu z^{\nu}$ un polynôme de degré n et M:=\sup_{|z|=1}|P(z)|.$ Sans aucne restriction suplémentaire, on sait que $|P'(z)|\leq Mn$ pour $|z|\leq 1$ (inégalité de Bernstein). Si nous supposons maintenant que les zéros du polynôme $P$ sont à l'extérieur du cercle $|z|=k,$ quelle amélioration peut-on apporter à l'inégalité de Bernstein? Il est déjà connu [{\bf \ref{Mal1}}] que dans le cas où $k\geq 1$ on a $$(*) \qquad |P'(z)|\leq \frac{n}{1+k}M \qquad (|z|\leq 1),$$ qu'en est-il pour le cas où $k < 1$? Quelle est l'inégalité analogue à $(*)$ pour une fonction entière de type exponentiel $\tau ?$ D'autre part, si on suppose que $P$ a tous ses zéros dans $|z|\geq k \, \, (k\geq 1),$ quelle est l'estimation de $|P'(z)|$ sur le cercle unité, en terme des quatre premiers termes de son développement en série entière autour de l'origine. Cette thèse constitue une contribution à la théorie analytique des polynômes à la lumière de ces questions. / Let P(z):=\sum_{\nu=0}^na_\nu z^{\nu}$ a polynomial of degree n and M:=\sup_{|z|=1}|P(z)|$. Without any additional restriction, we know that $|P '(z) | \leq Mn$ for $| z | \leq 1$ (Bernstein's inequality). Now if we assume that the zeros of the polynomial $P$ are outside the circle $| z | = k$, which improvement could be made to the Bernstein inequality? It is already known [{\bf \ref{Mal1}}] that in the case where $k \geq 1$, one has$$ (*) \qquad | P '(z) | \leq \frac{n}{1 + k} M \qquad (| z | \leq 1),$$ what would it be in the case where $k < 1$? What is the analogous inequality for an entire function of exponential type $\tau$? On the other hand, if we assume that $P$ has all its zeros in $| z | \geq k \, \, (k \geq 1),$ which is the estimate of $| P '(z) |$ on the unit circle, in terms of the first four terms of its Maclaurin series expansion. This thesis comprises a contribution to the analytic theory of polynomials in the light of these problems.

For noiseless sampled data, we describe the close connections between Prony--like methods, namely the classical Prony method, the matrix pencil method and the ESPRIT method. Further we present a new efficient algorithm of matrix pencil factorization based on QR decomposition of a rectangular Hankel matrix. The algorithms of parameter estimation are also applied to sparse Fourier approximation and nonlinear approximation.

Cette thèse vise à la conception de nouveaux algorithmes rapides en calcul numérique via les matrices de Toeplitz. Tout d'abord, nous avons introduit un algorithme rapide sur le calcul de l'inverse d'une matrice triangulaire de Toeplitz en se basant sur des notions d'interpolation polynomiale. Cet algorithme nécessitant uniquement deux FFT(2n) est manifestement efficace par rapport à ses prédécésseurs. ensuite, nous avons introduit un algorithme rapide pour la résolution d'un système linéaire de Toeplitz bande. Cette approche est basée sur l'extension de la matrice donnée par plusieurs lignes en dessus, de plusieurs colonnes à droite et d'attribuer des zéros et des constantes non nulles dans chacune de ces lignes et de ces colonnes de telle façon que la matrice augmentée à la structure d'une matrice triangulaire inférieure de Toeplitz. La stabilité de l'algorithme a été discutée et son efficacité a été aussi justifiée. Finalement, nous avons abordé la résolution d'un système de Toeplitz bandes par blocs bandes de Toeplitz. Ceci étant primordial pour établir la connexion de nos algorithmes à des applications en restauration d'images, un domaine phare en mathématiques appliquées. / This thesis aims to design new fast algorithms for numerical computation via the Toeplitz matrices. First, we introduced a fast algorithm to compute the inverse of a triangular Toeplitz matrix with real and/or complex numbers based on polynomial interpolation techniques. This algorithm requires only two FFT (2n) is clearly effective compared to predecessors. A numerical accuracy and error analysis is also considered. Numerical examples are given to illustrate the effectiveness of our method. In addition, we introduced a fast algorithm for solving a linear banded Toeplitz system. This new approach is based on extending the given matrix with several rows on the top and several columns on the right and to assign zeros and some nonzero constants in each of these rows and columns in such a way that the augmented matrix has a lower triangular Toeplitz structure. Stability of the algorithm is discussed and its performance is showed by numerical experiments. This is essential to connect our algorithms to applications such as image restoration applications, a key area in applied mathematics.

For noiseless sampled data, we describe the close connections between Prony--like methods, namely the classical Prony method, the matrix pencil method and the ESPRIT method. Further we present a new efficient algorithm of matrix pencil factorization based on QR decomposition of a rectangular Hankel matrix. The algorithms of parameter estimation are also applied to sparse Fourier approximation and nonlinear approximation.