|
H-infinity Methods In Control Theory
''H''∞ (i.e. "''H''-infinity") methods are used in control theory to synthesize controllers to achieve stabilization with guaranteed performance. To use ''H''∞ methods, a control designer expresses the control problem as a mathematical optimization problem and then finds the controller that solves this optimization. ''H''∞ techniques have the advantage over classical control techniques in that ''H''∞ techniques are readily applicable to problems involving multivariate systems with cross-coupling between channels; disadvantages of ''H''∞ techniques include the level of mathematical understanding needed to apply them successfully and the need for a reasonably good model of the system to be controlled. It is important to keep in mind that the resulting controller is only optimal with respect to the prescribed cost function and does not necessarily represent the best controller in terms of the usual performance measures used to evaluate controllers such as settling time, ener ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Control Theory
Control theory is a field of mathematics that deals with the control of dynamical systems in engineered processes and machines. The objective is to develop a model or algorithm governing the application of system inputs to drive the system to a desired state, while minimizing any ''delay'', ''overshoot'', or ''steady-state error'' and ensuring a level of control stability; often with the aim to achieve a degree of optimality. To do this, a controller with the requisite corrective behavior is required. This controller monitors the controlled process variable (PV), and compares it with the reference or set point (SP). The difference between actual and desired value of the process variable, called the ''error'' signal, or SP-PV error, is applied as feedback to generate a control action to bring the controlled process variable to the same value as the set point. Other aspects which are also studied are controllability and observability. Control theory is used in control system eng ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Fractional Transformation
In mathematics, a linear fractional transformation is, roughly speaking, a transformation of the form :z \mapsto \frac , which has an inverse. The precise definition depends on the nature of , and . In other words, a linear fractional transformation is a ''transformation'' that is represented by a ''fraction'' whose numerator and denominator are ''linear''. In the most basic setting, , and are complex numbers (in which case the transformation is also called a Möbius transformation), or more generally elements of a field. The invertibility condition is then . Over a field, a linear fractional transformation is the restriction to the field of a projective transformation or homography of the projective line. When are integer (or, more generally, belong to an integral domain), is supposed to be a rational number (or to belong to the field of fractions of the integral domain. In this case, the invertibility condition is that must be a unit of the domain (that is or in the c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Proceedings Of The Royal Society A
''Proceedings of the Royal Society'' is the main research journal of the Royal Society. The journal began in 1831 and was split into two series in 1905: * Series A: for papers in physical sciences and mathematics. * Series B: for papers in life sciences. Many landmark scientific discoveries are published in the Proceedings, making it one of the most historically significant science journals. The journal contains several articles written by the most celebrated names in science, such as Paul Dirac, Werner Heisenberg, Ernest Rutherford, Erwin Schrödinger, William Lawrence Bragg, Lord Kelvin, J.J. Thomson, James Clerk Maxwell, Dorothy Hodgkin and Stephen Hawking. In 2004, the Royal Society began ''The Journal of the Royal Society Interface'' for papers at the interface of physical sciences and life sciences. History The journal began in 1831 as a compilation of abstracts of papers in the ''Philosophical Transactions of the Royal Society'', the older Royal Society publication, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rosenbrock System Matrix
In applied mathematics, the Rosenbrock system matrix or Rosenbrock's system matrix of a linear time-invariant system is a useful representation bridging state-space representation and transfer function matrix form. It was proposed in 1967 by Howard H. Rosenbrock. Definition Consider the dynamic system :: \dot= Ax +Bu, :: y= Cx +Du. The Rosenbrock system matrix is given by ::P(s)=\begin sI-A & -B\\ C & D \end. In the original work by Rosenbrock, the constant matrix D is allowed to be a polynomial in s. The transfer function between the input i and output j is given by ::g_=\frac where b_i is the column i of B and c_j is the row j of C. Based in this representation, Rosenbrock developed his version of the PHB test. Short form For computational purposes, a short form of the Rosenbrock system matrix is more appropriate and given by ::P\sim\begin A & B\\ C & D \end. The short form of the Rosenbrock system matrix has been widely used in H-infinity methods in control theory, wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
H Square
In mathematics and control theory, ''H''2, or ''H-square'' is a Hardy space with square norm. It is a subspace of ''L''2 space, and is thus a Hilbert space. In particular, it is a reproducing kernel Hilbert space. On the unit circle In general, elements of ''L''2 on the unit circle are given by :\sum_^\infty a_n e^ whereas elements of ''H''2 are given by :\sum_^\infty a_n e^. The projection from ''L''2 to ''H''2 (by setting ''a''''n'' = 0 when ''n'' < 0) is orthogonal. On the half-plane The given by : can be understood as a linear operator : where ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Matrix Inequality
In convex optimization, a linear matrix inequality (LMI) is an expression of the form : \operatorname(y):=A_0+y_1A_1+y_2A_2+\cdots+y_m A_m\succeq 0\, where * y= _i\,,~i\!=\!1,\dots, m/math> is a real vector, * A_0, A_1, A_2,\dots,A_m are n\times n symmetric matrices \mathbb^n, * B\succeq0 is a generalized inequality meaning B is a positive semidefinite matrix belonging to the positive semidefinite cone \mathbb_+ in the subspace of symmetric matrices \mathbb{S}. This linear matrix inequality specifies a convex constraint on ''y''. Applications There are efficient numerical methods to determine whether an LMI is feasible (''e.g.'', whether there exists a vector ''y'' such that LMI(''y'') ≥ 0), or to solve a convex optimization problem with LMI constraints. Many optimization problems in control theory, system identification and signal processing can be formulated using LMIs. Also LMIs find application in Polynomial Sum-Of-Squares. The prototypical primal and dual ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riccati Equation
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 order linear ordinary differential equation (ODE): If :y'=q_0(x) + q_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Singular Value
In mathematics, in particular functional analysis, the singular values, or ''s''-numbers of a compact operator T: X \rightarrow Y acting between Hilbert spaces X and Y, are the square roots of the (necessarily non-negative) eigenvalues of the self-adjoint operator T^*T (where T^* denotes the adjoint of T). The singular values are non-negative real numbers, usually listed in decreasing order (''σ''1(''T''), ''σ''2(''T''), …). The largest singular value ''σ''1(''T'') is equal to the operator norm of ''T'' (see Min-max theorem). If ''T'' acts on Euclidean space \Reals ^n, there is a simple geometric interpretation for the singular values: Consider the image by T of the unit sphere; this is an ellipsoid, and the lengths of its semi-axes are the singular values of T (the figure provides an example in \Reals^2). The singular values are the absolute values of the eigenvalues of a normal matrix ''A'', because the spectral theorem can be applied to obtain unitary diagonalization of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transfer Function Matrix
In control system theory, and various branches of engineering, a transfer function matrix, or just transfer matrix is a generalisation of the transfer functions of single-input single-output (SISO) systems to multiple-input and multiple-output (MIMO) systems. The matrix relates the outputs of the system to its inputs. It is a particularly useful construction for linear time-invariant (LTI) systems because it can be expressed in terms of the s-plane. In some systems, especially ones consisting entirely of passive components, it can be ambiguous which variables are inputs and which are outputs. In electrical engineering, a common scheme is to gather all the voltage variables on one side and all the current variables on the other regardless of which are inputs or outputs. This results in all the elements of the transfer matrix being in units of impedance. The concept of impedance (and hence impedance matrices) has been borrowed into other energy domains by analogy, especially m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector (geometry)
In mathematics, physics, and engineering, a Euclidean vector or simply a vector (sometimes called a geometric vector or spatial vector) is a geometric object that has magnitude (or length) and direction. Vectors can be added to other vectors according to vector algebra. A Euclidean vector is frequently represented by a '' directed line segment'', or graphically as an arrow connecting an ''initial point'' ''A'' with a ''terminal point'' ''B'', and denoted by \overrightarrow . A vector is what is needed to "carry" the point ''A'' to the point ''B''; the Latin word ''vector'' means "carrier". It was first used by 18th century astronomers investigating planetary revolution around the Sun. The magnitude of the vector is the distance between the two points, and the direction refers to the direction of displacement from ''A'' to ''B''. Many algebraic operations on real numbers such as addition, subtraction, multiplication, and negation have close analogues for vectors, operations whic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
