Lecture

Runge Kutta Method

Description

This lecture covers the Runge Kutta method, explaining the explicit scheme of order 4 ERK4, optimization with constraints, and the application to optimal control and neural networks. It also discusses the general formula for a s stages explicit Runge Kutta method.

Instructor

sit duis

Veniam deserunt non sit aute anim mollit sit proident. Anim ullamco dolore officia commodo eiusmod commodo mollit ea eu et eiusmod veniam tempor laborum. Exercitation sit aliquip id magna veniam quis. Magna deserunt et et sunt sunt labore sunt minim officia sint laboris. Ut aliqua duis cillum aute irure. Elit eiusmod dolor eiusmod deserunt Lorem do irure eu cupidatat elit reprehenderit.

Official source

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

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

Mathematics

Analysis: Numerical analysis

Related lectures (60)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.