Log in

Relevant bibliographies by topics / Solving polynomial systems of equations / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Solving polynomial systems of equations.

Dissertations / Theses on the topic 'Solving polynomial systems of equations'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Solving polynomial systems of equations.'

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

Wise, Steven M. "POLSYS_PLP: A Partitioned Linear Product Homotopy Code for Solving Polynomial Systems of Equations." Thesis, Virginia Tech, 1998. http://hdl.handle.net/10919/36933.

Full text

Abstract:

Globally convergent, probability-one homotopy methods have proven to be very effective for finding all the isolated solutions to polynomial systems of equations. After many years of development, homotopy path trackers based on probability-one homotopy methods are reliable and fast. Now, theoretical advances reducing the number of homotopy paths that must be tracked, and in the handling of singular solutions, have made probability-one homotopy methods even more practical. This thesis describes the theory behind and performance of the new code POLSYS_PLP, which consists of Fortran 90 modules f

APA, Harvard, Vancouver, ISO, and other styles

2

Bard, Gregory V. "Algorithms for solving linear and polynomial systems of equations over finite fields with applications to cryptanalysis." College Park, Md. : University of Maryland, 2007. http://hdl.handle.net/1903/7202.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2007.<br>Thesis research directed by: Applied Mathematics and Scientific Computation Program. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

3

Mohamed, Mohamed Saied Emam. "Improved Strategies for Solving Multivariate Polynomial Equation Systems over Finite Fields." Phd thesis, TU Darmstadt, 2011. https://tuprints.ulb.tu-darmstadt.de/2622/4/Mohamed-Diss.pdf.

Full text

Abstract:

One of the important research problems in cryptography is the problem of solving multivariate polynomial equations over ﬁnite ﬁelds. The hardness of solving this problem is the measure of the security of many public key cryptosystems as well as of many symmetric cryptosystems, like block and stream ciphers. In recent years, algebraic cryptanalysis has been presented as a method of attacking cryptosystems. This method consists in solving multivariate polynomial systems. Therefore, developing algorithms for solving such systems is a hot research topic. Over the recent years, several algori

APA, Harvard, Vancouver, ISO, and other styles

4

Mohamed, Mohamed Saied Emam [Verfasser], Johannes [Akademischer Betreuer] Buchmann, and Jintai [Akademischer Betreuer] Ding. "Improved Strategies for Solving Multivariate Polynomial Equation Systems over Finite Fields / Mohamed Saied Emam Mohamed. Betreuer: Johannes Buchmann ; Jintai Ding." Darmstadt : Universitäts- und Landesbibliothek Darmstadt, 2011. http://d-nb.info/1105562581/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Vu, Thi Xuan. "Homotopy algorithms for solving structured determinantal systems." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS478.

Full text

Abstract:

Les systèmes polynomiaux multivariés apparaissant dans de nombreuses applications ont des structures spéciales et les systèmes invariants apparaissent dans un large éventail d'applications telles que dans l’optimisation polynomiale et des questions connexes en géométrie algébrique réelle. Le but de cette thèse est de fournir des algorithmes efficaces pour résoudre de tels systèmes structurés. Afin de résoudre le premier type de systèmes, nous concevons des algorithmes efficaces en utilisant les techniques d’homotopie symbolique. Alors que les méthodes d'homotopie, à la fois numériques et symbo

APA, Harvard, Vancouver, ISO, and other styles

6

Paramanathan, Pamini. "Systems of polynomial equations." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ64880.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Vanatta, Natalie. "Solving multi-variate polynomial equations in a finite field." Monterey, California: Naval Postgraduate School, 2013. http://hdl.handle.net/10945/34756.

Full text

Abstract:

Approved for public release; distribution is unlimited<br>Solving large systems of multivariate polynomial equations is an active area of mathematical research, as these polynomials are used in many fields of science. The objective of this research is to advance the development of algebraic methods to attack the mathematical foundations of modern-day encryption methods, which can be modeled as a system of multivariate polynomial equations over a finite field. Our techniques overcome the limitations of previous methods. Additionally, a model is proposed to estimate the time required to solve la

APA, Harvard, Vancouver, ISO, and other styles

8

