**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.

Concept# Riccati equation

Summary

In mathematics, a Riccati equation in the narrowest sense is any first-order ordinary differential equation that is quadratic in the unknown function. In other words, it is an equation of the form
: y'(x) = q_0(x) + q_1(x) , y(x) + q_2(x) , y^2(x)
where q_0(x) \neq 0 and q_2(x) \neq 0. If q_0(x) = 0 the equation reduces to a Bernoulli equation, while if q_2(x) = 0 the equation becomes a first order linear ordinary differential equation.
The equation is named after Jacopo Riccati (1676–1754).
More generally, the term Riccati equation is used to refer to matrix equations with an analogous quadratic term, which occur in both continuous-time and discrete-time linear-quadratic-Gaussian control. The steady-state (non-dynamic) version of these is referred to as the algebraic Riccati equation.
Conversion to a second order linear equation
The non-linear Riccati equation can always be converted to a second ord

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.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related courses (7)

Related publications (2)

MGT-484: Applied probability & stochastic processes

This course focuses on dynamic models of random phenomena, and in particular, the most popular classes of such models: Markov chains and Markov decision processes. We will also study applications in queuing theory, finance, project management, etc.

ME-326: Control systems and discrete-time control

Ce cours inclut la modélisation et l'analyse de systèmes dynamiques, l'introduction des principes de base et l'analyse de systèmes en rétroaction, la synthèse de régulateurs dans le domain fréquentiel et dans l'espace d'état, et la commande de systèmes discrets avec une approche polynomiale.

ME-422: Multivariable control

This course covers methods for the analysis and control of systems with multiple inputs and outputs, which are ubiquitous in modern technology and industry. Special emphasis will be given to discrete-time systems, due to their relevance for digital and embedded control architectures.

Related units

No results

Loading

Loading

Related lectures (11)

Related people

No results

Related concepts (2)

Optimal control

Optimal control theory is a branch of mathematical optimization that deals with finding a control for a dynamical system over a period of time such that an objective function is optimized. It has nu

Linear–quadratic–Gaussian control

In control theory, the linear–quadratic–Gaussian (LQG) control problem is one of the most fundamental optimal control problems, and it can also be operated repeatedly for model predictive control. It

Mihael Erakovic, Christophe Louis Joseph Jean-Luc Vaillant

We derive a multidimensional instanton theory for calculating ground-state tunneling splittings in Cartesian coordinates for general paths. It is an extension of the method by Mil'nikov and Nakamura [J. Chem. Phys. 115, 6881 (2001)] to include asymmetric paths that are necessary for calculating tunneling splitting patterns in multi-well systems, such as water clusters. The approach avoids multiple expensive matrix diagonalizations to converge the fluctuation prefactor in the ring-polymer instanton (RPI) method, and instead replaces them by an integration of a Riccati differential equation. When combined with the string method for locating instantons, we avoid the need to converge the calculation with respect to the imaginary time period of the semiclassical orbit, thereby reducing the number of convergence parameters of the optimized object to just one: the number of equally spaced system replicas used to represent the instanton path. The entirety of the numerical effort is thus concentrated in optimizing the shape of the path and evaluating hessians along the path, which is a dramatic improvement over RPI. In addition to the standard instanton approximations, we neglect the coupling of vibrational modes to external rotations. The method is tested on the model potential of malonaldehyde and on the water dimer and trimer, giving close agreement with RPI at a much-reduced cost. Published under license by AIP Publishing.

2020Magnetic resonance imaging (MRI) scanners produce raw measurements that are unfit to direct interpretation, unless an algorithmic step, called reconstruction, is introduced. Up to the last decade, this reconstruction was performed by algorithms of moderate complexity. This worked because substantial efforts were devoted to adjust the MRI hardware to suit the algorithmic component. More recently, new techniques have reversed this trend by putting more emphasis on the algorithms and alleviating the constraints on the hardware. Whereas many new methods suffer from a marked increase in computational complexity, this thesis focuses on the development of reconstruction algorithms that are faster and simpler than state-of-the-art solutions, while preserving their quality. First, we present the physical principles that underlie the acquisition of MRI data and motivate the classical linear model. Based on this continuous equation, we derive efficient implementations of a discrete model. Standard and state-of-the-art reconstruction algorithms are reviewed and presented in a general framework where reconstruction is regarded as an optimization problem that can naturally integrate regularization. Next, we propose novel simulation tools for the validation of reconstruction methods. Those tools model the sensitivity of the receiving coil, which allows for the simulation of parallel MRI experiments. To honor the continuous nature of the underlying physics, we suggest the use of analytical phantoms. Unlike rasterized simulations, our phantoms do not introduce aliasing artifacts. Instead, they allow us to study how rasterization itself impacts the quality of reconstruction. To achieve this goal, we were able to work out closed-form solutions for the Fourier transform of parametric regions that can realistically reproduce anatomical features. Our results show that the inverse-crime situation impairs significantly the assessment of the performance of reconstruction methods, particularly, the non-linear ones. Finally, we investigate the design of algorithms that achieve reconstruction with a sparsity constraint expressed in a wavelet domain. Based on the latest developments in large-scale convex optimization, we derive an acceleration strategy that can be tailored to the MRI setup and provide theoretical evidence of its benefit. We develop it into a practical method that combines the advantages of speed and quality. Applied on challenging reconstruction problems, with simulated and in-vivo data, we significantly reduce the reconstruction time over state-of-the-art techniques without compromising quality.