Lecture

Introduction to Numerical 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

MATH-456: Numerical analysis and computational mathematics

The course provides an introduction to scientific computing. Several numerical methods are presented for the computer solution of mathematical problems arising in different applications. The software MATLAB is used to solve the problems and verify the theo ...

Description

This lecture introduces the fundamental concepts of numerical analysis, covering topics such as the mathematical formulation of physical problems, adaptive feature computation, residual analysis, and the importance of well-posed mathematical problems. The instructor explains the process of finding numerical solutions to mathematical problems, considering factors like conditioning numbers, truncation errors, and convergence criteria.

Instructor

Laura Grigori

Expertise Numerical linear algebra, deterministic and randomized algorithmsHigh performance computing for scientific applicationsHigh dimensional problems and tensor computationsApplications in astrophysics, molecular simulations, etcCombinatorial scientific computingMathematical Software Teaching & PhD PhD Students Israa Fakih, Zhipeng Xue, Andrea Di Antonio, Mariana Graciela Martinez Aguilar, Guifré Sánchez i Serra Courses Numerical analysis and computational mathematics MATH-456 The cou

Official source

Related concepts (32)

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.

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).

Neumann boundary condition

In mathematics, the Neumann (or second-type) boundary condition is a type of boundary condition, named after Carl Neumann. When imposed on an ordinary or a partial differential equation, the condition specifies the values of the derivative applied at the boundary of the domain. It is possible to describe the problem using other boundary conditions: a Dirichlet boundary condition specifies the values of the solution itself (as opposed to its derivative) on the boundary, whereas the Cauchy boundary condition, mixed boundary condition and Robin boundary condition are all different types of combinations of the Neumann and Dirichlet boundary conditions.

Dirichlet boundary condition

In the mathematical study of differential equations, the Dirichlet (or first-type) boundary condition is a type of boundary condition, named after Peter Gustav Lejeune Dirichlet (1805–1859). When imposed on an ordinary or a partial differential equation, it specifies the values that a solution needs to take along the boundary of the domain. In finite element method (FEM) analysis, essential or Dirichlet boundary condition is defined by weighted-integral form of a differential equation.

Residual (numerical analysis)

Loosely speaking, a residual is the error in a result. To be precise, suppose we want to find x such that Given an approximation x0 of x, the residual is that is, "what is left of the right hand side" after subtracting f(x0)" (thus, the name "residual": what is left, the rest). On the other hand, the error is If the exact value of x is not known, the residual can be computed, whereas the error cannot. Similar terminology is used dealing with differential, integral and functional equations.

Related lectures (64)

Mathematics of Data: Models and Learning

Explores models, learning paradigms, and applications in Mathematics of Data.

Waves in Inhomogeneous Medium

Explores waves in inhomogeneous media, covering initial and boundary conditions, numerical stability, eigen modes, and propagation principles.

Finite Difference Grids

Explains finite difference grids for computing solutions of elastic membranes using Laplace's equation and numerical methods.

Consistency and Stability in Numerical Methods

Explores consistency and stability in numerical methods, emphasizing error analysis and the role of boundary conditions.

Transport Equation: Numerical Analysis