5,970 research outputs found
Análise diferencial de circuitos RC e RL a partir dos métodos numéricos de EULER, HEUN e RUNGE-KUTTA.
No full textEste trabalho aborda os métodos numéricos de Euler, Heun e Runge-Kutta para a resolução de equações diferenciais ordinárias direcionadas para aplicações com circuitos RC e RL, tendo como objetivo a comparação da eficiência desses métodos em se aproximar da solução analítica dessas problemáticas. A análise é feita a partir da construção de algoritmos iterativos na IDE Scilab que calculam o é e o é para os diferentes métodos e para diferentes quantidades de repartições de um intervalo de tempo. Os experimentos consistiram na análise de quatro problemas distintos, onde constatamos a boa adequação dos métodos, e o método de Runge Kutta de quarta ordem teve um melhor desempenho, assim, destacando-se dos demais.Trabalho não financiado por agência de fomento, ou autofinanciad
Ueber combinatorische Variationen
No full textAbhandlung des ... Dr. Runge : womit zu der Freitag den 7. April 1843, ... stattfindenden öffentlichen Prüfung ... einladet / E. F. Augus
Theses de iurisdictione civili
No full textQuas, quod Deus Opt. Max. bene vertat, ex decreto amplissimi Ordinis Iuridicae Facultatis in inclyta Basiliensium Academia, pro consequendis in U.I. Doctoralibus Insignijs & Privilegijs, publice pro virili tueri conabitur Daniel Rungius Pomeranus. Prid. Non. Decemb. hora & loco consuetisEinblattdruckEnthält 70 ThesenDiss. iur. Basel, 158
De praecipius visus symptomatis eorumque causis Physica & Medica contemplatio
No full textpublicae disputationi proposita ... pro felici in Medicam artem inauguratione a Iohanne Rungio Gryphsvaldensi Pomerano disputabitur VIII. Iduum Martij hora VII. loco consuetoEnth. 172 ThesenDiss. med. Basel, 157
Mixed collocation methods for y” = f(x , y)
No full textThe second-order initial value problem y" = f(x,y), y(x(_0)) = y(_0), y'(x(_0)) = z(_0) which does not contain the first derivative explicitly and where the solution is oscillatory has been of great interest for many years. Our aim is to construct numerical methods which are tuned to act efficiently on strongly oscillating functions. The frequencies involved determine the oscillatory character of the function and as the frequencies approach zero, the classical methods are obtained. The exponential- fitting tool has become increasingly popular as it is specially tailored for oscillating functions. Many classes of methods have been used with exponential-fitting and this will be discussed in more detail in the thesis. Collocation methods are considered for which the basis functions are combinations of polynomial and trigonometric terms. The resulting methods can be regarded as Runge-Kutta-Nyström methods with steplength dependent coefficients. We show how order conditions may be obtained, investigate the stability and other properties of particular methods and present some numerical results
Collocation methods for a class of second order initial value problems with oscillatory solutions
No full textWe derive and analyse two families of multistep collocation methods for periodic initial-value problems of the form y" = f(x, y); y((^x)o) = yo, y(^1)(xo) = zo involving ordinary differential equations of second order in which the first derivative does not appear explicitly. A survey of recent results and proposed numerical methods is given in chapter 2. Chapter 3 is devoted to the analysis of a family of implicit Chebyshev methods proposed by Panovsky k Richardson. We show that for each non-negative integer r, there are two methods of order 2r from this family which possess non-vanishing intervals of periodicity. The equivalence of these methods with one-step collocation methods is also established, and these methods are shown to be neither P-stable nor symplectic. In chapters 4 and 5, two families of multistep collocation methods are derived, and their order and stability properties are investigated. A detailed analysis of the two-step symmetric methods from each class is also given. The multistep Runge-Kutta-Nystrom methods of chapter 4 are found to be difficult to analyse, and the specific examples considered are found to perform poorly in the areas of both accuracy and stability. By contrast, the two-step symmetric hybrid methods of chapter 5 are shown to have excellent stability properties, in particular we show that all two-step 27V-point methods of this type possess non-vanishing intervals of periodicity, and we give conditions under which these methods are almost P-stable. P-stable and efficient methods from this family are obtained and demonstrated in numerical experiments. A simple, cheap and effective error estimator for these methods is also given
Theorema runge
No full textDi dalam pembahasan theorema RUnge diperlihatkan
bahwa suatu fungsi rasional di dalamisuatu daerah ter¬tentu dapat dapat didekati oleh suatu fungi analitik.
Mak& dapat dikatakan bahwa fungsi ra5ional akan konver-. gen ke suatu fungsi analitik atau limit dati fungsi ra-sional adalah fungsi analitik.
Salah satu kegunaan dari theorema Runge adalah di
pakai dalam pembuktian theorema Mittag-Leffler.
Maka akan dibahas sedikit tentang kegunaan theorema Runge t ers ebut.
•
•
This document- is Undip Institutional Repository Collection. The 'author(s) or copyright owner(s) agree that UNDIF'-IR: may., vttitho4t,
changing the content, translate the submission to any. medium or fcirmat for the purpose of preservation. The author(s) or copyright'
owner(s) also agree that UNDIP-IR may keep morethan one copy of this 'submission for purpose of security, back-up and preservation: •
=11 ;( http://eprints.yridip.acid
Analysis of Runge-Kutta methods using Butcher tableaus
No full textThis Bachelor thesis provides an analysis of Runge-Kutta methods using Butcher tableaus. Runge-Kutta method are numerical methods used for approximating initial value problems. A Runge-Kutta method can be classified as either an explicit or an implicit method. A special kind of implicit methods are diagonally implicit methods. The type of method can be recognised by the Butcher tableau. Using the entries of the Butcher tableau, one can compute the amplification factor of a Runge-Kutta method. The amplification factor can then be used to compute the order of the local truncation error and the stability region. Examples of these computations are given for seven methods. Furthermore, this thesis provides an algorithm to perform time steps for each of the three types of Runge-Kutta methods. Finally, in order to analyse the global truncation error of the seven methods, the algorithm to perform time steps is used with different step sizes.Applied Mathematic
Determinação da deflexão de uma viga através do método de Runge-Kutta
No full textArtigo AcadêmicoNão possuiAs análises sobre estruturas, especificamente das vigas, possuem grande relevância, considerando o fato de que elas estão presentes em quase todas as edificações, a partir disso, as vigas devem ser determinadas conforme aos esforços e condições de uso a qual as mesmas estarão sujeitas. O objetivo deste trabalho é mostrar equação da linha elástica provinda de um estudo de equações diferenciais e apresentar o método numérico de Runge-Kutta, como forma alternativa de encontrar as deflexões, realizando uma comparação dos valores obtidos dos métodos analítico e numérico, para garantir a convergência do mesmo. No presente trabalho teve-se o auxílio de programas computacionais como o Excel® e MATLAB®, para a realização e aplicação do método, tendo como base todos os conhecimentos adquiridos no decorrer da pesquisa. Este estudo trará um enfoque especial a aplicação do método de Runge-Kutta na deflexão, evidenciando a convergência para a viga bi apoiada e erros obtidos na viga engastada, além de esclarecer as futuras fontes de erro.Trabalho não financiado por agência de fomento, ou autofinanciad
- …
