Relevant bibliographies by topics / Newton algorithms / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Newton algorithms.

Dissertations / Theses on the topic 'Newton algorithms'

Author: Grafiati
Published: 6 September 2023

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 'Newton algorithms.'

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

Wei, Ermin. "Distributed Newton-type algorithms for network resource allocation." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/60822.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 99-101).<br>Most of today's communication networks are large-scale and comprise of agents with local information and heterogeneous preferences, making centralized control and coordination impractical. This motivated much interest in developing and studying distributed algorithms for network resource allocation problems, such as Internet routing, data collection and processing in sensor networks, and
APA, Harvard, Vancouver, ISO, and other styles
2

Saadallah, A. F. "A new approach to quasi-Newton methods for minimization." Thesis, University of Essex, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380374.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Klemes, Marek Carleton University Dissertation Engineering Electronics. "Fast robust Quasi-Newton adaptive algorithms for general array processing." Ottawa, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ghandhari, R. A. "On the use of function values to improve quasi-Newton methods." Thesis, University of Essex, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.328658.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Harrison, Anthony Westbrook. "Algorithms for Computing the Lattice Size." Kent State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=kent1529781033957183.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sassi, Carlos Alberto. "Sobre o desempenho de métodos Quase-Newton e aplicações." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306041.

Full text
Abstract:
Orientador: Maria Aparecida Diniz Ehrhardt<br>Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-16T22:41:08Z (GMT). No. of bitstreams: 1 Sassi_Carlos_M.pdf: 2431422 bytes, checksum: 7e2d7456777a9a43cc62a5524d3fca93 (MD5) Previous issue date: 2010<br>Resumo: Iniciamos este trabalho com o estudo de equações não lineares, transcendentais de uma única variável, com o objetivo principal de abordar sistemas de equações não lineares, analisar os métodos, algoritmos e realizar t
APA, Harvard, Vancouver, ISO, and other styles
7

Gaujoux, Renaud Gilles. "Resolução de sistema KKT por metodo de tipo Newton não diferenciavel." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306442.

Full text
Abstract:
Orientador: Roberto Andreani<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-04T05:03:19Z (GMT). No. of bitstreams: 1 Gaujoux_RenaudGilles_M.pdf: 1743739 bytes, checksum: a3548a59bc983f4398cb0136c62c1d6a (MD5) Previous issue date: 2005<br>Resumo: Esta dissertação trata da aplicação de um método de tipo Newton generalizado aos sistemas KKT. Graças às funções chamadas de NCP, o sistema KKT pode ser reformulado como uma equação do tipo H(z) = O, onde H é uma função semi-suave. Nos
APA, Harvard, Vancouver, ISO, and other styles
8

