**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Heterogeneous Catalysis: Adsorption & Kinetics

Description

This lecture covers the fundamental concepts of heterogeneous catalysis, focusing on adsorption mechanisms and elementary step kinetics. The instructor explains the types of adsorption, such as physisorption and chemisorption, and delves into the Sabatier's principle. The lecture also discusses the Langmuir isotherm and the role of active sites in catalytic reactions, emphasizing the importance of transport effects. Computer exercises are included to analyze rate data and understand the transport phenomena in catalysis.

Official source

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.

Instructor

In course

ChE-403: Heterogenous reaction engineering

The theoretical background and practical aspects of heterogeneous reactions including the basic knowledge of heterogeneous catalysis are introduced. The fundamentals are given to allow for the use of

Related concepts (297)

Heterogeneous catalysis

Heterogeneous catalysis is catalysis where the phase of catalysts differs from that of the reactants or products. The process contrasts with homogeneous catalysis where the reactants, products and catalyst exist in the same phase. Phase distinguishes between not only solid, liquid, and gas components, but also immiscible mixtures (e.g. oil and water), or anywhere an interface is present. Heterogeneous catalysis typically involves solid phase catalysts and gas phase reactants.

Fraction

A fraction (from fractus, "broken") represents a part of a whole or, more generally, any number of equal parts. When spoken in everyday English, a fraction describes how many parts of a certain size there are, for example, one-half, eight-fifths, three-quarters. A common, vulgar, or simple fraction (examples: and ) consists of an integer numerator, displayed above a line (or before a slash like ), and a non-zero integer denominator, displayed below (or after) that line.

Set (mathematics)

A set is the mathematical model for a collection of different things; a set contains elements or members, which can be mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other sets. The set with no element is the empty set; a set with a single element is a singleton. A set may have a finite number of elements or be an infinite set. Two sets are equal if they have precisely the same elements. Sets are ubiquitous in modern mathematics.

Dissociative identity disorder

Dissociative identity disorder (DID), formerly known as multiple personality disorder, split personality disorder or dissociative personality disorder, is a member of the family of dissociative disorders classified by the DSM-5, DSM-5-TR, ICD-10, ICD-11, and Merck Manual for diagnosis. It remains a controversial diagnosis, despite rigorous study in the scientific literature since 1975. Dissociative identity disorder is characterized by the presence of at least two distinct and relatively enduring personality states.

Fuzzy set

In mathematics, fuzzy sets (a.k.a. uncertain sets) are sets whose elements have degrees of membership. Fuzzy sets were introduced independently by Lotfi A. Zadeh in 1965 as an extension of the classical notion of set. At the same time, defined a more general kind of structure called an L-relation, which he studied in an abstract algebraic context. Fuzzy relations, which are now used throughout fuzzy mathematics and have applications in areas such as linguistics , decision-making , and clustering , are special cases of L-relations when L is the unit interval [0, 1].

Related lectures (714)

Cartesian Product and Induction

Introduces Cartesian product and induction for proofs using integers and sets.

Mapping Functions and Surjections

Explores mapping functions, surjections, injective and surjective functions, and bijective functions.

Advanced Counting & ProbabilitiesCS-101: Advanced information, computation, communication I

Covers advanced counting techniques, probabilities, and their applications in computer science.

Derangements: Permutations and ProbabilitiesCS-101: Advanced information, computation, communication I

Covers advanced counting, probabilities, and information theory, including solving linear homogeneous recurrence relations and hat-check problems.

Probability and Statistics for SICMATH-232: Probability and statistics

Delves into probability, statistics, random experiments, and statistical inference, with practical examples and insights.