Dissertations / Theses on the topic 'Quadratic polynomial'
To see the other types of publications on this topic, follow the link: Quadratic polynomial.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Quadratic polynomial.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Boljunčić, Jadranka. "Quadratic programming : quantitative analysis and polynomial running time algorithms." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/27532.
Full textAbstract:
Many problems in economics, statistics and numerical analysis can be formulated as the optimization of a convex quadratic function over a polyhedral set. A polynomial algorithm for solving convex quadratic programming problems was first developed by Kozlov at al. (1979). Tardos (1986) was the first to present a polynomial
algorithm for solving linear programming problems in which the number of arithmetic steps depends only on the size of the numbers in the constraint matrix and is independent of the size of the numbers in the right hand side and the cost coefficients. In the first part of the thesis we extended Tardos' results to strictly convex quadratic programming of the form max {cTx-½xTDx : Ax ≤ b, x ≥0} with D being symmetric positive definite matrix. In our algorithm the number of arithmetic steps is independent of c and b but depends on the size of the entries of the matrices A and D.
Another part of the thesis is concerned with proximity and sensitivity of integer and mixed-integer quadratic programs. We have shown that for any optimal solution z̅ for a given separable quadratic integer programming problem there exist an optimal solution x̅ for its continuous relaxation such thatz̅ - x̅
∞≤n∆(A) where n is the number of variables and ∆(A) is the largest absolute sub-determinant of the integer constraint matrix A . We have further shown that for any feasible solution z, which is not optimal for the separable quadratic integer programming problem, there exists a feasible solution z̅ having greater objective function value and with
z - z̅
∞≤n∆(A). Under some additional assumptions the distance between a pair of optimal solutions to the integer quadratic programming problem with right hand side vectors b and b', respectively, depends linearly on
b — b'
₁. The extension to the mixed-integer nonseparable quadratic case is also given. Some sensitivity analysis results for nonlinear integer programming problems are given. We assume that the nonlinear 0 — 1 problem was solved by implicit enumeration and that some small changes have been made in the right hand side or objective function coefficients. We then established what additional information to keep in the implicit enumeration tree, when solving the original problem, in order to provide us with bounds on the optimal value of a perturbed problem. Also, suppose that after solving the original problem to optimality the problem was enlarged by introducing a new 0 — 1 variable, say xn+1. We determined a lower bound on the added objective function coefficients for which the new integer variable xn+1 remains at zero level in the optimal solution for the modified integer nonlinear program. We discuss the extensions to the mixed-integer case as well as to the case when integer variables are not restricted to be 0 or 1. The computational results for an example with quadratic objective function, linear constraints and 0—1 variables are provided. Finally, we have shown how to replace the objective function of a quadratic program with 0—1 variables ( by an integer objective function whose size is polynomially bounded by the number of variables) without changing the set of optimal solutions. This was done by making use of the algorithm given by Frank and Tardos (1985) which in turn uses the simultaneous approximation algorithm of Lenstra, Lenstra and Lovász (1982).
Business, Sauder School of
Graduate
2
Tuncbilek, Cihan H. "Polynomial and indefinite quadratic programming problems: algorithms and applications." Diss., Virginia Tech, 1994. http://hdl.handle.net/10919/39040.
Full text
3
Poirier, Schmitz Alfredo. "Invariant measures on polynomial quadratic Julia sets with no interior." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/96022.
Full textAbstract:
We characterize invariant measures for quadratic polynomial Julia sets with no interior. We prove that besides the harmonic measure —the only one that is even and invariant—, all others are generated by a suitable odd measure.En este artículo caracterizamos medidas invariantes sobre conjuntos de Julia sin interior asociados con polinomios cuadráticos. Probamos que más allá de la medida armónica —la única par e invariante—, el resto son generadas por su parte impar.
4
Ferragut, i. Amengual Antoni. "Polynomial inverse integrating factors of quadratic differential systems and other results." Doctoral thesis, Universitat Autònoma de Barcelona, 2006. http://hdl.handle.net/10803/3093.
Full textAbstract:
Aquesta tesi està dividida en dues parts diferents. En la primera, estudiam els sistemes quadràtics (sistemes polinomials de grau dos) que tenen un invers de factor integrant polinomial. En la segona, estudiam tres problemes diferents referits als sistemes diferencials polinomials. La primera part
En l'estudi dels sistemes diferencials plans el coneixement d'una integral primera és molt important. Els seus conjunts de nivell estan formats per òrbites i ens permeten dibuixar el retrat de fase del sistema, objectiu principal de la teoria qualitativa de les equacions diferencials al pla. Com ja se sap, existeix una bijecció entre l'estudi de les integrals primeres i l'estudi dels inversos de factor integrant. De fet, és més senzill l'estudi dels inversos de factor integrant que el de les integrals primeres. Una classe és dels sistemes quadràtics àmpliament estudiada dins els sistemes diferencials al pla és la dels sistemes quadràtics. Hi ha més d'un miler d'articles publicats sobre aquest tipus de sistemes, però encara som lluny de conèixer quins d'aquests sistemes són integrables, és a dir, si tenen una integral primera.
En aquest treball, estudiam els sistemes quadràtics que tenen un invers de factor integrant polinomial V = V(x, y), i per tant també tenen una integral primera, definida allà on no s'anul·la. Aquesta classe de sistemes diferencials és important per diferents motius:
1. La integral primera és sempre Darboux.
2. Conté la classe dels sistemes quàdratics homogenis, àmpliament estudiada (Date, Sibirskii, Vulpe...).
3. Conté la classe dels sistemes quàdratics amb un centre, també estudiada (Dulac, Kapteyn, Bautin,...).
4. Conté la classe dels sistemes quàdratics Hamiltonians (Artés, Llibre, Vulpe).
5. Conté la classe dels sistemes quàdratics amb una integral primera polinomial (Chavarriga, García, Llibre, Pérez de Rio, Rodríguez).
6. Conté la classe dels sistemes quàdratics amb una integral primera racional de grau dos (Cairó, Llibre).
La segona part
Presentam els següents tres articles:
1. A. Ferragut, J. Llibre and A. Mahdi, Polynomial inverse integrating factors for polynomial vector ?elds, to appear in Discrete and Continuous Dynamical Systems.
2. A. Ferragut, J. Llibre and M.A. Teixeira, Periodic orbits for a class of C(1) three-dimensional systems, submitted.
3. A. Ferragut, J. Llibre and M.A. Teixeira, Hyperbolic periodic orbits coming from the bifurcation of a 4-dimensional non-linear center, to appear in Int. J. Of Bifurcation and Chaos.
En el primer article donam tres resultats principals. Primer provam que un camp vectorial polinomial que té una integral primera polinomial té un invers de factor integrant polinomial. El segon resultat és un exemple d'un camp vectorial polinomial que té una integral primera racional i no té ni una integral primera polinomial ni un invers de factor integrant polinomial. Era un problema obert el fet de sebre si existien camps vectorials polinomials veri?cant aquestes condicions. El tercer resultat és un exemple d'un camp vectorial polinomial que té un centre i no té invers de factor integrant polinomial. Un exemple d'aquest tipus era esperat però desconegut en la literatura.
En el segon article estudiam camps vectorials polinomials reversibles de grau quatre en R(3) que tenen, sota certes condicions genèriques, un nombre arbitrari d'-orbitesperi-odiques hiperb-oliques. Sense aquestes condicions, tenen un nombre arbitrari d'òrbites periòdiques hiperbòliques. Sense aquestes condicions, tenen un nombre arbitrari d'òrbites periòdiques.
Finalment, en el tercer article, estudiam la pertorbació d'un centre de R(4) que prove d'un problema de la física. Mitjançant la teoria dels termes mitjans de primer ordre dins els camps vectorials polinomials de grau quatre, el sistema pertorbat pot tenir fins a setze òrbites periòdiques hiperbòliques bifurcant de les òrbites peròdiques del centre.
This thesis is divided into two different parts. In the first one, we study the quadratic systems (polynomial systems of degree two) having a polynomial inverse integrating factor. In the second one, we study three different problems related to polynomial differential systems.
The ?rst part.
It is very important, for planar differential systems, the knowledge of a ?rst integral. Its level sets are formed by orbits and they let us draw the phase portrait of the system, which is the main objective of the qualitative theory of planar differential equations.
As it is known, there is a bijection between the study of the ?rst integrals and the study of inverse integrating factors. In fact, it is easier to study the inverse integrating factors than the ?rst integrals.
A widely studied class of planar differential systems is the quadratic one. There are more than a thousand published articles about this subject of differential systems, but we are far away of knowing which quadratic systems are integrable, that is, if they have a ?rst integral.
In this work, we study the quadratic systems having a polynomial inverse integrating factor V = V (x, y), so they also have a ?rst integral, de?ned where V does not vanish. This class of quadratic systems is important for several reasons:
1. The ?rst integral is always Darboux.
2. It contains the class of homogeneous quadratic system, widely studied (Date, Sibirskii, Vulpe,...).
3. It contains the class of quadratic systems having a center, also studied (Dulac, Kapteyn, Bautin,...).
4. It contains the class of Hamiltonian quadratic systems (Artés, Llibre, Vulpe).
5. It contains the class of quadratic systems having a polynomial ?rst integral (Chavarriga, García, Llibre, Pérez de Rio, Rodríguez).
6. It contains the class of quadratic systems having a rational ?rst integral of de gree two (Cairó, Llibre).
The classi?cation of the quadratic systems having a polynomial inverse integrating factor is not completely ?nished. There remain near a 5% of the cases to study. We leave their study for an immediate future.
The second part.
We present the following three articles:
1. A. Ferragut, J. Llibre and A. Mahdi, Polynomial inverse integrating factors for polynomial vector ?elds, to appear in Discrete and Continuous Dynamical Systems.
2. A. Ferragut, J. Llibre and M.A. Teixeira, Periodic orbits for a class of C(1) three-dimensional systems, submitted.
3. A. Ferragut, J. Llibre and M.A. Teixeira, Hyperbolic periodic orbits coming from the bifurcation of a 4-dimensional non-linear center, to appear in Int. J. Of Bifurcation and Chaos.
In the first article we give three main results. First we prove that a polynomial vector field having a polynomial must have a polynomial inverse integrating factor. The second one is an example of a polynomial vector ?eld having a rational ?rst integral and having neither polynomial ?rst integral nor polynomial inverse integrating factor. It was an open problem to know if there exist polynomial vector ?elds verifying these conditions. The third one is an example of a polynomial vector ?eld having a center and not having a polynomial inverse integrating factor. An example of this type was expected but unknown in the literature.
In the second article we study reversible polynomial vector ?elds of degree four in R(3) which have, under certain generic conditions, an arbitrary number of hyperbolic periodic orbits. Without these conditions, they have an arbitrary number of periodic orbits.
Finally, in the third article, we study the perturbation of a center in R(4) which comes from a problem of physics. By the ?rst order averaging theory and perturbing inside the polynomial vector ?elds of degree four, the perturbed system may have at most sixteen hyperbolic periodic orbits bifurcating from the periodic orbits of the center.
5
Riggs, Laurie Jan. "Polynomial equations and solvability: A historical perspective." CSUSB ScholarWorks, 1996. https://scholarworks.lib.csusb.edu/etd-project/1186.
Full text
6
Liu, Dunxue Carleton University Dissertation Mathematics. "Dihedral polynomial congruences and binary quadratic forms: a class field theory approach." Ottawa, 1992.
Find full text
7
Lahnovych, Carrie. "Analysis and computation of a quadratic matrix polynomial with Schur-products and applications to the Barboy-Tenne model /." Online version of thesis, 2010. http://ritdml.rit.edu/handle/1850/12207.
Full text
8
Begum, Monzu Ara. "Bifurcation in complex quadratic polynomial and some fold theorems involving the geometry of bulbs of the Mandelbrot set." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/MQ64045.pdf.
Full text
9
Ryu, Jong Hoon. "Permutation polynomial based interleavers for turbo codes over integer rings theory and applications /." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1181139404.
Full text
10
Ali, Ali Hasan. "Modifying Some Iterative Methods for Solving Quadratic Eigenvalue Problems." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1515029541712239.
Full text
11
Lazare, Arnaud. "Global optimization of polynomial programs with mixed-integer variables." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLY011.
Full textAbstract:
Dans cette thèse, nous nous intéressons à l'étude des programmes polynomiaux, c'est à dire les problème d'optimisation dont la fonction objectif et/ou les contraintes font intervenir des polynômes de plusieurs variables. Ces problèmes ont de nombreuses applications pratiques et constituent actuellement un champ de recherche très actif. Différentes méthodes permettent de les résoudre de façon exacte ou approchée, en utilisant par exemple des relaxationssemidéfinies positives du type "moments-somme de carrés". Mais ces problèmes restent très difficiles et on ne sait résoudre en toute généralité que des instances de petite taille.Dans le cas quadratique, une approche de résolution exacte efficace a été initialement proposée à travers la méthode QCR. Elle se base sur une reformulation quadratique convexe "optimale" au sens de la borne par relaxation continue.Une des motivations de cette thèse est de généraliser cette approche pour le cas des problèmes polynomiaux. Dans la majeure partie de ce manuscrit, nous étudions les problèmes d'optimisation en variables binaires. Nous proposons deux familles de reformulations convexes pour ces problèmes: des reformulations "directes" et des reformulations passant par la quadratisation.Pour les reformulations directes, nous nous intéressons tout d'abord aux linéarisations. Nous introduisons le concept de q-linéarisation, une linéarisation utilisant q variables additionnelles, et comparons les bornes obtenues par relaxation continue pour différentes valeurs de q. Ensuite, nous appliquons la reformulation convexe au problème polynomial, en ajoutant des termes supplémentaires à la fonction objectif, mais sans ajouter de variables ou de contraintes additionnelles.La deuxième famille de reformulations convexes vise à étendre la reformulation quadratique convexe au cas polynomial. Nous proposons plusieurs nouvelles reformulations alternatives que nous comparons aux méthodes existantes sur des instances de la littérature. En particulier nous présentons l'algorithme PQCR pour résoudre des problèmes polynomiaux binaires sans contrainte. La méthode PQCR permet de résoudre des instances jusqu'ici non résolues. En plus des expérimentations numériques, nous proposons aussi une étude théorique visant à comparer les différentes reformulations quadratiques de la littérature puis à leur appliquer une reformulation convexe.Enfin nous considérons des cas plus généraux et nous proposons une méthode permettant de calculer des relaxations convexes pour des problèmes continusIn this thesis, we are interested in the study of polynomial programs, that is optimization problems for which the objective function and/or the constraints are expressed by multivariate polynomials. These problems have many practical applications and are currently actively studied. Different methods can be used to find either a global or a heuristic solution, using for instance, positive semi-definite relaxations as in the "Moment/Sum of squares" method. But these problems remain very difficult and only small instances are addressed. In the quadratic case, an effective exact solution approach was initially proposed in the QCR method. It is based on a quadratic convex reformulation, which is optimal in terms of continuous relaxation bound.One of the motivations of this thesis is to generalize this approach to the case of polynomial programs. In most of this manuscript, we study optimization problems with binary variables. We propose two families of convex reformulations for these problems: "direct" reformulations and quadratic ones.For direct reformulations, we first focus on linearizations. We introduce the concept of q-linearization, that is a linearization using q additional variables, and we compare the bounds obtained by continuous relaxation for different values of q. Then, we apply convex reformulation to the polynomial problem, by adding additional terms to the objective function, but without adding additional variables or constraints.The second family of convex reformulations aims at extending quadratic convex reformulation to the polynomial case. We propose several new alternative reformulations that we compare to existing methods on instances of the literature. In particular we present the algorithm PQCR to solve unconstrained binary polynomial problems. The PQCR method is able to solve several unsolved instances. In addition to numerical experiments, we also propose a theoretical study to compare the different quadratic reformulations of the literature and then apply a convex reformulation to them.Finally, we consider more general problems and we propose a method to compute convex relaxations for continuous problems
12
Takam, Soh Patrice. "Estimation de la loi de la durée de séjour en présence d'une censure post-évènement d'intérêt. : Application à la croissance des fruits du cacaoyer et modélisation du risque d'attaque par la pourriture brune au Cameroun." Thesis, Montpellier 2, 2011. http://www.theses.fr/2011MON20163/document.
Full textAbstract:
Nous nous sommes intéressés dans cette étude à l'estimation de la loi de la durée de séjour en prenant en compte les individus sur lesquels l'évènement d'intérêt et la censure peuvent se produire dans un même intervalle et être observés. Pour cela, nous avons proposé deux approches d'estimation non paramétrique basées sur une approximation asymptotique quand la longueur de l'intervalle entre deux dates consécutives d'observation tend vers 0. La première est basée sur une relation intégrale et la deuxième est basée sur une restauration des durées de séjour. Nous nous sommes servis de ces approches pour monter un modèle de croissance des fruits du cacaoyer en fonction du climat. Nous avons également estimé la sensibilité (probabilité de pénétration et de réussite d'infection) des fruits en fonction de leur stade et le potentiel infectieux (nombre moyen de spores sur un fruit) par date. Ce potentiel infectieux nous permettrait de monter un modèle du potentiel infectieux en fonction des fruits attaqués. La connaissance du potentiel infectieux en fonction des fruits attaqués, de l'estimation de la sensibilité suivant les stades, de l'estimation du modèle de croissance permettra alors de monter un modèle dynamique du potentiel infectieux pour prédire le risque d'évolution de la pourriture brune des fruits du cacaoyerWe are interested in this study in estimating the lifetime distribution by taking into consideration individuals on which the interest event and the censorship can occur in the same intervaland both events were then observed. We proposed two nonparametric approaches based on an asymptotic approximation when the lengthbetween two consecutive observation days tends to 0. The first one was based on an integral relationship and the second one on a lifetime restoration. We used theses approaches to build a fruitgrowth model depending on climatic variables. We also estimated the susceptibility (success probability of attack by a spore on a fruit) of the fruit depending of its developmental stage and theinfectious potential of the disease over time.This infectious potential could help to build a model of infectious potential depending on infected fruits. The knowledge of the infectious potential depending on infected fruits, the estimation of the susceptibility of the fruit and the model of growth will allow to built a dynamic model of infectious potential to predict the evolution risk of disease progression
13
Mogilka, Marcelo. "O uso da planilha eletrônica no estudo das funções e equações polinomiais." Universidade Federal da Paraíba, 2016. http://tede.biblioteca.ufpb.br:8080/handle/tede/9465.
Full textAbstract:
Submitted by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-08T13:29:12Z
No. of bitstreams: 1
arquivototal.pdf: 8624212 bytes, checksum: 8123f6eb13506d5865b46a957bfa1ae6 (MD5)Approved for entry into archive by ANA KARLA PEREIRA RODRIGUES (anakarla_@hotmail.com) on 2017-09-08T13:51:23Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 8624212 bytes, checksum: 8123f6eb13506d5865b46a957bfa1ae6 (MD5)
Made available in DSpace on 2017-09-08T13:51:23Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 8624212 bytes, checksum: 8123f6eb13506d5865b46a957bfa1ae6 (MD5) Previous issue date: 2016-07-22
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
The use of technologies as teaching tool is a reality experienced by a significant portion of the student body in Brazil. However, there is still considerable demand for educational projects involving the teaching of mathematics with the technologies offered by computer programs. This work will address - through the Delta Project the usage of electronic spreadsheets as a tool for analysis and resolution of func- tional and polynomial equations, establishing links between the mathematical and computational knowledge.
A utilização das tecnologias como ferramentas didaticas ja é uma realidade vivida por uma parte significativa do alunado no Brasil. No entanto, o ritmo vertiginoso do avanço dessas tecnologias não é acompanhado pela devida adaptação e aplicação a realidade das escolas e, sobretudo, a realidade dos alunos. Diante deste descom- passo faz-se necessário ampliar as ofertas de trabalhos acadêmicos que utilizem as tecnologias oferecidas na forma de aplicativos, softwares ou programas específicos da area de educação, para auxiliar o professor na difícil tarefa de ensinar a matema- tica. Essa dissertação pretende contribuir exatamente nesse sentido. Através de um projeto didatico aplicado em sala de aula - o Projeto Delta - que tem como prin- cipal objetivo ampliar e aprofundar os conceitos de função quadratica, resolução de equações polinomiais, divisão de polinômios e cálculo de áreas e volumes de sólidos geométricos utilizando para tanto a planilha eletrônica como ferramenta didática e link entre os saberes das áreas de matemática e programação. Por meio de exemplos práticos da utilização da planilha eletrônica na criação de programas pelos alunos que participaram do Projeto Delta, e da devida fundamentação teórica, esse tra- balho acadêmico pretende mostrar que no processo de criar programas na planilha eletrônica para auxiliar a resolução de problemas matemáticos o aluno tem como subproduto positivo um aprofundamento do entendimento desses saberes matema- ticos e, mais ainda, uma postura analítica e protagonista diante dos conhecimentos dessa matéria em oposição a postura passiva e pouco reflexiva que, infelizmente, ainda é assumida por grande parte dos nossos alunos.
14
Ruan, Ning. "Global optimization for nonconvex optimization problems." Thesis, Curtin University, 2012. http://hdl.handle.net/20.500.11937/1936.
Full textAbstract:
Duality is one of the most successful ideas in modern science [46] [91]. It is essential in natural phenomena, particularly, in physics and mathematics [39] [94] [96]. In this thesis, we consider the canonical duality theory for several classes of optimization problems.The first problem that we consider is a general sum of fourth-order polynomial minimization problem. This problem arises extensively in engineering and science, including database analysis, computational biology, sensor network communications, nonconvex mechanics, and ecology. We first show that this global optimization problem is actually equivalent to a discretized minimal potential variational problem in large deformation mechanics. Therefore, a general analytical solution is proposed by using the canonical duality theory.The second problem that we consider is a nonconvex quadratic-exponential optimization problem. By using the canonical duality theory, the nonconvex primal problem in n-dimensional space can be converted into a one-dimensional canonical dual problem, which is either a concave maximization or a convex minimization problem with zero duality gap. Several examples are solved so as to illustrate the applicability of the theory developed.The third problem that we consider is quadratic minimization problems subjected to either box or integer constraints. Results show that these nonconvex problems can be converted into concave maximization dual problems over convex feasible spaces without duality gap and the Boolean integer programming problem is actually equivalent to a critical point problem in continuous space. These dual problems can be solved under certain conditions. Both existence and uniqueness of the canonical dual solutions are presented. A canonical duality algorithm is presented and applications are illustrated.The fourth problem that we consider is a quadratic discrete value selection problem subjected to inequality constraints. The problem is first transformed into a quadratic 0-1 integer programming problem. The dual problem is thus constructed by using the canonical duality theory. Under appropriate conditions, this dual problem is a maximization problem of a concave function over a convex continuous space. Theoretical results show that the canonical duality theory can either provide a global optimization solution, or an optimal lower bound approximation to this NP-hard problem. Numerical simulation studies, including some relatively large scale problems, are carried out so as to demonstrate the effectiveness and efficiency of the canonical duality method. An open problem for understanding NP-hard problems is proposed.The fifth problem that we consider is a mixed-integer quadratic minimization problem with fixed cost terms. We show that this well-known NP-hard problem in R2n can be transformed into a continuous concave maximization dual problem over a convex feasible subset of Rn with zero duality gap. We also discuss connections between the proposed canonical duality theory approach and the classical Lagrangian duality approach. The resulting canonical dual problem can be solved under certain conditions, by traditional convex programming methods. Conditions for the existence and uniqueness of global optimal solutions are presented. An application to a decoupled mixed-integer problem is used to illustrate the derivation of analytic solutions for globally minimizing the objective function. Numerical examples for both decoupled and general mixed-integral problems are presented, and an open problem is proposed for future study.The sixth problem that we consider is a general nonconvex quadratic minimization problem with nonconvex constraints. By using the canonical dual transformation, the nonconvex primal problem can be converted into a canonical dual problem (i.e., either a concave maximization problem with zero duality gap). Illustrative applications to quadratic minimization with multiple quadratic constraints, box/integer constraints, and general nonconvex polynomial constraints are discussed, along with insightful connections to classical Lagrangian duality. Conditions for ensuring the existence and uniqueness of global optimal solutions are presented. Several numerical examples are solved.The seventh problem that we consider is a general nonlinear algebraic system. By using the least square method, the nonlinear system of m quadratic equations in n-dimensional space is first formulated as a nonconvex optimization problem. We then prove that, by using the canonical duality theory, this nonconvex problem is equivalent to a concave maximization problem in Rm, which can be solved by well-developed convex optimization techniques. Both existence and uniqueness of global optimal solutions are discussed, and several illustrative examples are presented.The eighth problem that we consider is a general sensor network localization problem. It is shown that by the canonical duality theory, this nonconvex minimization problem is equivalent to a concave maximization problem over a convex set in a symmetrical matrix space, and hence can be solved by combining a perturbation technique with existing optimization techniques. Applications are illustrated and results show that the proposed method is potentially a powerful one for large-scale sensor network localization problems.
15
Freiberger, Marianne. "Matings between Hecke groups and polynomials." Thesis, Queen Mary, University of London, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.368907.
Full text
16
Leahy, Jennifer C. "The permutations of periodic points in quadratic polynominials /." Connect to online version, 2005. http://ada.mtholyoke.edu/setr/websrc/pdfs/www/2005/103.pdf.
Full text
17
Baker, Audrey. "An algorithm for the strong freeness of quadratic lie polynomials /." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100761.
Full textAbstract:
The Lie algebra associated to the lower central and p-central series of a group is an important invariant of the group but is difficult to compute. For a finitely presented group this Lie algebra, can be determined under a certain condition on the initial forms of the relators, namely that of strong freeness. We give an algorithm for the strong freeness of 4 quadratic Lie polynomials in 4 variables over an arbitrary field thus extending a result of Bush and Labute.
18
Diene, Adama. "Structure of Permutation Polynomials." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1123788311.
Full text
19
Saygi, Elif. "Results On Lcz Sequences And Quadratic Forms." Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12611243/index.pdf.
Full textAbstract:
In this thesis we study low correlation zone (LCZ) sequence sets and a class of quadratic forms. In the first part we obtain two new classes of optimal LCZ sequence sets. In our first construction using a suitable orthogonal transformation we extend some results of [21]. We give new classes of LCZ sequence sets defined over Z4 in our second construction. We show that our LCZ sequence sets are optimal with respect to the Tang, Fan and Matsufiji bound [37]. In the second part we consider some special linearized polynomials and corresponding quadratic forms. We compute the number of solutions of certain equations related to these quadratic forms and we apply these result to obtain curves with many rational points.
20
Kettner, Michael. "Algorithmic and topological aspects of semi-algebraic sets defined by quadratic polynomials." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19704.
Full textAbstract:
Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2008.Committee Chair: Basu, Saugata; Committee Member: Etnyre, John; Committee Member: Ghomi, Mohammad; Committee Member: Gonzalez-Vega, Laureano; Committee Member: Powers, Victoria.
21
Alves, Jesmmer da Silveira. "Definitividade de formas quadráticas – uma abordagem polinomial." Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/6586.
Full textAbstract:
Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2016-12-12T16:55:40Z
No. of bitstreams: 2
Tese - Jesmmer da Silveira Alves - 2016.pdf: 4498358 bytes, checksum: e1a92f88800ddd8032e2b0c1039f216d (MD5)
license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2016-12-13T19:31:42Z (GMT) No. of bitstreams: 2 Tese - Jesmmer da Silveira Alves - 2016.pdf: 4498358 bytes, checksum: e1a92f88800ddd8032e2b0c1039f216d (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)
Made available in DSpace on 2016-12-13T19:31:42Z (GMT). No. of bitstreams: 2 Tese - Jesmmer da Silveira Alves - 2016.pdf: 4498358 bytes, checksum: e1a92f88800ddd8032e2b0c1039f216d (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-11-18
Fundação de Amparo à Pesquisa do Estado de Goiás - FAPEG
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
Quadratic forms are algebraic expressions that have important role in different areas of computer science, mathematics, physics, statistics and others. We deal with rational quadratic forms and integral quadratic forms, with rational and integer coefficients respectively. Existing methods for recognition of rational quadratic forms have exponential time complexity or use approximation that weaken the result reliability. We develop a polinomial algorithm that improves the best-case of rational quadratic forms recognition in constant time. In addition, new strategies were used to guarantee the results reliability, by representing rational numbers as a fraction of integers, and to identify linear combinations that are linearly independent, using Gauss reduction. About the recognition of integral quadratic forms, we identified that the existing algorithms have exponential time complexity for weakly nonnegative type and are polynomial for weakly positive type, however the degree of the polynomial depends on the algebra dimension and can be very large. We have introduced a polynomial algorithm for the recognition of weakly nonnegative quadratic forms. The related algorithm identify hypercritical restrictions testing every subgraph of 9 vertices of the quadratic form associated graph. By adding Depth First Search approach, a similar strategy was used in the recognition of weakly positive type. We have also shown that the recognition of integral quadratic forms can be done by mutations in the related exchange matrix.
Formas quadráticas são expressões algébricas que têm papel importante em diferentes áreas da ciência da computação, matemática, física, estatística e outras. Abordamos nesta tese formas quadráticas racionais e formas inteiras, com coeficientes racionais e inteiros respectivamente. Os métodos existentes para reconhecimento de formas quadráticas racionais têm complexidade de tempo exponencial ou usam aproximações que deixam o resultado menos confiável. Apresentamos um algoritmo polinomial que aprimora o melhorcaso do reconhecimento de formas quadráticas para tempo constante. Ainda mais, novas estratégias foram usadas para garantir a confiabilidade dos resultados, representando nú- meros racionais como frações de inteiros, e para identificar combinações lineares que são linearmente independentes, usando a redução de Gauss. Sobre o reconhecimento de formas inteiras, identificamos que os algoritmos existentes têm complexidade de tempo exponencial para o tipo fracamente não-negativa e polinomial para o tipo fracamente positiva. No entanto, o grau do polinômio depende da dimensão da álgebra e pode ser muito grande. Apresentamos um algoritmo polinomial para o reconhecimento de formas inteiras fracamente positivas. Este algoritmo identifica restrições hipercríticas avaliando todo subgrafo com 9 vértices do grafo associado à forma inteira. Através da busca em profundidade, uma estratégia similar pôde ser usada no reconhecimento do tipo fracamente positiva. Por fim, mostramos que o reconhecimento de formas inteiras pode ser feito através de mutações na matriz de troca relacionada.
22
Penrose, Christopher S. "On quotients of the shift associated with dendrite Julia sets of quadratic polynomials." Thesis, University of Warwick, 1990. http://wrap.warwick.ac.uk/106722/.
Full text
23
Manai, Arij. "Some contributions to backward stochastic differential equations and applications." Thesis, Le Mans, 2019. http://www.theses.fr/2019LEMA1022.
Full textAbstract:
Cette thèse est consacrée à l'étude des équations différentielles stochastiques rétrogrades (EDSR) et leurs applications. Dans le chapitre 1, on étudie le problème de maximisation de l'utilité de la richesse terminale où le prix de l'actif peut être discontinue sous des contraintes sur les stratégies de l'agent. Nous nous concentrons sur l'EDSR dont la solution représente l'utilité maximale, ce qui permet de transférer des résultats sur les EDSR quadratiques, en particulier les résultats de stabilité, au problème de maximisation d'utilité. Dans le chapitre 2, nous considèrons le problème de valorisation d'options Américaines des points de vue théorique et numérique en s'appuyant sur la représentation du prix de l'option comme solution de viscosité d'une équation parabolique non linéaire. Nous étendons le résultat prouvé dans [Benth, Karlsen and Reikvam 2003] pour un put ou call Américain à un cas plus général dans un cadre multidimensionnel. Nous proposons deux schémas numériques inspirés par les processus de branchement. Nos expériences numériques montrent que l'approximation du générateur discontinu, associé à l'EDP, par des polynômes locaux n'est pas efficace tandis qu'une simple procédure de randomisation donne de très bon résultats. Dans le chapitre 3, nous prouvons des résultats d'existence et d'unicité pour une classe générale d'équations progressives-rétrogrades à champs moyen sous une condition de monotonicité faible et une hypothèse non-dégénérescence sur l'équation progressive et nous donnons une application dans le domaine de stockage d'énergie dans le cas où la production d'électricité est imprévisibleThis thesis is dedicated to the study of backward stochastic differential equations (BSDEs) and their applications. In chapter 1, we study the problem of maximizing the utility from terminal wealth where the stock price may jump and there are investment constraints on the agent 's strategies. We focus on the BSDE whose solution represents the maximal utility, which allows transferring results on quadratic BSDEs, in particular the stability results, to the problem of utility maximisation. In chapter 2, we consider the problem of pricing American options from theoretical and numerical sides based upon an alternative representation of the value of the option in the form of a viscosity solution of a parabolic equation with a nonlinear reaction term. We extend the viscosity solution characterization proved in [Benth, Karlsen and Reikvam 2003] for call/put American option prices to the case of a general payoff function in a multi-dimensional setting. We address two new numerical schemes inspired by the branching processes. Our numerical experiments show that approximating the discontinuous driver of the associated reaction/diffusion PDE by local polynomials is not efficient, while a simple randomization procedure provides very good results. In chapter 3, we prove existence and uniqueness results for a general class of coupled mean-field forward-backward SDEs with jumps under weak monotonicity conditions and without the non-degeneracy assumption on the forward equation and we give an application in the field of storage in smart grids in the case where the production of electricity is unpredictable
24
Beyronneau, Robert Lewis. "The solvability of polynomials by radicals: A search for unsolvable and solvable quintic examples." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2700.
Full text
25
Barkat, Braham. "Design, estimation and performance of time-frequency distributions." Thesis, Queensland University of Technology, 2000.
Find full text
26
Veronese, Daniel Oliveira. "Propriedades e convergência de certas fórmulas de quadratura interpolatórias /." São José do Rio Preto : [s.n.], 2005. http://hdl.handle.net/11449/94285.
Full textAbstract:
Orientador: Alagacone Sri RangaBanca: Sandra Augusta Santos
Banca: Cleonice Fátima Bracciali
Resumo: Dentre as diversas fórmulas de quadratura interpolatórias estão aquelas que utilizam em sua construção as propriedades dos polinômios ortogonais Pn, ou ainda dos polinômios similares Bn. Consideramos, aqui, fþormulas de quadratura envolvendo polinôomios em x da forma .n(x, .) = Pn-1(.)Pn(x) - Pn(.)Pn-1(x), e da forma Gn(x, u) = Bn-1(u)Bn(x) - Bn(u)Bn-1(x). Abordamos ainda certas fþormulas de quadratura que visam aproximar a integral de um produto de duas funções k e f sendo k Lebesgue integrþavel e f Riemann integrþavel. O principal objetivo deste trabalho þe analisar propriedades das fþormulas de quadratura utilizando-se .n e obter propriedades anþalogas para o caso onde utiliza-se Gn, bem como estudar o erro e as propriedades de convergência das fórmulas envolvendo k e f. Propriedades dos pesos das fórmulas de quadratura nos diversos casos são analisadas, a convergência das fórmulas associadas a k e f são estudadas mediante determinadas escolhas de pontos.
Abstract: Among the many well known quadrature formulas one finds those interesting interpolatory quadrature formulas that take advantage of the properties of orthogonal polynomials Pn or similar polynomials Bn. Here, we consider the interpolatory quadrature rules based on the zeros of the polynomials øn(x, î) = Pn.1(î)Pn(x).Pn(î)Pn.1(x), and Gn(x, u) = Bn.1(u)Bn(x) . Bn(u)Bn.1(x) where î and u are arbitrary parameters. One of the objective of this dissertation is to study some of the known properties of quadrature rules based on øn(x, î) and consider the analogous properties of the quadrature rules based on Gn(x, u).We also look at the convergence properties of those quadrature rules that serve to approximate integrals of the product of functions k and f, where k is a Lebesgue integrable function and f needs to be a Riemann integrable function.
Mestre
27
Veronese, Daniel Oliveira [UNESP]. "Propriedades e convergência de certas fórmulas de quadratura interpolatórias." Universidade Estadual Paulista (UNESP), 2005. http://hdl.handle.net/11449/94285.
Full textAbstract:
Made available in DSpace on 2014-06-11T19:26:56Z (GMT). No. of bitstreams: 0
Previous issue date: 2005-02-24Bitstream added on 2014-06-13T18:30:55Z : No. of bitstreams: 1
veronese_do_me_sjrp.pdf: 430710 bytes, checksum: 769cae2276392992bc8f2c9eaf54fd4e (MD5)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Dentre as diversas fórmulas de quadratura interpolatórias estão aquelas que utilizam em sua construção as propriedades dos polinômios ortogonais Pn, ou ainda dos polinômios similares Bn. Consideramos, aqui, fþormulas de quadratura envolvendo polinôomios em x da forma .n(x, .) = Pn-1(.)Pn(x) - Pn(.)Pn-1(x), e da forma Gn(x, u) = Bn-1(u)Bn(x) - Bn(u)Bn-1(x). Abordamos ainda certas fþormulas de quadratura que visam aproximar a integral de um produto de duas funções k e f sendo k Lebesgue integrþavel e f Riemann integrþavel. O principal objetivo deste trabalho þe analisar propriedades das fþormulas de quadratura utilizando-se .n e obter propriedades anþalogas para o caso onde utiliza-se Gn, bem como estudar o erro e as propriedades de convergência das fórmulas envolvendo k e f. Propriedades dos pesos das fórmulas de quadratura nos diversos casos são analisadas, a convergência das fórmulas associadas a k e f são estudadas mediante determinadas escolhas de pontos.
Among the many well known quadrature formulas one finds those interesting interpolatory quadrature formulas that take advantage of the properties of orthogonal polynomials Pn or similar polynomials Bn. Here, we consider the interpolatory quadrature rules based on the zeros of the polynomials øn(x, î) = Pn.1(î)Pn(x).Pn(î)Pn.1(x), and Gn(x, u) = Bn.1(u)Bn(x) . Bn(u)Bn.1(x) where î and u are arbitrary parameters. One of the objective of this dissertation is to study some of the known properties of quadrature rules based on øn(x, î) and consider the analogous properties of the quadrature rules based on Gn(x, u).We also look at the convergence properties of those quadrature rules that serve to approximate integrals of the product of functions k and f, where k is a Lebesgue integrable function and f needs to be a Riemann integrable function.
28
Burns, Jonathan. "Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5193.
Full textAbstract:
Recursion is a fundamental tool of mathematics used to define, construct, and analyze mathematical objects. This work employs induction, sieving, inversion, and other recursive methods to solve a variety of problems in the areas of algebraic number theory, topological and combinatorial graph theory, and analytic probability and statistics. A common theme of recursively defined functions, weighted sums, and cross-referencing sequences arises in all three contexts, and supplemented by sieving methods, generating functions, asymptotics, and heuristic algorithms.
In the area of number theory, this work generalizes the sieve of Eratosthenes to a sequence of polynomial values called polynomial-value sieving. In the case of quadratics, the method of polynomial-value sieving may be characterized briefly as a product presentation of two binary quadratic forms. Polynomials for which the polynomial-value sieving yields all possible integer factorizations of the polynomial values are called recursively-factorable. The Euler and Legendre prime producing polynomials of the form n2+n+p and 2n2+p, respectively, and Landau's n2+1 are shown to be recursively-factorable. Integer factorizations realized by the polynomial-value sieving method, applied to quadratic functions, are in direct correspondence with the lattice point solutions (X,Y) of the conic sections aX2+bXY +cY2+X-nY=0. The factorization structure of the underlying quadratic polynomial is shown to have geometric properties in the space of the associated lattice point solutions of these conic sections.
In the area of combinatorial graph theory, this work considers two topological structures that are used to model the process of homologous genetic recombination: assembly graphs and chord diagrams. The result of a homologous recombination can be recorded as a sequence of signed permutations called a micronuclear arrangement. In the assembly graph model, each micronuclear arrangement corresponds to a directed Hamiltonian polygonal path within a directed assembly graph. Starting from a given assembly graph, we construct all the associated micronuclear arrangements. Another way of modeling genetic rearrangement is to represent precursor and product genes as a sequence of blocks which form arcs of a circle. Associating matching blocks in the precursor and product gene with chords produces a chord diagram. The braid index of a chord diagram can be used to measure the scope of interaction between the crossings of the chords. We augment the brute force algorithm for computing the braid index to utilize a divide and conquer strategy. Both assembly graphs and chord diagrams are closely associated with double occurrence words, so we classify and enumerate the double occurrence words based on several notions of irreducibility. In the area of analytic probability, moments abstractly describe the shape of a probability distribution. Over the years, numerous varieties of moments such as central moments, factorial moments, and cumulants have been developed to assist in statistical analysis. We use inversion formulas to compute high order moments of various types for common probability distributions, and show how the successive ratios of moments can be used for distribution and parameter fitting. We consider examples for both simulated binomial data and the probability distribution affiliated with the braid index counting sequence. Finally we consider a sequence of multiparameter binomial sums which shares similar properties with the moment sequences generated by the binomial and beta-binomial distributions. This sequence of sums behaves asymptotically like the high order moments of the beta distribution, and has completely monotonic properties.
29
Goffard, Pierre-Olivier. "Approximations polynomiales de densités de probabilité et applications en assurance." Thesis, Aix-Marseille, 2015. http://www.theses.fr/2015AIXM4026/document.
Full textAbstract:
Cette thèse a pour objet d'étude les méthodes numériques d'approximation de la densité de probabilité associée à des variables aléatoires admettant des distributions composées. Ces variables aléatoires sont couramment utilisées en actuariat pour modéliser le risque supporté par un portefeuille de contrats. En théorie de la ruine, la probabilité de ruine ultime dans le modèle de Poisson composé est égale à la fonction de survie d'une distribution géométrique composée. La méthode numérique proposée consiste en une projection orthogonale de la densité sur une base de polynômes orthogonaux. Ces polynômes sont orthogonaux par rapport à une mesure de probabilité de référence appartenant aux Familles Exponentielles Naturelles Quadratiques. La méthode d'approximation polynomiale est comparée à d'autres méthodes d'approximation de la densité basées sur les moments et la transformée de Laplace de la distribution. L'extension de la méthode en dimension supérieure à $1$ est présentée, ainsi que l'obtention d'un estimateur de la densité à partir de la formule d'approximation. Cette thèse comprend aussi la description d'une méthode d'agrégation adaptée aux portefeuilles de contrats d'assurance vie de type épargne individuelle. La procédure d'agrégation conduit à la construction de model points pour permettre l'évaluation des provisions best estimate dans des temps raisonnables et conformément à la directive européenne Solvabilité IIThis PhD thesis studies numerical methods to approximate the probability density function of random variables governed by compound distributions. These random variables are useful in actuarial science to model the risk of a portfolio of contracts. In ruin theory, the probability of ultimate ruin within the compound Poisson ruin model is the survival function of a geometric compound distribution. The proposed method consists in a projection of the probability density function onto an orthogonal polynomial system. These polynomials are orthogonal with respect to a probability measure that belongs to Natural Exponential Families with Quadratic Variance Function. The polynomiam approximation is compared to other numerical methods that recover the probability density function from the knowledge of the moments or the Laplace transform of the distribution. The polynomial method is then extended in a multidimensional setting, along with the probability density estimator derived from the approximation formula. An aggregation procedure adapted to life insurance portfolios is also described. The method aims at building a portfolio of model points in order to compute the best estimate liabilities in a timely manner and in a way that is compliant with the European directive Solvency II
30
AraÃjo, Adenildo Texeira de. "NÃmeros complexos: um estudo de aplicaÃÃes a trigonometria e as equaÃÃes algÃbricas." Universidade Federal do CearÃ, 2014. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=14006.
Full textAbstract:
O estudo dos nÃmeros complexos no ensino mÃdio à caracterizado, quase exclusivamente, pela abordagem algÃbrica deixando a parte geomÃtrica e suas aplicaÃÃes sem uma devida importÃncia. Este trabalho apresenta um estudo sobre nÃmeros complexos bem como algumas de suas aplicaÃÃes tanto da parte algÃbrica, aplicada a polinÃmios, quanto da parte geomÃtrica aplicada em especial à trigonometria. De inÃcio fizemos uma abordagem dos fatos histÃricos desses nÃmeros citando alguns matemÃticos que deram suas contribuiÃÃes acerca desse conjunto complexo. Em seguida à apresentada a parte teÃrica, algÃbrica e geomÃtrica, bem como algumas aplicaÃÃes a trigonometria. Por fim apresentamos a teoria das equaÃÃes algÃbricas quadrÃticas e cÃbicas e a interaÃÃo dessas com os nÃmeros complexos.The study of the complex numbers in the medium teaching is characterized, almost exclusively, for the algebraic approach leaving the geometric part and their applications without a due importance. This work presents a study on complex numbers as well as some of their applications so much of the algebraic part, applied to polynomials, as of the geometric part especially applied to the trigonometry. Of I begin did an approach of the historical facts of those numbers mentioning some mathematical that gave their contributions near of that complex group. Soon afterwards the part theoretical, algebraic and geometric is presented, as well as some applications the trigonometry. Finally we presented the theory of the quadratic and cubic algebraic equations and the interaction of those with the complex numbers.
31
Ghazo, Hanna Zeina. "Cycles combinatoires et géométriques." Thesis, Brest, 2020. http://www.theses.fr/2020BRES0006.
Full textAbstract:
Le travail de cette thèse se situe dans les domaines de la théorie combinatoire des graphes, la combinatoire algébrique et la géométrie discrète. D'un part, il concerne l'énumération des chemins et cycles Hamiltoniens de type donné dans un tournoi ; de l'autre part, il étudie des suites numériques vérifiant une équation à différence quadratique. Parmi les résultats obtenus dans la première partie, on trouve : une égalité entre le nombre des chemins (resp. cycles) Hamiltoniens d’un type donné dans un tournoi et dans son complément; une expression du nombre de chemins Hamiltoniens d’un type donné pour un tournoi transitif en termes d'une fonction récursive F appelée « path-function »; la construction d'un algorithme pour le calcul de F. L'objet fondamental dans la deuxième partie est un graphe cyclique muni d'une solution d'une équation à différence quadratique. Un paramètre de cette équation distingue les solutions réelles et les solutions complexes. Une correspondance entre les solutions réelles et une classe de polynômes à coefficients entiers positifs est établie. Pour compléter la correspondance, les digraphes Eulériens à un pas interviennent. Une solution complexe détermine une marche fermée dans le plan pour laquelle à chaque pas on tourne à gauche ou à droite par un angle constant (l'angle tournant). Cette fois-ci les polynômes cyclotomiques jouent un rôle important. La caractérisation des polynômes qui déterminent de telles suites est un problème qu’on surmonte afin d'élucider des propriétés géométriques de tels cycles polygonaux. Notamment, lorsque la marche exploite les côtés d'un polygone régulier avec angle extérieur 2π/n, on trouve des phénomènes non anticipés lorsque n≥12The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and discrete geometry. On one side, it is about enumerating Hamiltonian paths and cycles of a given type in a tournament; On the other side, it studies numerical sequences verifying a quadratic difference equation.Concerning the results of the first part, we find: an equality between the number of Hamiltonians paths (resp. cycles) of a given type, in a tournament and its complement; an expression of the number of Hamiltonian oriented paths of a given type in a transitive tournament in terms of a recursive function F called the « path-function »; and the construction of an algorithm to compute F.In the second part of the work, we study cyclic graphs altogether with a solution to a quadratic difference equation.A parameter of this equation distinguishes real and complex sequences. A correspondence between real solutions and a class of polynomials with positive integer coefficients is established. To complete the correspondence, 1-step Eulerian digraphs interfere. A complex solution determines a closed planar walk in the plane, for which at each step we turn either left or right by a constant angle (the turning angle). This time, cyclotomic polynomials play a major role. Characterizing polynomials that determine such a solution is a problem that we study to the end of finding geometric properties of such polygonal cycles.When the walk exploits the sides of a regular polygon with exterior angle 2 π/n, we find unexpected phenomena when n≥ 12
32
Duong, Chinh Cuong. "Exploration d'alternatives aux LMI non-quadratiques pour l'analyse des systèmes non linéaires représentés par des modèles Takagi-Sugeno." Thesis, Reims, 2013. http://www.theses.fr/2013REIMS012/document.
Full textAbstract:
Les travaux de cette thèse portent sur la stabilité et la stabilisation des systèmes non-linaires représentés par des modèles Takagi–Sugeno (T-S). L'objectif de ces travaux est d'explorer des techniques alternatives aux LMI pour l'analyse et la synthèse de lois de commande dans le cadre non quadratique afin de réduire le conservatisme. Tout d'abord, la stabilisation robuste de systèmes T-S à commutations incertains et perturbés a été considérée. Ainsi, des conditions de stabilisation ont été obtenues sous forme LMI sur la base d'une fonction candidate de Lyapunov à commutations. Puis, une nouvelle approche, pour l'analyse de la stabilité des systèmes non linéaires décrits par des modèles T-S polynomiaux a été proposée. L'objectif est ici d'explorer des techniques alternatives aux LMI dans le cadre non-quadratique. Ainsi, sur la base de travaux préliminaires dévolus à l'analyse de la stabilité via les techniques d'optimisation polynomiale « Sum-Of-Squares » (SOS), l'emploi d'une fonction candidate de Lyapunov polynomiale multiple a été proposée. Celle-ci permet de réduire le conservatisme des approches polynomiales existantes dans la littérature. Enfin, les modèles T-S classiques pouvant-être vus comme un cas particulier des modèles polynomiaux, une méthodologie de synthèse de lois de commande dans le cadre non quadratique est proposée. Celle-ci permet de s'affranchir de paramètres difficiles à obtenir en pratique via les approches LMI ainsi que de fournir une solution globale lorsque celle-ci existe. Néanmoins, à ce jour, des hypothèses fortes de modélisation restent toutefois nécessaires et constituent l'inconvénient majeur des approches SOS. Inconvénient qu'il conviendra de traiter dans des travaux futurs et qui suggèrent donc quelques perspectives à ces travauxThis thesis deals with the stability and stabilization of nonlinear systems represented by Takagi-Sugeno (T-S) models. The objective of this work is to explore and find out some alternatives to classical LMI conditions in order to reduce the conservatism. First, we focus on robust stabilisation of uncertain switched T-S models. Based on a switched Lyapunov function, the stabilisation conditions are obtained in terms of LMI. Then, a new approach for the stability analysis of polynomial T-S models is proposed. The goal is here to explore alternatives to LMI in the non-quadratic framework. Therefore, an extension of some preliminary result on the stability analysis of polynomial T-S models is proposed by the use of a multiple polynomial Lyapunov function which lead to less conservatism. The stability conditions are given in terms of Sum-of-Squares (SOS) polynomial optimization problem. Finally, classical T-S models being a particular case of polynomial ones, an attempt is done as an alternative to LMI in the non quadratic framework for the design of non-PDC controllers via SOS techniques. Within this framework, global stability may be guaranteed if there exists a solution to the SOS constraints. Moreover, it didn't require unknown parameters in advance like in LMI based non quadratic approaches. However, these SOS based controller design conditions are obtained through a restrictive modelling assumption, suggesting future prospects to this work
33
Rezende, Alex Carlucci. "A geometria de algumas famílias tridimensionais de sistemas diferenciais quadráticos no plano." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-25112014-142038/.
Full textAbstract:
Sistemas diferenciais quadráticos planares estão presentes em muitas áreas da matemática aplicada. Embora mais de mil artigos tenham sido publicados sobre os sistemas quadráticos ainda resta muito a se conhecer sobre esses sistemas. Problemas clássicos, e em particular o XVI problema de Hilbert, estão ainda em aberto para essa família. Um dos objetivos dos pesquisadores contemporâneos é obter a classificação topológica completa dos sistemas quadráticos. Devido ao grande número de parâmetros (essa família possui doze parâmetros e, aplicando transformações afins e reescala do tempo, reduzimos esse número a cinco, sendo ainda um número grande para se trabalhar) usualmente subclasses são consideradas nas investigações realizadas. Quando características específicas são levadas em consideração, o número de parâmetros é reduzido e o estudo se torna possível. Nesta tese estudamos principalmente duas subfamílias de sistemas quadráticos: a primeira possuindo um nó triplo semielemental e a segunda possuindo uma selanó semi elemental finita e uma selanó semielemental infinita formada pela colisão de uma sela infinita com um nó infinito. Os diagramas de bifurcação para ambas as famílias são tridimensionais. A família tendo um nó triplo gera 28 retratos de fase topologicamente distintos, enquanto o fecho da família tendo as selasnós dentro do espaço de bifurcação de sua forma normal gera 417. Polinômios invariantes são usados para construir os conjuntos de bifurcação e os retratos de fase topologicamente distintos são representados no disco de Poincaré. Os conjuntos de bifurcação são a união de superfícies algébricas e superfícies cuja presença foi detectada numericamente. Ainda nesta tese, apresentamos todos os retratos de fase de um sistema diferencial conhecido como modelo do tipo SIS (sistema suscetívelinfectadosuscetível, muito comum na matemática aplicada) e a classificação dos sistemas quadráticos possuindo hipérboles invariantes. Ambos sistemas foram investigados usando de polinômios invariantes afins.Planar quadratic differential systems occur in many areas of applied mathematics. Although more than one thousand papers have been written on these systems, a complete understanding of this family is still missing. Classical problems, and in particular Hilberts 16th problem, are still open for this family. One of the goals of recent researchers is the topological classification of quadratic systems. As this attempt is not possible in the whole class due to the large number of parameters (twelve, but, after affine transformations and time rescaling, we arrive at families with five parameters, which is still a large number), many subclasses are considered and studied. Specific characteristics are taken into account and this implies a decrease in the number of parameters, which makes possible the study. In this thesis we mainly study two subfamilies of quadratic systems: the first one possessing a finite semielemental triple node and the second one possessing a finite semielemental saddlenode and an infinite semielemental saddlenode formed by the collision of an infinite saddle with an infinite node. The bifurcation diagram for both families are tridimensional. The family having the triple node yields 28 topologically distinct phase portraits, whereas the closure of the family having the saddlenodes within the bifurcation space of its normal form yields 417. Invariant polynomials are used to construct the bifurcation sets and the phase portraits are represented on the Poincaré disk. The bifurcation sets are the union of algebraic surfaces and surfaces whose presence was detected numerically. Moreover, we also present the analysis of a differential system known as SIS model (this kind of systems are easily found in applied mathematics) and the complete classification of quadratic systems possessing invariant hyperbolas.
34
Bhiri, Bassem. "Stabilité et stabilisation en temps fini des systèmes dynamiques." Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0100/document.
Full textAbstract:
Ce mémoire de thèse traite de la stabilité en temps fini et de la stabilisation en temps fini des systèmes dynamiques. En effet, il est souvent important de garantir que pendant le régime transitoire, les trajectoires d'état ne dépassent pas certaines limites prédéfinies afin d'éviter les saturations et l'excitation des non-linéarités du système. Un système dynamique est dit stable en temps fini FTS si, pour tout état initial appartenant à un ensemble borné prédéterminé, la trajectoire d'état reste comprise dans un autre ensemble borné prédéterminé pendant un temps fini et fixé. Lorsque le système est perturbé, on parle de bornitude en temps fini FTB. Premièrement, des nouvelles conditions suffisantes assurant la synthèse d'un correcteur FTB par retour de sortie dynamique des systèmes linéaires continus invariants perturbés ont été développées via une approche descripteur originale. Le résultat a été établi par une transformation de congruence particulière. Les conditions obtenues sont sous forme de LMIs. Deuxièmement, l'utilisation de la notion d'annulateur combinée avec le lemme de Finsler, permet d’obtenir des nouvelles conditions sous formes LMIs garantissant la stabilité et la stabilisation en temps fini des systèmes non linéaires quadratiques. Enfin, pour obtenir des conditions encore moins pessimistes dans un contexte de stabilité en temps fini, de nouveaux développements ont été proposés en utilisant des fonctions de Lyapunov polynomialesThis dissertation deals with the finite time stability and the finite time stabilization of dynamic systems. Indeed, it is often important to ensure that during the transient regime, the state trajectories do not exceed certain predefined limits in order to avoid saturations and excitations of the nonlinearities of the system. Hence the interest is to study the stability of the dynamic system in finite time. A dynamic system is said to be stable in finite time (FTS) if, for any initial state belonging to a predetermined bounded set, the state trajectory remains within another predetermined bounded set for a finite and fixed time. When the system is disturbed, it is called finite time boundedness (FTB). In this manuscript, the goal is to improve the results of finite time stability used in the literature. First, new sufficient conditions expressed in terms of LMIs for the synthesis of an FTB controller by dynamic output feedback have been developed via an original descriptor approach. An original method has been proposed which consists in using a particular congruence transformation. Second, new LMI conditions for the study of finite time stability and finite time stabilization have been proposed for disturbed and undisturbed nonlinear quadratic systems. Third, to obtain even less conservative conditions, new developments have been proposed using polynomial Lyapunov functions
35
Hou, Ya-Fang, and 侯雅芳. "An Improvement of The Multiple Polynomial Quadratic Sieve." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/9xjv59.
Full textAbstract:
碩士國立中山大學
資訊工程學系研究所
96
Large integer factoring problem is a difficult computing problem. The security of many public-key cryptograohy system depend on the large interger factoring problem. Dr. Guan implement 「The Multiple Polynomail Quadratic Sieve Algorithm」 and name the program 「GQS」. The program successfully factor RSA-130 interger in 2004. It can reduce the time of sieving that the MPQS algorithm retain the smooth number with one or two prime. But finally the size of factor basis is large. We use some of the prime retained by the MPQS algorithm to match with the smooth number and reduce the size of factor basis. And then we can reduce the time of factoring. In this paper, we implement our idea in a AIX server and the result of this paper can be a suggestion of the improvement of MPQS.
36
廖偉呈. "Constructing Psi-Series Solution for Quadratic Polynomial Systems." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/31900501163873546899.
Full textAbstract:
碩士國立清華大學
數學系
100
In this paper, we discuss how to build a local solution for a system of ordinary differentiable equations of quadratic forms by constructing a psi-series. We want to understand how the solution behaves around the singularities. There are a necessary and sufficient condition: Real leading coefficients ensure the occurrence of blow up in finite time, and real time singularity implies that the leading coefficients of one asymptotic series are real. The Psi-series of quadratic systems on the plane has been studied. The relationship between the behavior and integrability of the system is also illustrated.
37
Chih-Chiang, Chen, and 陳志強. "Computer Assisted Multi-segment Quadratic Polynomial Circuit Synthesizer." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/69489483405833909915.
Full textAbstract:
碩士中華大學
電機工程學系碩士班
102
Abstract The goal of this thesis is mainly to discuss the computer assisted design(CAD) of multi-stage combination of quadratic polynomial circuit synthesizer(CAD). Only need to know the value of the coefficients of quadratic polynomials, the multi-stage quadratic polynomial circuit can be produced. Or by use of second-order Taylor expansion to approximate the natural logarithm, exponential and other irregular functions, we can use computer assisted quadratic polynomial circuit synthesizer to complete them. For design of quadratic polynomial multistage combinational circuit in this thesis tools used HSPICE and MATLAB. Circuit layout used the TSMC 0.18μm CMOS simulation process which provided via CIC. The area of the chip is about 0.32 mm × 0.32mm, sigmoid function current input range -140 μA to 200 μA, the bandwidth of about 426.4MHz,sigmoid inverse function current input range -200 μA to 118 μA, the bandwidth is about 409.2MHz.
38
"A simple polynomial-time algorithm for convex quadratic programming." Laboratory for Information and Decision Systems, Massachusetts Institute of Technology], 1988. http://hdl.handle.net/1721.1/3092.
Full textAbstract:
Paul Tseng.Caption title.
Includes bibliographical references.
This research is partially supported by the U.S. Army Research Office (Center for Intelligent Control Systems), contract DAAL03-86-K-0171 This research is partially supported by the National Science Foundation grant NSF-ECS-8519058
39
Chen, Ya-Hui, and 陳雅蕙. "D-optimal designs for linear and quadratic polynomial models." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/21278758614042882999.
Full textAbstract:
碩士國立中山大學
應用數學系研究所
91
This paper discusses the approximate and the exact n-point D-optimal design problems for the common multivariate linear and quadratic polynomial regression on some convex design spaces. For the linear polynomial regression, the design space considered are q-simplex, q-ball and convex hull of a set of finite points. It is shown that the approximate and the exact n-point D-optimal designs are concentrated on the extreme points of the design space. The structure of the optimal designs on regular polygons or regular polyhedra is also discussed. For the quadratic polynomial regression, the design space considered is a q-ball. The configuration of the approximate and the exact n-point D-optimal designs for quadratic model in two variables on a disk are investigated.
40
Xiao, Fu-Yuan, and 蕭富源. "The parameter estimation of quadratic polynomial model with measurement errors." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/53778850809137336090.
Full textAbstract:
碩士淡江大學
數學學系碩士班
94
Regression analysis is a statistic method for understanding the relationship between independent variable and dependent variable. When establishing the Regression Analysis, sometimes people will meet the problem that the independent variable in the data base cannot be measure exactly, and that is what people called measurement error model. The reason to determine the regression analysis of measurement error model is to explain when the variable becomes independent in measurement error and regression error, and the measurement error and regression error are bivariate normal, the parameter is unidentifiable. Therefore, in the measurement error model, the basic problem is what conditions can make the parameters to be identifiable. In this thesis, we suppose that the measurement error is normal distribution with mean zero and unknown variable, and discuss the identifiable qualifications of parameters in simple linear regression model and in quadratic polynomial model respectively. We also discuss the estimators of parameters which are consistency, and simulate the performance of mean square error.
41
Liao, Shi-Yuan, and 廖士元. "Using Two-Segments Quadratic Polynomial Curve Approximation for Road Boundary Detection." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/16911200189346728386.
Full textAbstract:
碩士國立中正大學
電機工程所
97
In this thesis, we propose a new way to describe the road boundary more accurately. Originally, based on the 2nd–order polynomial equation, we can substitute the coordinates of the boundary points into the equation and minimize the sum of square errors to obtain the polynomial solution and hence the approximate curve. However, the quadratic polynomial curve cannot fit all road boundary curves well, especially when the road has abrupt turning point. In these cases, even though the higher order polynomial can be applied yet too complicated to solve. In this research, we try to find a boundary point which separates the whole curve into two segments, and the total sum of square errors of the two curve segments must be minimized. According to our experiments, the curves turned out are definitely more accurate, especially the road has sharper turning point. The time needed to spend for this is to be considered next.
42
Wu, Pei-Lun, and 吳培綸. "Design of CMOS Quadratic Polynomial Circuit Using Best Fit Method and Four-Segment Method." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/95497873543099295336.
Full textAbstract:
碩士中華大學
電機工程學系碩士班
100
In this thesis, we design CMOS quadratic polynomial circuit using best fit method and four-segment method. The propose of this thesis is based on CMOS current-mode quadratic function circuits, its W/L ratio and construction could be adjusted by the relative error that the users needed. First we explain how to implement CMOS current-mode quadratic circuits and design the proposed circuit in the way of multiple corrections. We use the best fit CMOS quadratic polynomial circuit to realization exponential function. The imitative result based on the range of -48μA~22μA, and the relative error within±3%. The output dynamic range of 14.1dB, and linearity error less than ±0.3dB. Four-segment CMOS quadratic polynomial circuit utilize Taylor to fitting sigmoid function. The circuit is designed by four sets of quadratic polynomial circuit and three sets of segmentation control circuit. The imitative result based on the range of -277μA~480μA, and the relative error within±3%. The PSRR are 34.3. The imitative tool is HSPICE and MATLAB. Circuit layout software used the CADANCE which provided with CIC and TSMC 0.35μm process.
43
Rauh, Nikolas Marcel. "Resultants and height bounds for zeros of homogeneous polynomial systems." 2013. http://hdl.handle.net/2152/20950.
Full textAbstract:
In 1955, Cassels proved a now celebrated theorem giving a search bound algorithm for determining whether a quadratic form has a nontrivial zero over the rationals. Since then, his work has been greatly generalized, but most of these newer techniques do not follow his original method of proof. In this thesis, we revisit his 1955 proof, modernize his tools and language, and use this machinery to prove more general theorems regarding height bounds for the common zeros of a system of polynomials in terms of the heights of those polynomials. We then use these theorems to give a short proof of a more general (albeit, known) version of Cassels' Theorem and give some weaker results concerning the rational points of a cubic or a pair of quadratics.text
44
Begum, Monzu Ara. "Bifurcation in complex quadratic polynomial and some folk theorems involving the geometry of bulbs of the mandelbrot set." Thesis, 2001. http://spectrum.library.concordia.ca/1443/1/MQ64045.pdf.
Full textAbstract:
The Mandelbrot set M is a subset of the parameter plane for iteration of the complex quadratic polynomial Q c ( z ) = z 2 + c . M consists of those c values for which the orbit of 0 is bounded. This set features a basic cardioid shape from which hang numerous 'bulbs' or 'decorations'. Each of these bulbs is a large disk that is directly attached to the main cardioid together with numerous other smaller bulbs and a prominent 'antenna'. In this thesis we study the geometry of bulbs and some 'folk theorems' about the geometry of bulbs involving spokes of the antenna.
45
Shao-RongWang and 王勺融. "Correction of the Quadratic Light Source Dependence of the Aberration Polynomial based on the Characteristic Function of Hamilton." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/32525619105244978255.
Full textAbstract:
碩士國立成功大學
機械工程學系碩博士班
100
Nowadays the way of designing optical systems, most of people use optical design code to insert system model. For correcting aberration people set variables and what they want to optimize for, then optimize the system with the optimization tool of optical design code. It sets many system variables and spends a lot of execution time for design result. Although the design way is very complete and effective, the basis of optical feature is wake. This thesis takes based on optical aberration theory and discusses how to correct the quadratic light source dependence of the aberration polynomial which is based on the characteristic function of Hamilton. A connection between the mathematical model and the physical model due to the property of the aberration is built. Conditions of correcting the aberration in real physical system are found though the connection.
46
Mbuntcha, Wuntcha Calvin. "Optimisation quadratique en variables binaires : quelques résultats et techniques." Thèse, 2009. http://hdl.handle.net/1866/6625.
Full text
47
Chi, Fu-Chung, and 紀富中. "Evaluation of the Two-Stages Hough Transform to Detect Lines and Circles in Digital Images by Using Quadratic Polynomial Fitting." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/16031202306840683091.
Full textAbstract:
碩士國立交通大學
電機與控制工程系
90
A new two-stages Hough transform for detecting lines and circles in digital image is proposed here. The main feature of the new two-stages Hough transform is to evaluate the normal direction of the feature point by using quadratic polynomial fitting and decompose n dimension parameter array into n-1 dimension parameter array. The method is extended to detect lines in the digital image. In complicated images, the most curves are straight lines and circles and arcs. By using quadratic polynomial fitting, the normal direction and the curvature would be computed. By using the property of the different curvature between the lines and arcs, the non-straight lines are suppressed not to vote and only let the straight lines to vote in the two-stages Hough transform with quadratic polynomial fitting. The approach would get good performance in the experiment. The technique would be applied in CAD image and real pattern to get good results.
48
(10732485), Clinton W. Bradford. "Square Forms Factoring with Sieves." Thesis, 2021.
Find full textAbstract:
Square Form Factoring is an O(N1/4) factoring algorithm developed by D. Shanks using certain properties of quadratic forms. Central to the original algorithm is an iterative search for a square form. We propose a new subexponential-time algorithm called SQUFOF2, based on ideas of D. Shanks and R. de Vogelaire, which replaces the iterative search with a sieve, similar to the Quadratic Sieve.
49
Ackermann, Maria Helena. "Mixture models based on power means and generalised Q-fractions." Diss., 2011. http://hdl.handle.net/2263/27481.
Full textAbstract:
Mixture experiments are widely applied. The Scheffé quadratic polynomial is the most popular mixture model in industry due to its simplicity, but it fails to accurately describe the behaviour of response variables that deviate greatly from linear blending. Higherorder Scheffé polynomials do possess the ability to predict such behaviour but become increasingly more complex to use and the number of estimable parameters grow exponentially [15]. A parameter-parsimonious mixture model, developed from the linear blending rule with weighted power means and Wohl's Q-fractions, is introduced. Bootstrap is employed to analyse the model statistically. The model is proved to be flexible enough to model non-linear deviations from linear blending without losing the simplicity of the linear blending rule.Dissertation (MSc)--University of Pretoria, 2011.
Chemical Engineering
unrestricted
50
Massey, John Sirles. "Surface shape regions as manifestations of a socio-economic phenomenon : a solution to the choropleth mapping problem." Thesis, 2012. http://hdl.handle.net/2440/84536.
Full textAbstract:
A choropleth map is a cartographic document. It shows a geographic study area tessellated by a set of polygons that differ in shape and size. Each polygon is depicted by a uniform symbol representing the manifestation of some phenomenon. This thesis focuses on socio-economic phenomena. We want to delineate a set of socio-economic regions within a study area. These regions are used for decision making about the delivery of specific goods and services and/or the provision of specific community infrastructure. However, we have identified three fundamental weaknesses associated with the use of choropleth maps for socio-economic regionalisation. Therefore, as an alternative to the choropleth map if we think explicitly in R³, then the best representation of the spatial distribution of a socio- economic phenomenon is a smooth surface. The socio-economic data we use are collected during a national census of population and are summarised for areas, i.e., polygons. To accommodate these data we have developed and applied a method for gridding and smoothing - termed regularisation - in order to build a smooth surface. We apply Green's theorem and use path integrals with much simplification to compute a smoothed datum for each intersection of a, say, 100 by 100 grid that describes a surface. Mathematically, surface shape is interpreted through the comparison of curvatures. Surface shape analysis involves the measurement of the Gaussian and mean curvatures at the internal intersections of the grid. Curvature measurement requires at least a twice differentiable function. We have invented such a function based on Lagrange interpolation. It is called a Lagrange polynomial in xy. Each internal intersection of the grid is the (2,2) element of a 3 x 3 matrix extracted from the grid. We compute a Lagrange polynomial in xy for each 3 x 3 matrix. Then we use this polynomial to measure the curvatures and classify the shape. Contiguous grid intersections of the same shape class comprise a shape neighbourhoods region interpreted as a specific manifestation of a socio-economic phenomenon. Hence, we have the basis for describing the spatial distribution of the phenomenon. Three investigations into the construction of quadratic polynomials as alternative functions are described. Two of these quadratic polynomials are called `exact fit' in the sense that the polynomial returns the exact z-datum associated with each xy-pair used in its construction. Construction of a `best fit' quadratic polynomial based on least squares interpolation comprises the third investigation. We compare the four different types of polynomials and of these we choose the Lagrange polynomial in x y as most appropriate. Given a relatively high density grid, e.g., 250 by 250, regardless of the polynomial used the resulting maps of shape neighbourhoods regions are virtually identical. This surprising convergence in R² is explained. Is a map of shape neighbourhoods regions an accurate description of the spatial distribution of a socio-economic phenomenon? We effect an indirect evaluation of a known phenomenon represented by the spatial distribution of f(x,y) = sin x sin y. We compute the true map of shape neighbourhoods regions of this phenomenon. An approximate map of shape neighbourhoods regions is computed by sampling with 100 randomly generated polygons. Comparison implies that the approximate map is an accurate representation of the true map. This conclusion is supported strongly by the results of a study of a nonperiodic-nonrandom known phenomenon, based on a combination of exponential functions in x and y. This has a surface similar to that of a socio-economic phenomenon. We review selected geographic studies in which mathematical tools have been used for analytical purposes. Mathematical analysis is gaining broader acceptance in geography. The innovative, high quality Surpop work of British geographers is described, and we comment on the strongly complementary nature of the research presented in this thesis to the Surpop work. We describe 18 future research directions and themes; suggestions are made on how each may be undertaken. Next, we summarise each of the ten results of the research presented in this thesis. The thesis concludes with a statement of the medium-term research directions of the researcher and his acknowledgements.Thesis (M.Sc.(M&CS)) -- University of Adelaide, School of Mathematical Sciences, 2012