Lecture

Matlab Programming III

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

ME-213: Programmation pour ingénieur

Mettre en pratique les bases de la programmation vues au semestre précédent. Développer un logiciel structuré. Méthode de debug d'un logiciel. Introduction à la programmation scientifique. Introduction à l'instrumentation virtuelle. ...

Description

This lecture covers advanced topics in Matlab programming, including cell arrays, anonymous functions, logical arrays, 3D surfaces, parametric curves, interpolation, and fitting. The instructor demonstrates how to define and manipulate cell arrays, create 3D surfaces, and perform interpolation using Matlab.

Instructor

Christophe Salzmann

Expertise Real-time Internet ServicesReal-time controlQuality of Service and Bandwidth adaptationLabVIEW Education PhD | Remote experimentation, Network 2005 – 2005 EPFL Directed by Denis Gillet MS. Degree | Computer Science 1999 – 1999 University of Florida Directed by Prof. H. Latchman Teaching & PhD Past EPFL PhD Students as codirector Damien Perritaz, Evgeny Bogdanov, Wissam Halimi Courses Control systems + TP ME

Official source

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related concepts (32)

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Anonymous function

In computer programming, an anonymous function (function literal, lambda abstraction, lambda function, lambda expression or block) is a function definition that is not bound to an identifier. Anonymous functions are often arguments being passed to higher-order functions or used for constructing the result of a higher-order function that needs to return a function. If the function is only used once, or a limited number of times, an anonymous function may be syntactically lighter than using a named function.

Array programming

In computer science, array programming refers to solutions that allow the application of operations to an entire set of values at once. Such solutions are commonly used in scientific and engineering settings. Modern programming languages that support array programming (also known as vector or multidimensional languages) have been engineered specifically to generalize operations on scalars to apply transparently to vectors, matrices, and higher-dimensional arrays.

Multivariate interpolation

In numerical analysis, multivariate interpolation is interpolation on functions of more than one variable (multivariate functions); when the variates are spatial coordinates, it is also known as spatial interpolation. The function to be interpolated is known at given points and the interpolation problem consists of yielding values at arbitrary points . Multivariate interpolation is particularly important in geostatistics, where it is used to create a digital elevation model from a set of points on the Earth's surface (for example, spot heights in a topographic survey or depths in a hydrographic survey).

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

Related lectures (64)

Matlab: 3D Surface Plotting

Covers logical arrays, 3D surface plotting, parametric curves, interpolation, and fitting in Matlab.

Finite Element Method

Covers the Finite Element Method, discussing the derivation of the equation of motion and exploring mass and stiffness matrices.

Matlab Programming: Script and Function

Explores Matlab programming with scripts and functions, vectorization, and 2D graphics.

Deep Learning Modus Operandi

Explores the benefits of deeper networks in deep learning and the importance of over-parameterization and generalization.

Error Analysis and Interpolation