Lecture

Resolution Sequence: Defining a Procedure

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 systematic procedure for solving flow sheets, including defining a resolution sequence, identifying loops, tearing the loops, and iterating until convergence. It also explains the order of resolution sequence and the Mottard Algorithm for stream calculations.

Official source

Related concepts (32)

Fixed-point iteration

In numerical analysis, fixed-point iteration is a method of computing fixed points of a function. More specifically, given a function defined on the real numbers with real values and given a point in the domain of , the fixed-point iteration is which gives rise to the sequence of iterated function applications which is hoped to converge to a point . If is continuous, then one can prove that the obtained is a fixed point of , i.e., More generally, the function can be defined on any metric space with values in that same space.

Iterated function

In mathematics, an iterated function is a function X → X (that is, a function from some set X to itself) which is obtained by composing another function f : X → X with itself a certain number of times. The process of repeatedly applying the same function is called iteration. In this process, starting from some initial object, the result of applying a given function is fed again in the function as input, and this process is repeated. For example on the image on the right: with the circle‐shaped symbol of function composition.

Thermodynamic databases for pure substances

Thermodynamic databases contain information about thermodynamic properties for substances, the most important being enthalpy, entropy, and Gibbs free energy. Numerical values of these thermodynamic properties are collected as tables or are calculated from thermodynamic datafiles. Data is expressed as temperature-dependent values for one mole of substance at the standard pressure of 101.325 kPa (1 atm), or 100 kPa (1 bar). Both of these definitions for the standard condition for pressure are in use.

Thermodynamics

Thermodynamics is a branch of physics that deals with heat, work, and temperature, and their relation to energy, entropy, and the physical properties of matter and radiation. The behavior of these quantities is governed by the four laws of thermodynamics which convey a quantitative description using measurable macroscopic physical quantities, but may be explained in terms of microscopic constituents by statistical mechanics.

Equation solving

In mathematics, to solve an equation is to find its solutions, which are the values (numbers, functions, sets, etc.) that fulfill the condition stated by the equation, consisting generally of two expressions related by an equals sign. When seeking a solution, one or more variables are designated as unknowns. A solution is an assignment of values to the unknown variables that makes the equality in the equation true. In other words, a solution is a value or a collection of values (one for each unknown) such that, when substituted for the unknowns, the equation becomes an equality.

Related lectures (64)

Higher Order Methods: Iterative Techniques

Covers higher order methods for solving equations iteratively, including fixed point methods and Newton's method.

Nonlinear Equations: Fixed Point Method Convergence

Covers the convergence of fixed point methods for nonlinear equations, including global and local convergence theorems and the order of convergence.

Descent methods and line search: Finiteness of the line search algorithm MOOC: Optimization: principles and algorithms - Unconstrained nonlinear optimization

Explores the Wolfe conditions for line search algorithms and proves the finiteness of the line search parameter.

Solving Equations: Newton's Method MOOC: Optimization: principles and algorithms - Unconstrained nonlinear optimization

Covers Newton's method conditions and convergence, extension to multiple variables, and linear models.

Limits of Recursive Sequences