Lecture

Design of Code and Project Description

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

MATH-458: Programming concepts in scientific computing

The aim of this course is to provide the background in scientific computing. The class includes a brief introduction to basic programming in c++, it then focuses on object-oriented programming and c++ specific programming techniques. Typical class hierarch ...

Description

This lecture covers the process of making scientific software, including activities, algorithms description, implementation, and an example of a scientific question. It also discusses the rules and requirements for a project involving Eigenvalue problems, Ordinary Differential Equations, Non-linear systems, Data approximation, Numerical Integration, Image/sound processing, and Monte Carlo simulations.

Instructor

Guillaume Anciaux

ResearchResearch Topics My research can be decomposed in three main blocks:First, the main goal of my current research is the physical description of contact interactions. I performed numerous studies of this topic using different models from the continuum scale down to atomistic scale. Since atomic phenomena and macroscopic observations are linked, the physics of contact needs the simultaneous consideration of several scales. For instance, plasticity is a theory defined for the macroscopic scale whereas t

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (27)

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 integration

In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe the numerical solution of differential equations. This article focuses on calculation of definite integrals. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for numerical integration, especially as applied to one-dimensional integrals.

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 differentiation

In numerical analysis, numerical differentiation algorithms estimate the derivative of a mathematical function or function subroutine using values of the function and perhaps other knowledge about the function. The simplest method is to use finite difference approximations. A simple two-point estimation is to compute the slope of a nearby secant line through the points (x, f(x)) and (x + h, f(x + h)). Choosing a small number h, h represents a small change in x, and it can be either positive or negative.

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.

Related lectures (64)

Numerical Analysis: Introduction to Computational Methods

Covers the basics of numerical analysis and computational methods using Python, focusing on algorithms and practical applications in mathematics.

Power Systems Dynamics: Transient Stability

Explores transient stability in power systems dynamics, covering algebraic equations, generator models, and numerical integration techniques.

Numerical Differentiation: Part 1

Covers numerical differentiation, forward differences, Taylor's expansion, Big O notation, and error minimization.

Euler Forward Method

Introduces the Euler Forward Method for ODEs, focusing on error analysis and stability.

Numerical Methods: Boundary Value Problems