Lecture

Harmonic Oscillator: Numerical Stability Analysis

Graph Chat

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.

In course

PHYS-203: Computational physics I

Aborder, formuler et résoudre des problèmes de physique en utilisant des méthodes numériques simples. Comprendre les avantages et les limites de ces méthodes (stabilité, convergence). Illustrer différents sujets de physique traités dans d'autres cours. ...

Description

This lecture covers numerical methods for solving the harmonic oscillator problem, including explicit and implicit Euler schemes, the Euler-Cromer method, and the Boris-Buneman algorithm. The instructor demonstrates the instability of the explicit Euler scheme and the stability of the implicit Euler scheme. The lecture also discusses the concepts of digital convergence, stability, and symplecticity in the context of oscillatory systems.

Instructor

Laurent Villard

Teaching & PhD Past EPFL PhD Students Matteo Maccio, Olivier Fischer, Gloria Luisa Falchetto, Paolo Angelino, Sébastien Jolliet, Xavier Lapillonne, Thibaut Vernay, Julien Stanislas Pierre Dominski, Gabriele Merlo, Emmanuel Lanti, Noé Ohana, Moahan Murugappan

Official source

Related concepts (31)

Numerical methods for ordinary differential equations

Numerical methods for ordinary differential equations are methods used to find numerical approximations to the solutions of ordinary differential equations (ODEs). Their use is also known as "numerical integration", although this term can also refer to the computation of integrals. Many differential equations cannot be solved exactly. For practical purposes, however – such as in engineering – a numeric approximation to the solution is often sufficient. The algorithms studied here can be used to compute such an approximation.

Numerical stability

In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation. In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues.

Numerical analysis

Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts.

Numerical methods for partial differential equations

Numerical methods for partial differential equations is the branch of numerical analysis that studies the numerical solution of partial differential equations (PDEs). In principle, specialized methods for hyperbolic, parabolic or elliptic partial differential equations exist. Finite difference method In this method, functions are represented by their values at certain grid points and derivatives are approximated through differences in these values.

Euler method

In mathematics and computational science, the Euler method (also called the forward Euler method) is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. It is the most basic explicit method for numerical integration of ordinary differential equations and is the simplest Runge–Kutta method. The Euler method is named after Leonhard Euler, who first proposed it in his book Institutionum calculi integralis (published 1768–1870).

Related lectures (64)

Numerical Derivation: Formulas and Approaches

Covers the numerical approach to derivative calculation, focusing on formulas and methods such as fine differences.

Harmonic Oscillator: Numerical Stability Analysis

Explores the numerical stability of the harmonic oscillator and the importance of improving digital diagrams.

Numerical Methods in Chemistry

Covers the implementation of numerical methods in MATLAB for solving chemical problems.

Numerical Methods for Boundary Value Problems

Covers numerical methods for solving boundary value problems using finite difference, FFT, and finite element methods.

Numerical Methods in Biomechanics: Hip-A