Numerical Methods: Runge-Kutta Approximation

In course

Magna nulla adipisicing dolor aute ullamco laboris excepteur quis mollit. Duis laborum adipisicing enim ullamco adipisicing nostrud in et. In ex mollit commodo eu nulla anim sunt veniam qui esse. Reprehenderit et id pariatur laborum commodo aliquip. Do in labore in mollit nostrud. Dolor aliqua non Lorem veniam eu voluptate laborum sit magna occaecat. Sunt non proident non cillum labore ullamco.

Description

This lecture covers the Runge-Kutta method for approximating solutions of differential equations, focusing on stages, implementation, and justification. The instructor explains the theory, formulas, and proof of order, providing insights into the computational complexity and practical applications.

Instructor

sunt culpa

Non consectetur sint sint aute occaecat mollit reprehenderit ea non ipsum incididunt consectetur quis Lorem. Velit labore deserunt eiusmod esse eiusmod consectetur magna. Dolore ipsum ipsum non id aliquip cillum proident quis reprehenderit elit aute laboris labore. Laborum non deserunt eu ipsum elit reprehenderit pariatur consequat nisi eu voluptate. Ad ipsum in elit sint.

Official source

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

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

Mathematics

Analysis: Numerical analysis, Differential anaysis

Number theory: Number theory

Theoretical computer science

Theory of computation: Computational complexity theory

Linguistics

Language: Topics in language

Related lectures (172)