排序方式: 共有7条查询结果,搜索用时 0 毫秒
1
1.
The field of quaternions, denoted by
\mathbbH{\mathbb{H}} can be represented as an isomorphic four dimensional subspace of
\mathbbR4×4{\mathbb{R}^{4\times 4}}, the space of real matrices with four rows and columns. In addition to the quaternions there is another four dimensional
subspace in
\mathbbR4×4{\mathbb{R}^{4\times 4}} which is also a field and which has – in connection with the quaternions – many pleasant properties. This field is called
field of pseudoquaternions. It exists in
\mathbbR4×4{\mathbb{R}^{4\times 4}} but not in
\mathbbH{\mathbb{H}}. It allows to write the quaternionic linear term axb in matrix form as Mx where x is the same as the quaternion x only written as a column vector in
\mathbbR4{\mathbb{R}^4}. And M is the product of the matrix associated with the quaternion a with the matrix associated with the pseudoquaternion b. 相似文献
2.
Steady-state nonlinear differential equations govering the stem curve of a wind-loaded pine are derived and solved numerically. Comparison is made between the results computed and the data from photographs of a pine stem during strong wind. The pine breaking is solved at the end. 相似文献
3.
4.
We will present the general solution of the algebraic Riccati equation for the quaternionic case, where also one additional variation is treated. For computational purpose a very simple form of the exact Jacobi matrix for Riccati polynomials is presented. There are several examples. 相似文献
5.
Consider a bifurcation problem, namely, its bifurcation equation. There is a diffeomorphism linking the actual solution set with an unfolded normal form of the bifurcation equation. The differential D(0) of this diffeomorphism is a valuable information for a numerical analysis of the imperfect bifurcation.The aim of this paper is to construct algorithms for a computation of D(0). Singularity classes containing bifurcation points with codim 3, corank = 1 are considered. 相似文献
6.
We are concerned with matrices over nondivision algebras and show by an example from an \({\mathbb{R}^{4}}\) algebra that these matrices do not necessarily have eigenvalues, even if these matrices are invertible. The standard condition for eigenvectors \({\rm x \neq 0}\) will be replaced by the condition that x contains at least one invertible component which is the same as \({\rm x \neq 0}\) for division algebras. The topic is of principal interest, and leads to the question what qualifies a matrix over a nondivision algebra to have eigenvalues. And connected with this problem is the question, whether these matrices are diagonalizable or triangulizable and allow a Schur decomposition. There is a last section where the question whether a specific matrix A has eigenvalues is extended to all eight \({\mathbb{R}^{4}}\) algebras by applying numerical means. As a curiosity we found that the considered matrix A over the algebra of tessarines, which is a commutative algebra, introduced by Cockle (Phil Mag 35(3):434–437, 1849; http://www.oocities.org/cocklebio/), possesses eigenvalues. 相似文献
7.
Drahoslava Janovska 《Applications of Mathematics》2002,47(2):101-113
An algorithm for hyperbolic singular value decomposition of a given complex matrix based on hyperbolic Householder and Givens transformation matrices is described in detail. The main application of this algorithm is the decomposition of an updated correlation matrix. 相似文献
1