Stoffel, Joshua David. "Lagrange-Chebyshev Based Single Step Methods for Solving Differential Equations." University of Akron / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=akron1335299082.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Parts, Inga. "Piecewise polynomial collocation methods for solving weakly singular integro-differential equations /." Online version, 2005. http://dspace.utlib.ee/dspace/bitstream/10062/851/5/parts.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cifuentes, Pardo Diego Fernando. "Exploiting chordal structure in systems of polynomial equations." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92972.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 79-81).<br>Chordal structure and bounded treewidth allow for efficient computation in linear algebra, graphical models, constraint satisfaction and many other areas. Nevertheless, it has not been studied whether chordality migh

APA, Harvard, Vancouver, ISO, and other styles

11

Sze, Tsz Wo. "On solving univariate polynomial equations over finite fields and some related problems." College Park, Md.: University of Maryland, 2007. http://hdl.handle.net/1903/7632.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2007.<br>Thesis research directed by: Dept. of Computer Science. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

12

SANTOS, ADILIO TITONELI DOS. "SOLVING METHODS OF ALGEBRAIC EQUATIONS AND ANALYSIS OF THE ROOTS OF POLYNOMIAL FUNCTIONS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2017. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=32358@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>O trabalho apresentou as soluções de equações algébricas polinomiais por radicais e operações elementares nos coeficientes com a pesquisa baseada em livros e artigos; buscou explorar as diversas ideias desenvolvidas nas demonstrações, discussões sobre os casos e os artifícios engenhosos envolvidos, além de algumas demonstrações independentes; foram tratados ainda, os casos especiais onde as raízes estão sujeitas a condições pré estabelecidas e os coeficientes obedecem a uma dad

APA, Harvard, Vancouver, ISO, and other styles

13

Serna, Rodrigo. "Solving Linear Systems of Equations in Hardware." Thesis, KTH, Skolan för elektro- och systemteknik (EES), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-200610.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Chen, Jun. "Discrete dynamical systems in solving H-equations." Diss., Virginia Tech, 1995. http://hdl.handle.net/10919/37761.

Full text

Abstract:

Three discrete dynamical models are used to solve the Chandrasekhar <i>H</i>-equation with a positive or negative characteristic function. Two of them produce series of continuous functions which converge to the solution of the <i>H</i>-equation. An iteration model of the nth approximation for the <i>H</i>-equation is discussed. This is a nonlinear n-dimensional dynamical system. We study not only the solutions of the nth approximation for the <i>H</i>-equation but also the mathematical structure and behavior of the orbits with respect to the parameter function, i.e. characteristic function. T

APA, Harvard, Vancouver, ISO, and other styles

15

Moon, Hyeyoung. "Calculating knot distances and solving tangle equations involving Montesinos links." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/859.

Full text

Abstract:

My research area is applications of topology to biology, especially DNA topology. DNA topology studies the shape and path of DNA in three dimensional space. My thesis relates to the study of DNA topology in a protein-DNA complex by solving tangle equations and calculating distances between DNA knots.

APA, Harvard, Vancouver, ISO, and other styles

16

Luttenberger, Michael. "Solving polynomial systems on semirings : a generalization of Newton's method." kostenfrei, 2010. https://mediatum2.ub.tum.de/node?id=796584.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Mou, Chenqi. "Solving polynomial systems over finite fields : Algorithms, Implementations and applications." Paris 6, 2013. http://www.theses.fr/2013PA066805.

Full text

Abstract:

Résolution de systèmes polynomiaux sur les corps finis est d’un intérêt particulier en raison de ses applications en Cryptographie, Théorie du Codage, et d’autres domaines de la science de l’information. Dans cette thèse, nous étudions plusieurs aspects importants théoriques et informatiques pour résolution de systèmes polynomiaux sur les corps finis, en particulier sur les deux outils largement utiliss: bases de Gröbner et ensembles triangulaires. Nous proposons des algorithmes efficaces pour le changement de l’ordre des bases de Gröbner d’idéaux de dimension zéro en utilisant le faible densi

APA, Harvard, Vancouver, ISO, and other styles

18

Tsai, Chih-Hsiung. "Algorithms for solving polynomial systems by homotopy continuation method and its parallelization." Diss., Connect to online resource - MSU authorized users, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

19

