Location:
Search - IMPLICIT RUNGE
Search list
Description: DIRK3 algorithm, the algorithm to be implenmented is the optimal two stage third order accurate Diagnonally Implicit Runge-Kutta method, written DIRD3, for the ODE prolem and diffrentiate equations.
Platform: |
Size: 1024 |
Author: Kiwi |
Hits:
Description: This file conclude of five codes , four of them in Mathematica program and one in C++.
1. Erk4.nb. this code represent the explicit Runge Kutta method of order four for solving first order ODE.
2. RK45.nb This code represent the Embedded Runge Kutta Felhberg method for solving first order ODE.
3. EularStability.nb. This code represent how to find the stability region for the Eular method in 2D and 3D. its allow to modify the code to find the stability for any method.
4. RadauI.c . This code represent the fifth order implicit RadauI for solving first order ODE.
5. HEUN.nb. This code represent the third order Runge kutta method (Hune) Method for systems of ODE.
-This file conclude of five codes , four of them in Mathematica program and one in C++.
1. Erk4.nb. this code represent the explicit Runge Kutta method of order four for solving first order ODE.
2. RK45.nb This code represent the Embedded Runge Kutta Felhberg method for solving first order ODE.
3. EularStability.nb. This code represent how to find the stability region for the Eular method in 2D and 3D. its allow to modify the code to find the stability for any method.
4. RadauI.c . This code represent the fifth order implicit RadauI for solving first order ODE.
5. HEUN.nb. This code represent the third order Runge kutta method (Hune) Method for systems of ODE.
Platform: |
Size: 40960 |
Author: OS |
Hits:
Description: the Runge–Kutta methods are an important family of implicit and explicit iterative methods for the approximation of solutions of ordinary differential equations.
Platform: |
Size: 2740224 |
Author: criskell |
Hits:
Description: 龙格－库塔法（Runge-Kutta）是用于模拟常微分方程的解的重要的一类隐式或显式迭代法。-Runge- Kutta method (Runge-Kutta) is used to simulate the ordinary differential equations of an important class of implicit or explicit iterative method.
Platform: |
Size: 1024 |
Author: 张勇 |
Hits:
Description: Fortran77编写而成。基于连续的原理解决stiff两点边值常微分问题，是由Cash改编自TWPBVP程序。
内有说明，算例和参考信息，并且附有stiff问题的一些结果。-Automatic Continuation with Deferred Corrections
The package ACDC (which is written in FORTRAN 77) is designed to solve stiff two-point boundary value
problems for ordinary di erential equations by using continuation. We note that ACDC is a modiffcation of the package TWPBVP of Cash and M. H. Wright and that many of the original
subroutines used in TWPBVP remain unchanged in the new code. ACDC has been adapted to allow
an automatic continuation strategy to be used. Furthermore, the new code incorporates implicit
Runge-Kutta formulae, based on Lobatto points,rather than the mono-implicit formulae used in
the original code. This code is a companion to the continuation code COLMOD, which implements
our continuation strategy together with a high-order collocation method.
Platform: |
Size: 270336 |
Author: 刘项 |
Hits:
Description: 利用常用四阶龙格-库塔公式求初值，再利用汉明公式、米尔恩公式和改进的四阶亚当斯隐式公式及常用的四阶龙格-库塔公式求解其余的数值解求解常微分方程初值问题，并计算它与精确解的误差-Use of commonly used fourth order Runge- Kutta initial value to the Formula, and then use the Hamming formula, Milne formula and improved fourth-order implicit Adams formula and the commonly used Runge- Kutta formula for solving the numerical solution for solving the remaining ordinary Differential Equations, and calculate the error it with exact solutions
Platform: |
Size: 7168 |
Author: honghong |
Hits:
Description: runge kutta方法求解常微分方程-the Runge–Kutta methods (German pronunciation: are an important family of implicit and explicit iterative methods for the approximation of solutions of ordinary differential equations. These techniques were developed around 1900 by the German mathematicians C. Runge and M.W. Kutta.
Platform: |
Size: 126976 |
Author: dfg |
Hits:
Description: 阿当姆斯显式和隐式求解方法，用四阶龙格库塔作为起始，然后运用四阶阿当姆斯算法求解初值问题。主要程序包含在test2.cpp中，方法简单易懂。编译环境VC2010-Adam James explicit and implicit method for solving fourth-order Runge-Kutta as a start, then use the fourth-order A Williams algorithm for solving initial value problem. The main program contains in test2.cpp method is simple and easy to understand. Compile environment VC2010
Platform: |
Size: 3856384 |
Author: 张洪超 |
Hits:
Description: matlab仿真微分方程，分别用欧拉法，改进欧拉法，龙格库塔法，四阶adams显式隐式算法对比精度。-matlab simulation of differential equations, respectively, with Euler, improved Euler method, Runge-Kutta method, fourth-order implicit algorithm adams explicit comparison accuracy.
Platform: |
Size: 30720 |
Author: 王帅 |
Hits:
Description: NS方程通量分裂 - 程序，显式：龙格 - 库塔，隐：LINE高斯 - 赛德尔- NS equation FLUX SPLITTING- SPIELPROGRAMM
EXPLICIT : RUNGE-KUTTA
IMPLICIT : LINE GAUSS-SEIDEL
Platform: |
Size: 120832 |
Author: yangxintie |
Hits:
Description: Roe格式 二维Euler fortran语言的，网格文件是非结构网格-This code computes a steady flow over a bump with the Roe flux by two solution methods: explicit 2-stage Runge-Kutta scheme and implicit (defect correction) method with the Jacobian exact for 1st-order scheme, on irregular triangular grids.
Platform: |
Size: 46080 |
Author: 陈 |
Hits:
Description: In numerical analysis and scientific computing, the Gauss–Legendre methods are a family of numerical methods for ordinary differential equations. Gauss–Legendre methods are implicit Runge–Kutta methods. More specifically, they are collocation methods based on the points of Gauss–Legendre quadrature. The Gauss–Legendre method based on s points has order 2
Platform: |
Size: 1024 |
Author: amir hossein |
Hits:
Description: 数值分析解初值问题。
Step 1: 用经典4阶Runge-Kutta 法计算前3 个初值
Step 2: 用Adams 显式计算预测值
Step 3: 用同阶Adams 隐式计算校正值
-Numerical solution of initial value problem.
Step 1: use a classic four order Runge- Kutta method to calculate the former three initial value
Step 2: use Adams explicitly calculate predictive value
Step 3: use the same order Adams implicit computational correction
Platform: |
Size: 1024 |
Author: 吴鹏 |
Hits:
Description: 提出了求解一类随机常微分方程(SODEs)的3种Runge-Kutta格式:显式Runge-Kutta格式、半隐式Runge-Kutta格式和隐式Runge-Kutta格式.讨论了这3种Runge-Kutta格式的T稳定条件,并给出了部分数值实验结果.-We proposed to solve a class of stochastic ordinary differential equations (SODEs) three Runge-Kutta Format: Explicit Runge-Kutta format, semi-implicit Runge-Kutta format and implicit Runge-Kutta format discussed the three kinds of Runge-Kutta. T stable conditional formatting, and gives some numerical results.
Platform: |
Size: 4550656 |
Author: 张萌萌 |
Hits:
Description: 古典四级四阶显式Runge—Kuuta方法和隐式二级四阶Runge-Kutta的范例-Classical four-order explicit Runge-Kuuta method and implicit second-order fourth-order Runge-Kutta example
Platform: |
Size: 1024 |
Author: cyw |
Hits:
Description: Runge–Kutta 4th
In numerical analysis, the Runge–Kutta methods are a family of implicit and explicit iterative methods, which includes the well-known routine called the Euler Method, used in temporal discretization for the approximate solutions of ordinary differential equations.
Platform: |
Size: 1024 |
Author: hamid |
Hits: