Modern Fortran implementation of the DDEABM Adams-Bashforth algorithm

In numerical analysis, a numerical method is a mathematical tool designed to solve numerical problems. The implementation of a numerical method with an appropriate convergence check in a programming language is called a numerical algorithm

Modern Fortran Edition of the DVODE ODE Solver

Implementations of various Algorithms used in Numerical Analysis, from root-finding up to gradient descent and numerically solving PDEs.

Algorithms used in classes. Numerical methods for ordinary differential equations.

Collection of fixed-step IVP solvers. Includes support for matrix-valued IVPs, and provides functions for generating IVP solver equations.

Linear Multistep Method code written in MATLAB for numerical approximations of ODEs.

Repository of my work with Hybrid Systems, covering topics from Reachability Analysis to Predicate Logic

Integração: Newton-Cotes, Gauss-Legendre, Gauss-Hermite, Gauss-Laguerre, Gauss-Чебышёв. Autovalores e Autovetores. Problema de Valor Inicial (PVI): Método de Euler, Runge-Kutta, Adams-Bashforth. Problema de Valor de Contorno (PVC). Derivada: Expansão em Série de Taylor, Função de Interpolação de Newton.

Lotka-Volterra approximations using various numerical methods

Repositório para os códigos da matéria de Métodos Numéricos para Equações Diferenciais IPRJ01-07584

Numerical Analysis course Algorithms.

I have tried to explain the multi-step-methods of solving ODEs via Adams-Bashforth and Adams-Moulton methods which are explicit and implicit methods respectively. I also have implemented them explicitly to solve for a system of ODEs, I have also done an explicit implementation of fourth order Runge-Kutta method in the process as it is needed.