Woodgate, K. G. "Optimization over positive semi-definite symmetric matrices with application to Quasi-Newton algorithms." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/46914.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zanjácomo, Paulo Régis. "On weighted paths for nonlinear semidefinite complementarity problems and newton methods for semidefinite programming." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/21680.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hüeber, Stefan. "Discretization techniques and efficient algorithms for contact problems." [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-36087.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Abbas, Boushra. "Méthode de Newton régularisée pour les inclusions monotones structurées : étude des dynamiques et algorithmes associés." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS250/document.

Full text
Abstract:
Cette thèse est consacrée à la recherche des zéros d'un opérateur maximal monotone structuré, à l'aide de systèmes dynamiques dissipatifs continus et discrets. Les solutions sont obtenues comme limites des trajectoires lorsque le temps t tend vers l'infini. On s'intéressera principalement aux dynamiques obtenues par régularisation de type Levenberg-Marquardt de la méthode de Newton. On décrira aussi les approches basées sur des dynamiques voisines.Dans un cadre Hilbertien, on s'intéresse à la recherche des zéros de l'opérateur maximal monotone structuré M = A + B, où A est un opérateur maximal
APA, Harvard, Vancouver, ISO, and other styles
12

Bokka, Naveen. "Comparison of Power Flow Algorithms for inclusion in On-line Power Systems Operation Tools." ScholarWorks@UNO, 2010. http://scholarworks.uno.edu/td/1237.

Full text
Abstract:
The goal of this thesis is to develop a new, fast, adaptive load flow algorithm that "automatically alternates" numerical methods including Newton-Raphson method, Gauss-Seidel method and Gauss method for a load flow run to achieve less run time. Unlike the proposed method, the traditional load flow analysis uses only one numerical method at a time. This adaptive algorithm performs all the computation for finding the bus voltage angles and magnitudes, real and reactive powers for the given generation and load values, while keeping track of the proximity to convergence of a solution. This work f
APA, Harvard, Vancouver, ISO, and other styles
13

Chao, Tung-yo. "The numerical modelling of rockbolts in geomechanics by finite element methods." Thesis, Brunel University, 1999. http://bura.brunel.ac.uk/handle/2438/5137.

Full text
Abstract:
In tunnel excavation, the use of rockbolts has long been a popular means of reinforcement in rock masses to prevent the rock opening from caving in. The idea has evolved from the earliest form of rockbolt made of wood to the more up-to-date form of pre-tensioned or grouted steel rockbolts. A major breakthrough in the design of rockbolt models was made by Aydan (1989). This rockbolt element was modelled in coupled form, with one sub-element representing the steel bolt, and the other sub-element the grout. This representation was necessary to model the complex action in the continuous rock mass
APA, Harvard, Vancouver, ISO, and other styles
14

Lewis, Andrew. "Parallel Optimisation Algorithms for Continuous, Non-Linear Numerical solutions." Thesis, Griffith University, 2004. http://hdl.handle.net/10072/367382.

Full text
Abstract:
In computational science and engineering there are growing numbers of increasingly sophisticated, rigorous and realistic numerical simulations of physical systems. Detailed knowledge of a particular area of enquiry is expressed in mathematical terms, realised in computer programs and run on increasingly powerful computer systems. The use of such simulations is now commonplace in a growing collection of industrial design areas. Often, users of these models want to understand their behaviour in response to a variety of input stimuli, bounded by various operational parameters. Commonplace in the
APA, Harvard, Vancouver, ISO, and other styles
15

Clausner, André. "Anwendung von Line-Search-Strategien zur Formoptimierung und Parameteridentifikation." Master's thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-114858.

Full text
Abstract:
Die kontinuierliche Weiterentwicklung und Verbesserung technischer Prozesse erfolgt heute auf der Basis stochastischer und deterministischer Optimierungsstrategien in Kombination mit der numerischen Simulation dieser Abläufe. Da die FE-Simulation von Umformvorgängen in der Regel sehr zeitintensiv ist, bietet sich für die Optimierung solcher Prozesse der Einsatz deterministischer Methoden an, da hier weniger Optimierungsschritte und somit auch weniger FE-Simulationen notwendig sind. Eine wichtige Anforderung an solche Optimierungsverfahren ist globale Konvergenz zu lokalen Minima, da die optima
APA, Harvard, Vancouver, ISO, and other styles
16

Nilsson, Max. "Performance Comparison of Localization Algorithms for UWB Measurements with Closely Spaced Anchors." Thesis, Luleå tekniska universitet, Rymdteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-70996.

Full text
Abstract:
Tracking objects or people in an indoor environment has a wide variety of uses in many different areas, similarly to positioning systems outdoors. Indoor positioning systems operate in a very different environment however, having to deal with obstructions while also having high accuracy. A common solution for indoor positioning systems is to have three or more stationary anchor antennas spread out around the perimeter of the area that is to be monitored. The position of a tag antenna moving in range of the anchors can then be found using trilateration. One downside of such a setup is that the
APA, Harvard, Vancouver, ISO, and other styles
17

Mishchenko, Kateryna. "Numerical Algorithms for Optimization Problems in Genetical Analysis." Doctoral thesis, Västerås : Scool of education, Culture and Communication, Mälardalen University, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-650.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Johansson, Sven. "Active Control of Propeller-Induced Noise in Aircraft : Algorithms & Methods." Doctoral thesis, Karlskrona, Ronneby : Blekinge Institute of Technology, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-00171.

Full text
Abstract:
In the last decade acoustic noise has become more and more regarded as a problem. In cars, boats, trains and aircraft, low-frequency noise reduces comfort. Lightweight materials and more powerful engines are used in high-speed vehicles, resulting in a general increase in interior noise levels. Low-frequency noise is annoying and during periods of long exposure it causes fatigue and discomfort. The masking effect which low-frequency noise has on speech reduces speech intelligibility. Low-frequency noise is sought to be attenuated in a wide range of applications in order to improve comfort and s
APA, Harvard, Vancouver, ISO, and other styles
19

Clausner, André. "Möglichkeiten zur Steuerung von Trust-Region Verfahren im Rahmen der Parameteridentifikation." Thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-114847.

Full text
Abstract:
Zur Simulation technischer Prozesse ist eine hinreichend genaue Beschreibung des Materialverhaltens notwendig. Die hierfür häufig verwendeten phänomenologischen Ansätze, wie im vorliegenden Fall die HILLsche Fließbedingung, enthalten materialspezifische Parameter, welche nicht direkt messbar sind. Die Identifikation dieser Materialparameter erfolgt in der Regel durch Minimierung eines Fehlerquadratfunktionals, welches Differenzen von Messwerten und zugehörigen numerisch berechneten Vergleichswerten enthält. In diesem Zusammenhang haben sich zur Lösung dieser Minimierungsaufgabe die Trust-Regio
APA, Harvard, Vancouver, ISO, and other styles
20

Savas, Berkant. "Algorithms in data mining using matrix and tensor methods." Doctoral thesis, Linköpings universitet, Beräkningsvetenskap, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11597.

Full text
Abstract:
In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. The development of mathematical models and efficient algorithms is of key importance. In this thesis we discuss algorithms for the reduced rank regression problem and algorithms for the computation of the best multilinear rank approximation of tensors. The first two papers deal with the reduced rank regression problem,
APA, Harvard, Vancouver, ISO, and other styles
21

Marin, Manuel. "GPU-enhanced power flow analysis." Thesis, Perpignan, 2015. http://www.theses.fr/2015PERP0041.

Full text
Abstract:
Cette thèse propose un large éventail d'approches afin d'améliorer différents aspects de l'analyse des flux de puissance avec comme fils conducteur l'utilisation du processeurs graphiques (GPU). Si les GPU ont rapidement prouvés leurs efficacités sur des applications régulières pour lesquelles le parallélisme de données était facilement exploitable, il en est tout autrement pour les applications dites irrégulières. Ceci est précisément le cas de la plupart des algorithmes d'analyse de flux de puissance. Pour ce travail, nous nous inscrivons dans cette problématique d'optimisation de l'analyse
APA, Harvard, Vancouver, ISO, and other styles
22

Altoumaimi, Rasha Talal. "Nonlinear Least-Square Curve Fitting of Power-Exponential Functions: Description and comparison of different fitting methods." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-38606.

Full text
Abstract:
This thesis examines how to find the best fit to a series of data points when curve fitting using power-exponential models. We describe the different numerical methods such as the Gauss-Newton and Levenberg-Marquardt methods to compare them for solving non-linear least squares of curve fitting using different power-exponential functions. In addition, we show the results of numerical experiments that illustrate the effectiveness of this approach.Furthermore, we show its application to the practical problems by using different sets of data such as death rates and rocket-triggered lightning retur
APA, Harvard, Vancouver, ISO, and other styles
23

Maciel, Osenildo Marques. "Algoritmos Quase-Newton para otimização multiobjetivo." Universidade Federal do Amazonas, 2016. http://tede.ufam.edu.br/handle/tede/5627.

Full text
Abstract:
Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-03-22T18:10:23Z No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Osenildo M. Maciel.pdf: 1271016 bytes, checksum: d18538c8482aeb9b2cf836dcf47cab90 (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-03-22T18:10:36Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Dissertação - Osenildo M. Maciel.pdf: 1271016 bytes, checksum: d18538c8482aeb9b
APA, Harvard, Vancouver, ISO, and other styles
24

Kostka, Filip. "Umělá neuronová síť pro modelování polí uvnitř automobilu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2014. http://www.nusl.cz/ntk/nusl-220578.

Full text
Abstract:
The project deals with artificial neural networks. After designing and debugging the test data set and the training sample set, we created a multilayer perceptron network in the Neural NetworkToolbox (NNT) of Matlab. When creating networks, we used different training algorithms and algorithms improving the generalization of the network. When creating a radial basis network, we did not use the NNT, but a specific source code in Matlab was written. Functionality of neural networks was tested on simple training and testing patterns. Realistic training data were obtained by the simulation of twelv
APA, Harvard, Vancouver, ISO, and other styles
25

Silva, Isaac Dayan Bastos da. "An?lise e compara??o entre algoritmos de percola??o." Universidade Federal do Rio Grande do Norte, 2008. http://repositorio.ufrn.br:8080/jspui/handle/123456789/17000.

Full text
Abstract:
Made available in DSpace on 2014-12-17T15:26:35Z (GMT). No. of bitstreams: 1 IsaacDBS.pdf: 539336 bytes, checksum: ac9f1f2543159f0c009f0242077b1d5c (MD5) Previous issue date: 2008-07-25<br>In this work, we study and compare two percolation algorithms, one of then elaborated by Elias, and the other one by Newman and Ziff, using theorical tools of algorithms complexity and another algorithm that makes an experimental comparation. This work is divided in three chapters. The &#64257;rst one approaches some necessary de&#64257;nitions and theorems to a more formal mathematical study of percolatio
APA, Harvard, Vancouver, ISO, and other styles
26

FURTADO, Vagner Guidotti. "Circuitos divisores Newton-Raphson e Goldschmidt otimizados para filtro adaptativo NLMS aplicado no cancelamento de interferência." Universidade Catolica de Pelotas, 2017. http://tede.ucpel.edu.br:8080/jspui/handle/jspui/693.

Full text
Abstract:
Submitted by Cristiane Chim (cristiane.chim@ucpel.edu.br) on 2018-05-08T17:34:22Z No. of bitstreams: 1 Vagner Guidotti Furtado (1).pdf: 2942442 bytes, checksum: a43c18ecb28456284d4b6c622f11210d (MD5)<br>Made available in DSpace on 2018-05-08T17:34:22Z (GMT). No. of bitstreams: 1 Vagner Guidotti Furtado (1).pdf: 2942442 bytes, checksum: a43c18ecb28456284d4b6c622f11210d (MD5) Previous issue date: 2017-12-07<br>The division operation in digital systems has its relevance because it is a necessary function in several applications, such as general purpose processors, digital signal processors and
APA, Harvard, Vancouver, ISO, and other styles
27

Margotti, Fábio Junior. "Métodos tipo Newton inexatos para problemas inversos." reponame:Repositório Institucional da UFSC, 2012. http://repositorio.ufsc.br/xmlui/handle/123456789/95234.

Full text
Abstract:
Dissertação (Mestrado) - Universidade Federal de Santa Catarina, Centro de Ciências Físicas e Matemáticas, Programa de Pós-Graduação em Matemática e Computação Científica, Florianópolis, 2011<br>Made available in DSpace on 2012-10-25T22:52:46Z (GMT). No. of bitstreams: 1 291662.pdf: 1027652 bytes, checksum: 9e51b4ba7a328f2f1b06375a27637852 (MD5)<br>Essa dissertação se dedica ao estudo de dois algoritmos do tipo Newton inexatos, usados para a obtenção de soluções regularizadas de problemas inversos não lineares e mal postos. O estudo abrange as propriedades de convergência e estabilidade das so
APA, Harvard, Vancouver, ISO, and other styles
28

Munnae, Jomkwun. "Uncalibrated robotic visual servo tracking for large residual problems." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/37219.

Full text
Abstract:
In visually guided control of a robot, a large residual problem occurs when the robot configuration is not in the neighborhood of the target acquisition configuration. Most existing uncalibrated visual servoing algorithms use quasi-Gauss-Newton methods which are effective for small residual problems. The solution used in this study switches between a full quasi-Newton method for large residual case and the quasi-Gauss-Newton methods for the small case. Visual servoing to handle large residual problems for tracking a moving target has not previously appeared in the literature. For large residu
APA, Harvard, Vancouver, ISO, and other styles
29

Bocanegra, Silvana. "Algoritmos de Newton-Krylov precondicionados para métodos de pontos interiores." Universidade Federal de Minas Gerais, 2005. http://hdl.handle.net/1843/RVMR-6JTN72.

Full text
Abstract:
Interior point methods have been widely used to solve large-scale linear programming problems. The bulk of the work in these methods is computing the search direction by solving one or more linear systems. The most commom approach in interior point solvers uses Cholesky sparse factorization to solve these systems. In some problems this factorization becomes prohibitive due to storage and time limitations. Iterative approaches are more interesting in these situations. Since these systems are ill-conditioned, it is crucial to develop ecient econditioners. However it is dicult to find a precondit
APA, Harvard, Vancouver, ISO, and other styles
30

Liu, Qi. "CIRCE a new software to predict the steady state equilibrium of chemical reactions." Thesis, Compiègne, 2018. http://www.theses.fr/2018COMP2455/document.

Full text
Abstract:
L'objectif de cette thèse est de développer un nouveau code pour prédire l'équilibre final d'un processus chimique complexe impliquant beaucoup de produits, plusieurs phases et plusieurs processus chimiques. Des méthodes numériques ont été développées au cours des dernières décennies pour prédire les équilibres chimiques finaux en utilisant le principe de minimisation de l'enthalpie libre du système. La plupart des méthodes utilisent la méthode des « multiplicateurs de Lagrange » et résolvent les équations en employant une approximation du problème de Lagrange et en utilisant un algorithme de
APA, Harvard, Vancouver, ISO, and other styles
31

Chèze, Guillaume. "Des méthodes symboliques-numériques et exactes pour la factorisation absolue des polynômes en deux variables." Nice, 2004. http://www.theses.fr/2004NICE4092.

Full text
Abstract:
Cette thèse porte sur les algorithmes de factorisation absolue. Elle débute par un état de l'art (avant notre travail) puis présente nos contributions. Celles-ci sont organisées en deux parties. La première partie correspond à l'étude symbolique-numérique. Nous donnons une méthode permettant d'obtenir une factorisation absolue exacte à partir d'une factorisation absolue approchée. Ensuite cette méthode est utilisée pour obtenir un algorithme de factorisation absolue. Cet algorithme reprend des idées développées par A. Galligo, D. Rupprecht, et, M. An Hoeij. Grâce à l'utilisation de l'algorithm
APA, Harvard, Vancouver, ISO, and other styles
32

Safeea, Mohammad. "Des robots manipulateurs collaboratifs sûrs." Thesis, Paris, HESAM, 2020. http://www.theses.fr/2020HESAE036.

Full text
Abstract:
Les manipulateurs industriels collaboratifs ouvrent une nouvelle ère dans la fabrication flexible, où les robots et les humains sont capables de coexister et de travailler ensemble. Cependant, divers défis persistent pour parvenir à une collaboration complète entre les robots et les humains en milieu industriel. Dans cette thèse, deux défis principaux - la sécurité et la collaboration - sont abordés pour atteindre cet objectif. Concernant la sécurité, la thèse présente une méthode d'évitement des collisions en temps réel qui permet au robot d'ajuster les chemins générés hors ligne pour une tâc
APA, Harvard, Vancouver, ISO, and other styles
33

Segalat, Philippe. "Méthodes de points intérieurs et de quasi-Newton." Limoges, 2002. http://www.theses.fr/2002LIMO0041.

Full text
Abstract:
Cette thèse s' intéresse à des méthodes de ponts intérieurs et de quasi-Newton en optimisation non linéaire et à leurs mises en oeuvre. On présente le code NOPTIQ utilisant les formules de BFGS à mémoire limitée pour résoudre des problèmes de grande taille. L' originalité de cette approche est l' emploi de ces formules dans le cadre des méthodes de points intérieurs. L' espace mémoire et le coût en opérations du calcul d' une itération sont alors faibles. Le code NOPTIQ est robuste et a des performances comparables avec les codes de références 1-BFGS-B et LANCELOT. On présente aussi un algorit
APA, Harvard, Vancouver, ISO, and other styles
34

Heidt, David Charles. "A detailed derivation of a Newton-Raphson based harmonic power flow." Ohio University / OhioLINK, 1994. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1177098558.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

SEGALAT, Philippe. "Méthodes de Points Intérieurs et de quasi-Newton." Phd thesis, Université de Limoges, 2002. http://tel.archives-ouvertes.fr/tel-00005478.

Full text
Abstract:
Cette thèse s'intéresse à des méthodes de points intérieurs et de quasi-Newton en optimisation non linéaire et à leurs mises en oeuvre. On présente le code NOPTIQ utilisant les formules de BFGS à mémoire limitée pour résoudre des problèmes de grande taille. L'originalité de cette approche est l'emploi de ces formules dans le cadre des méthodes de points intérieurs. L'espace mémoire et le coût en opérations du calcul d'une itération sont alors faibles. Le code NOPTIQ est robuste et a des performances comparables avec les codes de références l-BFGS-B et LANCELOT. On présente aussi un algorithme
APA, Harvard, Vancouver, ISO, and other styles
36

Böhm, Josef. "Linking Geometry, Algebra and Calculus with GeoGebra." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-79488.

Full text
Abstract:
GeoGebra is a free, open-source, and multi-platform software that combines dynamic geometry, algebra and calculus in one easy-to-use package. Students from middle-school to university can use it in classrooms and at home. In this workshop, we will introduce the features of GeoGebra with a special focus on not very common applications of a dynamic geometry program. We will inform about plans for developing training and research networks connected to GeoGebra. We can expect that at the time of the conference a spreadsheet will be integrated into GeoGebra which offers new ways teaching mathematic
APA, Harvard, Vancouver, ISO, and other styles
37

Nejat, Amir. "A higher-order accurate unstructured finite volume Newton-Krylov algorithm for inviscid compressible flows." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/30969.

Full text
Abstract:
A fast implicit (Newton-Krylov) finite volume algorithm is developed for higher-order unstructured (cell-centered) steady-state computation of inviscid compressible flows (Euler equations). The matrix-free General Minimal Residual (GMRES) algorithm is used for solving the linear system arising from implicit discretization of the governing equations, avoiding expensive and complicated explicit computation of the higher-order Jacobian matrix. An Incomplete Lower-Upper factorization technique is employed as the preconditioning strategy and a first-order Jacobian as a preconditioning matrix. The s
APA, Harvard, Vancouver, ISO, and other styles
38

Howe, Melendres Amoro. "A quasi-Newton algorithm for continuous minimax with applications to risk management in finance." Thesis, Imperial College London, 1994. http://hdl.handle.net/10044/1/11772.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Mendez, Cruz Gilberto Amado. "Algoritmos paralelos iterativos do tipo quasi-Newton para a minimização de funções multivariadas." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 1997. http://hdl.handle.net/10183/126491.

Full text
Abstract:
O objetivo deste trabalho é apresentar e descrever a teoria e implementação paralela. em PVM, de dois algoritmos iterativos do tipo quasi-Newton - Newton-GNIRES e Broyden- para a solução de equações não lineares F= O, onde a função F: Rn -t Rn é de classe C1 e seu Jacobiano J( x) é esparso. Uma ilustração e comparação destes métodos com suas versões sequenciais é obtida ao aplicá-los a dois probJemas específicos.<br>The objective of this work is to introduce anel describe the theory anel implementation on PVM, of two quase-Newton iterative algorithms - NewtonGA1RES e Broyden - for the resoluti
APA, Harvard, Vancouver, ISO, and other styles
40

Buchanan, Aeron Morgan. "Tracking non-rigid objects in video." Thesis, University of Oxford, 2008. http://ora.ox.ac.uk/objects/uuid:82efb277-abc9-4725-9506-5d114a83bd96.

Full text
Abstract:
Video is a sequence of 2D images of the 3D world generated by a camera. As the camera moves relative to the real scene and elements of that scene themselves move, correlated frame-to-frame changes in the video images are induced. Humans easily identify such changes as scene motion and can readily assess attempts to quantify it. For a machine, the identification of the 2D frame-to-frame motion is difficult. This problem is addressed by the computer vision process of tracking. Tracking underpins the solution to the problem of augmenting general video sequences with artificial imagery, a staple t
APA, Harvard, Vancouver, ISO, and other styles
41

Ruggiero, Márcia Aparecida Gomes 1956. "Metodos quase - Newton para resolução de sistemas não lineares esparsos e de grande porte." [s.n.], 1990. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260907.

Full text
Abstract:
Orientador: Jose Mario Martinez<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica<br>Made available in DSpace on 2018-07-13T21:54:34Z (GMT). No. of bitstreams: 1 Ruggiero_MarciaAparecidaGomes_D.pdf: 5439513 bytes, checksum: 7a885b7a3c93d3d8741a336bc054a8fc (MD5) Previous issue date: 1990<br>Resumo: O objetivo deste trabalho é o estudo e a análise do desempenho computacional do método de Newton e oito métodos tipo quase-Newton quando aplicados a resolução de sistemas não lineares esparsos, e de grande porte. Por razões de estabilidade numérica optamos p
APA, Harvard, Vancouver, ISO, and other styles
42

Morad, Farhad. "Non-linear Curve Fitting." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-43600.

Full text
Abstract:
The work done in this thesis is to examine various methods for curve fitting. Linear least squares and non-linear least squares will be described and compared, and the Newton method, Gauss--Newton method and Levenberg--Marquardt method will be applied to example problems.<br>Syftet med denna uppsats är att beskriva och använda olika metoder för kurvanpassning, det vill säga att passa matematiska funktioner till data. De metoder som undersöks är Newtons metod, Gauss--Newton metoden och Levenberg--Marquardt metoden. Även skillnaden mellan linjär minsta kvadrat anpassning och olinjär minsta kvadr
APA, Harvard, Vancouver, ISO, and other styles
43

Guterres, Marcelo Xavier. "Avaliação dos algoritmos de Picard-Krylov e Newton-Krylov na solução da equação de Richards." Universidade do Estado do Rio de Janeiro, 2013. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=6749.

Full text
Abstract:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>A engenharia geotécnica é uma das grandes áreas da engenharia civil que estuda a interação entre as construções realizadas pelo homem ou de fenômenos naturais com o ambiente geológico, que na grande maioria das vezes trata-se de solos parcialmente saturados. Neste sentido, o desempenho de obras como estabilização, contenção de barragens, muros de contenção, fundações e estradas estão condicionados a uma correta predição do fluxo de água no interior dos solos. Porém, como a área das regiões a serem estudas com relação à predição do
APA, Harvard, Vancouver, ISO, and other styles
44

Nouet, Christophe. "Réduction de l'ordre des systèmes continus, linéaires, via un processus d'orthogonalisation et un algorithme de gauss newton." Brest, 1994. http://www.theses.fr/1994BRES2040.

Full text
Abstract:
Nous avons développé une méthode d'approximation des signaux et systèmes à temps continu, optimale au sens des moindres carres. À partir de la seule connaissance de la transformée de Laplace rationnelle ou irrationnelle de la réponse, par exemple impulsionnelle ou indicielle d'un système initial, nous déterminons le meilleur modèle approche dont la réponse, soit la plus proche possible de celle du modèle original. Nous exprimons toujours le modèle approche sous forme d'une transformée de Laplace rationnelle. La qualité de l'approximation est mesurée à l'aide du critère d'erreur quadratique. La
APA, Harvard, Vancouver, ISO, and other styles
45

Stewart, Alistair Mark. "Efficient algorithms for infinite-state recursive stochastic models and Newton's method." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10001.

Full text
Abstract:
Some well-studied infinite-state stochastic models give rise to systems of nonlinear equations. These systems of equations have solutions that are probabilities, generally probabilities of termination in the model. We are interested in finding efficient, preferably polynomial time, algorithms for calculating probabilities associated with these models. The chief tool we use to solve systems of polynomial equations will be Newton’s method as suggested by [EY09]. The main contribution of this thesis is to the analysis of this and related algorithms. We give polynomial-time algorithms for calculat
APA, Harvard, Vancouver, ISO, and other styles
46

Pettersson, Stefan. "Implementation and evaluation of a polynomial-based division algorithm." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1900.

Full text
Abstract:
<p>In comparison to other basic arithmetic operations, such as addition, subtraction and multiplication,division is far more complex and expensive. Many division algorithms, except for lookup tables, rely on recursion with usually complex operations in the loop. Even if the cost in terms of area and computational complexity sometimes can be made low, the latency is usually high anyway, due to the number of iterations required. Therefore, in order to find a faster method and a method that provides better precision, a non-recursive polynomial-based algorithm was developed by the Department of El
APA, Harvard, Vancouver, ISO, and other styles
47

Dolák, Martin. "Nelineární regrese v programu R." Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-193088.

Full text
Abstract:
This thesis deals with solutions of nonlinear regression problems using R programming language. The introductory theoretical part is devoted to familiarization with the principles of solving nonlinear regression models and of their applications in the program R. In both, theoretical and practical part, the most famous and used differentiator algorithms are presented, particularly the Gauss-Newton's and of the steepest descent method, for estimating the parameters of nonlinear regression. Further, in the practical part, there are some demo solutions of particular tasks using nonlinear regressio
APA, Harvard, Vancouver, ISO, and other styles
48

Fijany, Amir. "Algorithmes et architectures parallèles en robotique." Paris 11, 1988. http://www.theses.fr/1988PA112258.

Full text
Abstract:
La simulation et le contrôle des mouvements d'un robot manipulateur nécessitent la résolution des problèmes cinématiques et dynamiques. Une capacité de calcul insuffisante a toujours constitué l'obstacle majeur de la simulation et du contrôle en temps réel des mouvements d'un robot manipulateur. Il est unanimement reconnu que l'utilisation d'architectures informatiques parallèles est un facteur clé pour surmonter cet obstacle. L'objectif de ce travail est de déduire les caractéristiques essentielles puis de mettre en oeuvre une architecture hautement parallèle qui procure les améliorations sig
APA, Harvard, Vancouver, ISO, and other styles
49

Guo, Chaomei. "Amélioration des propriétés de convergence des algorithmes de simulation des circuits non linéaires microondes." Limoges, 1995. http://www.theses.fr/1995LIMO0024.

Full text
Abstract:
Ce travail propose une etude des methodes d'analyse numerique dans le domaine des circuits non lineaires microondes, basee sur l'amelioration des proprietes de convergence des algorithmes. La principale methode classique de la resolution des equations d'equilibrage harmonique est presentee. Elle est suivie par les descriptions des methodes abs, quasi-newton et de relaxation. Les methodes de type abs sont des methodes iteratives de resolution dont les proprietes de convergence peuvent apporter une amelioration du temps de calcul global. A partir de l'application d'equilibrage harmonique, il est
APA, Harvard, Vancouver, ISO, and other styles
50

Maldonado, Angela Mabel. "Sobre o algoritmo de Newman -O'Brien para geração de p-grupos." [s.n.], 1994. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306214.

Full text
Abstract:
Orientador: Norai Romeu Rocco<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Científica<br>Made available in DSpace on 2018-07-19T14:11:03Z (GMT). No. of bitstreams: 1 Maldonado_AngelaMabel_M.pdf: 3014977 bytes, checksum: 729fd219615f4c01f74c43e795ecb40c (MD5) Previous issue date: 1994<br>Resumo: O propósito deste trabalho é estudar os aspectos teóricos e certos detalhes da implementação do Algoritmo para geração de p-grupos desenvolvido por M.F. Newman e E.A. O'Brien. A implementação deste algoritmo permite o cálculo de certa
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!

To the bibliography