Results 271 to 280 of about 419,229 (311)

On Matrix Equations of Twinning in Crystals

Mathematics and Mechanics of Solids, 2000
The algebraic equation of twinning involves a unimodular matrix, a general nonsingular matrix, a rotation, and two vectors. This paper generalizes the investigations of Ericksen, Pitteri, Zanzotto, and Gurtin by listing for each given unimodular matrix all the solutions of the twinning equation; that is, listing all the possibilities of the other ...
openaire   +2 more sources

A Note on Matrix Refinement Equations

SIAM Journal on Mathematical Analysis, 1998
Multiwavelets are wavelets constructed from a refinable function vector \(\Phi:\mathbb{R}^d\to \mathbb{C}^m\) satisfying a matrix refinement equation of the form \(\Phi = \sum_{\alpha\in\mathbb{Z}^d} a(\alpha) \Phi (M^T. -\alpha)\), where \(a(\alpha)\) is an \(m\times m\) matrix and \(M \in \mathbb{Z}^{d\times d}\).
openaire   +2 more sources

Solving Matrix Polynomial Equations

Cybernetics and Systems Analysis
Matrix equations and systems of matrix equations are widely used in problems of optimization of control systems, in mathematical economics. However, methods for solving them are developed only for the most popular matrix equations – the Riccati and Lyapunov equations, and there is no universal approach to solving problems of this class.
openaire   +1 more source

Characteristic equation of a matrix

ACM SIGPLAN Notices, 1970
openaire   +1 more source

Cauchy matrix approach to the SU(2) self‐dual Yang–Mills equation

Studies in Applied Mathematics, 2022
Shangshuai Li, Changzheng Qu, Da-Jun Zhang   +2 more
exaly  

On the matrix equation

Applied Mathematics and Computation, 2006
Mohamed A. Ramadan, Naglaa M. El-Shazly
openaire   +1 more source

Matrix Differential Equations

American Journal of Mathematics, 1934
openaire   +2 more sources

Symmetric matrix polynomial equations

Kybernetika, 1986
The following matrix polynomial equation is studied (1) \(A^*X+X^*A=2B\), where A,B,X are real \(n\times n\) matrix polynomials, and \(A^*(s)=A(-s)\). Here A and B are given and X is unknown. It is assumed that A is stable, i.e. det A has no zeros in the closed right half-plane, and that \(XA^{-1}\) is proper.
openaire   +2 more sources

Efficient iterative method for solving the second-order Sylvester matrix equation EVF 2 − AVF − CV = BW

IET Control Theory and Applications, 2009
Mehdi Dehghan, Masoud Hajarian
exaly  

The density matrix equations

2002
openaire   +1 more source