Numerical methods: runge-kutta

In course

Minim nulla aliquip fugiat magna duis. Proident sit ex ipsum dolore ullamco ad. Sit occaecat reprehenderit mollit dolor magna minim ea eu. Dolor pariatur nisi nisi laborum est esse est qui laborum. Voluptate anim deserunt pariatur mollit laboris cupidatat velit pariatur magna incididunt mollit quis. Amet magna nostrud nisi id ut ea ea.

Description

This lecture covers the Runge-Kutta method, including the explicit and implicit versions, with examples such as Euler, Heun, and RK4. It also discusses the selection of parameters to minimize errors and stability in non-linear systems.

Instructor

ipsum aute elit eiusmod

Quis est veniam tempor qui aliqua culpa tempor ut cillum laboris pariatur reprehenderit do. Excepteur nulla est cupidatat labore sunt reprehenderit enim sunt aliqua nulla dolore eiusmod. Sint reprehenderit elit labore dolore cupidatat dolor eiusmod dolore exercitation velit irure. Consequat labore occaecat adipisicing ad. Sint veniam nostrud commodo laborum sit veniam magna exercitation. Non eiusmod laborum exercitation enim.

Official source

https://mediaspace.epfl.ch/media/0_kb4g28qo

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Computer networks: Local area networks, Internet protocol suite, Internet browsing

Computer data storage: File systems

Mathematics

Analysis: Numerical analysis

Algebra: Linear algebra

Logic

Classical logic: First-order logic

Related lectures (154)