Smith, Andrew Paul [Verfasser]. "Enclosure Methods for Systems of Polynomial Equations and Inequalities / Andrew Paul Smith." Konstanz : Bibliothek der Universität Konstanz, 2012. http://d-nb.info/1028327854/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Duke, Elizabeth R. "Solving higher order dynamic equations on time scales as first order systems." Huntington, WV : [Marshall University Libraries], 2006. http://www.marshall.edu/etd/descript.asp?ref=653.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Lopes, Antonio Roldao. "Accelerating iterative methods for solving systems of linear equations using FPGAs." Thesis, Imperial College London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526401.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Liesen, Jörg. "Construction and analysis of polynomial iterative methods for non-hermitian systems of linear equations." [S.l. : s.n.], 1998. http://deposit.ddb.de/cgi-bin/dokserv?idn=955877776.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Liang, Yu. "The use of parallel polynomial preconditioners in the solution of systems of linear equations." Thesis, University of Ulster, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.422884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Clinger, Richard A. "Stability Analysis of Systems of Difference Equations." VCU Scholars Compass, 2007. http://hdl.handle.net/10156/1318.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Odland, Tove. "On Methods for Solving Symmetric Systems of Linear Equations Arising in Optimization." Doctoral thesis, KTH, Optimeringslära och systemteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166675.

Full text

Abstract:

In this thesis we present research on mathematical properties of methods for solv- ing symmetric systems of linear equations that arise in various optimization problem formulations and in methods for solving such problems. In the first and third paper (Paper A and Paper C), we consider the connection be- tween the method of conjugate gradients and quasi-Newton methods on strictly convex quadratic optimization problems or equivalently on a symmetric system of linear equa- tions with a positive definite matrix. We state conditions on the quasi-Newton matrix and the update matrix such that the se

APA, Harvard, Vancouver, ISO, and other styles

26

Le, Huu Phuoc. "On solving parametric polynomial systems and quantifier elimination over the reals : algorithms, complexity and implementations." Electronic Thesis or Diss., Sorbonne université, 2021. http://www.theses.fr/2021SORUS554.

Full text

Abstract:

La résolution de systèmes polynomiaux est un domaine de recherche actif situé entre informatique et mathématiques. Il trouve de nombreuses applications dans divers domaines des sciences de l'ingénieur (robotique, biologie) et du numérique (cryptographie, imagerie, contrôle optimal). Le calcul formel fournit des algorithmes qui permettent de calculer des solutions exactes à ces applications, ce qui pourraient être très délicat pour des algorithmes numériques en raison de la non-linéarité. La plupart des applications en ingénierie s'intéressent aux solutions réelles. Le développement d'algorithm

APA, Harvard, Vancouver, ISO, and other styles

27

Ahmad, Ab Rahman bin. "The AGE iterative methods for solving large linear systems occurring in differential equations." Thesis, Loughborough University, 1993. https://dspace.lboro.ac.uk/2134/32905.

Full text

Abstract:

The work presented in this thesis is wholly concerned with the Alternating Group Explicit (AGE) iterative methods for solving large linear systems occurring in solving Ordinary and Partial Differential Equations (ODEs and PDEs) using finite difference approximations.

APA, Harvard, Vancouver, ISO, and other styles

28

Donfack, Simplice. "Methods and algorithms for solving linear systems of equations on massively parallel computers." Thesis, Paris 11, 2012. http://www.theses.fr/2012PA112042.

Full text

Abstract:

Les processeurs multi-cœurs sont considérés de nos jours comme l'avenir des calculateurs et auront un impact important dans le calcul scientifique. Cette thèse présente une nouvelle approche de résolution des grands systèmes linéaires creux et denses, qui soit adaptée à l'exécution sur les futurs machines pétaflopiques et en particulier celles ayant un nombre important de cœurs. Compte tenu du coût croissant des communications comparé au temps dont les processeurs mettent pour effectuer les opérations arithmétiques, notre approche adopte le principe de minimisation des communications au prix d

APA, Harvard, Vancouver, ISO, and other styles

29

Bender, Matias Rafael. "Algorithms for sparse polynomial systems : Gröbner bases and resultants." Electronic Thesis or Diss., Sorbonne université, 2019. http://www.theses.fr/2019SORUS029.

Full text

