Lecture

Strategies to Break Linear Scaling Relationships in Catalysis

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.

Description

This lecture delves into the strategies employed to break linear scaling relationships in catalysis, focusing on the concept of volcanoes as a systematic way for optimization. The instructor discusses the origins of volcanoes in catalysis, the challenges they present, and the need to go beyond traditional approaches by introducing complexities in catalytic systems. Various methods are explored, such as controlling ensembles, using ligands, and doping, to break the symmetry and enhance catalytic performance. The lecture also covers the use of single atoms, magnetic enhancement, and external forces to modify electronic structures and improve catalytic activity, providing insights into the future of catalysis research.

Official source

Related concepts (32)

Catalysis

Catalysis (kəˈtæləsɪs) is the process of change in rate of a chemical reaction by adding a substance known as a catalyst (ˈkætəlɪst). Catalysts are not consumed by the reaction and remain unchanged after it. If the reaction is rapid and the catalyst recycles quickly, very small amounts of catalyst often suffice; mixing, surface area, and temperature are important factors in reaction rate. Catalysts generally react with one or more reactants to form intermediates that subsequently give the final reaction product, in the process of regenerating the catalyst.

Complexity class

In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are time and memory. In general, a complexity class is defined in terms of a type of computational problem, a model of computation, and a bounded resource like time or memory. In particular, most complexity classes consist of decision problems that are solvable with a Turing machine, and are differentiated by their time or space (memory) requirements.

Computational complexity

In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.

Energy transition

An energy transition (or energy system transformation) is a significant structural change in an energy system regarding supply and consumption. Currently, a transition to sustainable energy (mostly renewable energy) is underway to limit climate change. It is also called renewable energy transition. The current transition is driven by a recognition that global greenhouse-gas emissions must be drastically reduced. This process involves phasing-down fossil fuels and re-developing whole systems to operate on low carbon electricity.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Related lectures (64)

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Coin Rendering: Part 1 MOOC: Information, Computation, Communication: Introduction to computational thinking

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Energy optimization strategies

Covers brainstorming options for smart operation changes, heat recovery, and PV panel performance.

Linear Programming: Optimization and Constraints

Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.

Implementation Research: Concepts and Scope