Lecture

Heat Recovery 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.

Description

This lecture covers the analysis of heat recovery systems, focusing on the concept of delta T minimum as a key parameter to optimize the heat exchange process. The instructor explains how to calculate the maximum heat recovery by considering the pinch point, identifying penalizing heat exchangers, and optimizing the heat exchanger network design. The lecture also discusses the trade-off between CAPEX and OPEX, the importance of energy balance consistency, and the principle of 'more in, more out'. Additionally, the application of graph theory to determine the minimum number of connections for heat exchange and the influence of heat transfer coefficients on temperature differences are explored.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Mechanical engineering

Thermal engineering: Air conditioning

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Heat exchanger

A heat exchanger is a system used to transfer heat between a source and a working fluid. Heat exchangers are used in both cooling and heating processes. The fluids may be separated by a solid wall to prevent mixing or they may be in direct contact. They are widely used in space heating, refrigeration, air conditioning, power stations, chemical plants, petrochemical plants, petroleum refineries, natural-gas processing, and sewage treatment.

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Glossary of graph theory

This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.

Connectivity (graph theory)

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.

Path (graph theory)

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.

Related lectures (64)

Heat Exchanger Network Design

Explores the design of heat exchanger networks, optimizing connections and configurations for efficient heat recovery.

Graph Theory: Path Weighted by Amplitude

Covers the calculation of paths in a graph, focusing on amplitude-weighted paths.

Heat Recovery in Process Units

Explores heat recovery, heat exchanger calculation, and pinch analysis for energy optimization.

Heat Recovery Principles

Explores heat recovery principles, energy balance, and identifying penalizing heat exchangers for optimizing energy efficiency and cost savings.