Abstract:

La résolution de systèmes polynomiaux est l’un des problèmes les plus anciens et importants en mathématiques informatiques et a des applications dans plusieurs domaines des sciences et de l’ingénierie. C'est un problème intrinsèquement difficile avec une complexité au moins exponentielle du nombre de variables. Cependant, dans la plupart des cas, les systèmes polynomiaux issus d'applications ont une structure quelconque. Dans cette thèse, nous nous concentrons sur l'exploitation de la structure liée à la faible densité des supports des polynômes; c'est-à-dire que nous exploitons le fait que le

APA, Harvard, Vancouver, ISO, and other styles

30

Maharani, Maharani. "Enhanced Lanczos algorithms for solving systems of linear equations with embedding interpolation and extrapolation." Thesis, University of Essex, 2015. http://repository.essex.ac.uk/15564/.

Full text

Abstract:

Lanczos-type algorithms are prone to breaking down before convergence to an acceptable solution is achieved. This study investigates a number of ways to deal with this issue. In the first instance, we investigate the quality of three types of restarting points in the restarting strategy when applied to a particular Lanczos-type algorithm namely Orthodir. The main contribution of the thesis, however, is concerned with using regression as an alternative way to deal with breakdown. A Lanczos-type algorithm is run for a number of iterations and then stopped, ideally, just before breakdown occurs.

APA, Harvard, Vancouver, ISO, and other styles

31

Armstrong, Shea. "Suitability of Java for Solving Large Sparse Positive Definite Systems of Equations Using Direct Methods." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1175.

Full text

Abstract:

The purpose of the thesis is to determine whether Java, a programming language that evolved out of a research project by Sun Microsystems in 1990, is suitable for solving large sparse linear systems using direct methods. That is, can performance comparable to the language traditionally used for sparse matrix computation, Fortran, be achieved by a Java implementation. Performance evaluation criteria include execution speed and memory requirements. A secondary criterion is ease of development. Many attractive features, unique to the Java programming language, make it desirable for us

APA, Harvard, Vancouver, ISO, and other styles

32

Shramchenko, B. L. "Application of graph theory methods for solving mechatronic tasks." Thesis, Київський національний університет технологій та дизайну, 2018. https://er.knutd.edu.ua/handle/123456789/9715.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Yong, Darryl H. "Solving boundary-value problems for systems of hyperbolic conservation laws with rapidly varying coefficients /." Thesis, Connect to this title online; UW restricted, 2000. http://hdl.handle.net/1773/6760.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Tsankova, Evgenia Kirilova. "Algebraic reasoning of first through third grade students solving systems of two linear equations with two variables." Thesis, Boston University, 2003. https://hdl.handle.net/2144/33575.

Full text

Abstract:

Thesis (Ed.D.)--Boston University<br>PLEASE NOTE: Boston University Libraries did not receive an Authorization To Manage form for this thesis or dissertation. It is therefore not openly accessible, though it may be available by request. If you are the author or principal advisor of this work and would like to request open access for it, please contact us at open-help@bu.edu. Thank you.<br>The purpose of the study was to investigate the algebraic reasoning of first through third grade subjects solving systems of two linear equations with two variables. The population consisted of 60 subjects, 2

APA, Harvard, Vancouver, ISO, and other styles

35

Jonsson, Isak. "Recursive Blocked Algorithms, Data Structures, and High-Performance Software for Solving Linear Systems and Matrix Equations." Doctoral thesis, Umeå : Univ, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-160.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Yaakub, Abdul Razak Bin. "Computer solution of non-linear integration formula for solving initial value problems." Thesis, Loughborough University, 1996. https://dspace.lboro.ac.uk/2134/25381.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

37

BUENO, ANDRE LUIS CAVALCANTI. "SOLVING LARGE SYSTEMS OF LINEAR EQUATIONS ON MULTI-GPU CLUSTERS USING THE CONJUGATE GRADIENT METHOD IN OPENCLTM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2013. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=22099@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Sistemas de equações lineares esparsos e de grande porte aparecem como resultado da modelagem de vários problemas nas engenharias. Dada sua importância, muitos trabalhos estudam métodos para a resolução desses sistemas. Esta dissertação explora o potencial computacional de múltiplas GPUs, utilizando a tecnologia OpenCL, com a finalidade de resolver sistemas de equações lineares de grande porte. Na metodologia proposta, o método do gradiente conjugado é subdivido em kernels que

