enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Sylvester equation - Wikipedia

    en.wikipedia.org/wiki/Sylvester_equation

    In mathematics, in the field of control theory, a Sylvester equation is a matrix equation of the form: [1] A X + X B = C . {\displaystyle AX+XB=C.} It is named after English mathematician James Joseph Sylvester .

  3. Alternating-direction implicit method - Wikipedia

    en.wikipedia.org/wiki/Alternating-direction...

    In numerical linear algebra, the alternating-direction implicit (ADI) method is an iterative method used to solve Sylvester matrix equations.It is a popular method for solving the large matrix equations that arise in systems theory and control, [1] and can be formulated to construct solutions in a memory-efficient, factored form.

  4. Sylvester matrix - Wikipedia

    en.wikipedia.org/wiki/Sylvester_matrix

    The determinant of the Sylvester matrix of two polynomials is their resultant, which is zero when the two polynomials have a common root (in case of coefficients in a field) or a non-constant common divisor (in case of coefficients in an integral domain). Sylvester matrices are named after James Joseph Sylvester.

  5. Sylvester's formula - Wikipedia

    en.wikipedia.org/wiki/Sylvester's_formula

    In matrix theory, Sylvester's formula or Sylvester's matrix theorem (named after J. J. Sylvester) or Lagrange−Sylvester interpolation expresses an analytic function f(A) of a matrix A as a polynomial in A, in terms of the eigenvalues and eigenvectors of A. [1] [2] It states that [3]

  6. Bartels–Stewart algorithm - Wikipedia

    en.wikipedia.org/wiki/Bartels–Stewart_algorithm

    In numerical linear algebra, the Bartels–Stewart algorithm is used to numerically solve the Sylvester matrix equation =.Developed by R.H. Bartels and G.W. Stewart in 1971, [1] it was the first numerically stable method that could be systematically applied to solve such equations.

  7. Hadamard matrix - Wikipedia

    en.wikipedia.org/wiki/Hadamard_matrix

    Let H be a Hadamard matrix of order n.The transpose of H is closely related to its inverse.In fact: = where I n is the n × n identity matrix and H T is the transpose of H.To see that this is true, notice that the rows of H are all orthogonal vectors over the field of real numbers and each have length .

  8. Analytic function of a matrix - Wikipedia

    en.wikipedia.org/wiki/Analytic_function_of_a_matrix

    In mathematics, every analytic function can be used for defining a matrix function that maps square matrices with complex entries to square matrices of the same size.. This is used for defining the exponential of a matrix, which is involved in the closed-form solution of systems of linear differential equations.

  9. Transfer matrix - Wikipedia

    en.wikipedia.org/wiki/Transfer_matrix

    In applied mathematics, the transfer matrix is a formulation in terms of a block-Toeplitz matrix of the two-scale equation, which characterizes refinable functions. Refinable functions play an important role in wavelet theory and finite element theory.