APA, Harvard, Vancouver, ISO, and other styles

38

Souza, Adão Gomes de. "Resolução de equações via métodos numéricos: bissecção e falsa posição." Universidade Federal de Goiás, 2017. http://repositorio.bc.ufg.br/tede/handle/tede/8079.

Full text

Abstract:

Submitted by Franciele Moreira (francielemoreyra@gmail.com) on 2017-12-27T12:13:05Z No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Adão Gomes de Souza - 2017.pdf: 2241174 bytes, checksum: f485f691848f41537c07408e1c5b96ad (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-12-28T09:30:56Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Adão Gomes de Souza - 2017.pdf: 2241174 bytes, checksum: f485f691848f41537c07408e1c5b96ad (MD5)<br>Mad

APA, Harvard, Vancouver, ISO, and other styles

39

Passos, Livia Novaes Teixeira. "Soluções analíticas e numéricas de equações polinomiais." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-02022018-092819/.

Full text

Abstract:

As equações polinomiais são estudadas desde a antiguidade e atualmente são utilizadas, por exemplo, para modelar problemas do cotidiano nas mais variadas áreas do conhecimento. As técnicas de solução de equações polinomiais nem sempre são triviais, principalmente quando envolvem equações de alta ordem e raízes complexas. O ensino desse tema no Ensino Básico é limitado a equações de segundo ou terceiro grau e coeficientes inteiros, o que restringe a aplicação em problemas mais realistas. Assim, o objetivo deste trabalho é trazer uma contribuição aos estudantes, aos professores do Ensino Básico

APA, Harvard, Vancouver, ISO, and other styles

40

Anderson, Curtis James. "Estimating the Optimal Extrapolation Parameter for Extrapolated Iterative Methods When Solving Sequences of Linear Systems." University of Akron / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=akron1383826559.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Eggers, Andreas [Verfasser], Martin [Akademischer Betreuer] Fränzle, and Nacim [Akademischer Betreuer] Ramdani. "Direct handling of ordinary differential equations in constraint-solving-based analysis of hybrid systems / Andreas Eggers. Betreuer: Martin Fränzle ; Nacim Ramdani." Oldenburg : BIS der Universität Oldenburg, 2014. http://d-nb.info/1056999748/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Molina, Aristizabal Sergio D. "Semi-Regular Sequences over F2." University of Cincinnati / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1445342810.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Hays, Joseph T. "Parametric Optimal Design Of Uncertain Dynamical Systems." Diss., Virginia Tech, 2011. http://hdl.handle.net/10919/28850.

Full text

Abstract:

This research effort develops a comprehensive computational framework to support the parametric optimal design of uncertain dynamical systems. Uncertainty comes from various sources, such as: system parameters, initial conditions, sensor and actuator noise, and external forcing. Treatment of uncertainty in design is of paramount practical importance because all real-life systems are affected by it; not accounting for uncertainty may result in poor robustness, sub-optimal performance and higher manufacturing costs. Contemporary methods for the quantification of uncertainty in dynamical system

APA, Harvard, Vancouver, ISO, and other styles

44

Muševič, Sašo. "Non-stationary sinusoidal analysis." Doctoral thesis, Universitat Pompeu Fabra, 2013. http://hdl.handle.net/10803/123809.

Full text

Abstract:

Muchos tipos de señales que encontramos a diario pertenecen a la categoría de sinusoides no estacionarias. Una gran parte de esas señales son sonidos que presentan una gran variedad de características: acústicos/electrónicos, sonidos instrumentales harmónicos/impulsivos, habla/canto, y la mezcla de todos ellos que podemos encontrar en la música. Durante décadas la comunidad científica ha estudiado y analizado ese tipo de señales. El motivo principal es la gran utilidad de los avances científicos en una gran variedad de áreas, desde aplicaciones médicas, financiera y ópticas, a procesado de rad

APA, Harvard, Vancouver, ISO, and other styles

45

Trad, Farah. "Stability of some hyperbolic systems with different types of controls under weak geometric conditions." Electronic Thesis or Diss., Valenciennes, Université Polytechnique Hauts-de-France, 2024. http://www.theses.fr/2024UPHF0015.

Full text

Abstract:

Le but de cette thèse est d'étudier la stabilisation de certaines équations d'évolution du second ordre. Tout d’abord, nous nous concentrons sur l’étude de la stabilisation d’équations d’évolution du second ordre de type hyperbolique localement faiblement couplées, caractérisées par un amortissement direct dans une seule des deux équations. Comme de tels systèmes ne sont pas exponentiellement stables, nous souhaitons déterminer les taux de décroissance de l’énergie polynomiale. Nos principales contributions concernent les propriétés abstraites de stabilité forte et polynomiale, qui sont dérivé

APA, Harvard, Vancouver, ISO, and other styles

46

Camargos, Ana Flávia Peixoto de. "Computação paralela em GPU para resolução de sistemas de equações algébricas resultantes da aplicação do método de elementos finitos em eletromagnetismo." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/3/3143/tde-29042015-181255/.

Full text

Abstract:

Este trabalho apresenta a aplicação de técnicas de processamento paralelo na resolução de equações algébricas oriundas do Método de Elementos Finitos aplicado ao Eletromagnetismo, nos regimes estático e harmônico. As técnicas de programação paralelas utilizadas foram OpenMP, CUDA e GPUDirect, sendo esta última para as plataformas do tipo Multi-GPU. Os métodos iterativos abordados incluem aqueles do subespaço Krylov: Gradientes Conjugados, Gradientes Biconjugados, Conjugado Residual, Gradientes Biconjugados Estabilizados, Gradientes Conjugados para equações normais (CGNE e CGNR) e Gradientes Co

APA, Harvard, Vancouver, ISO, and other styles

47

Goulart, Andreza Martins Antunes. "A aprendizagem significativa de sistemas de equações do 1º grau por meio da resolução de problemas." Pontifícia Universidade Católica de São Paulo, 2014. https://tede2.pucsp.br/handle/handle/10997.

Full text

Abstract:

Made available in DSpace on 2016-04-27T16:57:31Z (GMT). No. of bitstreams: 1 Andreza Martins Antunes Goulart.pdf: 2398545 bytes, checksum: 47ce4c98a255655ad07a08f56d9c829f (MD5) Previous issue date: 2014-06-10<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>This study aims to investigate whether the teaching and learning of equations of the 1st grade students from the 8th grade of elementary school systems, by means of solving problems allied to the principles of meaningful learning can contribute to an effective knowledge construction. This is a qualitative study, conducte

APA, Harvard, Vancouver, ISO, and other styles

48

Rance, Guillaume. "Commande H∞ paramétrique et application aux viseurs gyrostabilisés." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLS152/document.

Full text

Abstract:

Cette thèse porte sur la commande H∞ par loop-shaping pour les systèmes linéaires à temps invariant d'ordre faible avec ou sans retard et dépendant de paramètres inconnus. L'objectif est d'obtenir des correcteurs H∞ paramétriques, c'est-à-dire dépendant explicitement des paramètres inconnus, pour application à des viseurs gyrostabilisés.L'existence de ces paramètres inconnus ne permet plus l'utilisation des techniques numériques classiques pour la résolution du problème H∞ par loop-shaping. Nous avons alors développé une nouvelle méthodologie permettant de traiter les systèmes linéaires de dim

APA, Harvard, Vancouver, ISO, and other styles

49

Kiefer, Stefan [Verfasser]. "Solving systems of positive polynomial equations / Stefan Kiefer." 2009. http://d-nb.info/997741503/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Farea, Hussain A. "Solving polynomial equations from 2000 B.C. through 20th century." Thesis, 1994. http://hdl.handle.net/1957/35267.

Full text

Abstract:

This paper is divided into two parts. The first part traces (in details providing proofs and examples) the history of the solutions of polynomial equations(of the first, second, third, and fourth degree) by radicals from Babylonian times (2000 B.C.) through 20th century. Also it is shown that there is no solution by radicals for the quintic (fifth degree) and higher degree equations. The second part of this thesis illustrates both numerical and graphical solutions of the quintic and higher degree polynomial equations using modern technology such as graphics calculators (TI-85, and HP-48G) and

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!