Affine mappings on simplices (Q2878908)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Affine mappings on simplices |
scientific article; zbMATH DE number 6340603
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Affine mappings on simplices |
scientific article; zbMATH DE number 6340603 |
Statements
5 September 2014
0 references
affine mapping
0 references
simplex
0 references
singular value decomposition
0 references
orthogonal matrix
0 references
Affine mappings on simplices (English)
0 references
The paper deals with affine mappings on domains in \(\mathbb{R}^3\) that are unions of simplices.NEWLINENEWLINELet \(Q\) be a domain in \(\mathbb{R}^3\) that is a union of simplices \(Q_i\) whose interiors are disjoint. Consider an affine mapping on each simplex \(Q_i\) of the form \(f_i(x)=A_ix\), where \(A_i\) is a \(3 \times 3\) transformation matrix. The authors study the conditions that these matrices must satisfy in order to obtain a continuous piecewise affine mapping \(f\) on the domain \(Q\) such that \(f\mid Q_i=f_i\).NEWLINENEWLINEBy the singular value decomposition theorem, each \(A_i\) can be written as \(U_iD_iV_i^T\), where \(U_i\) and \(V_i\) are orthogonal matrices and \(D_i\) is a diagonal matrix. Taking into account that \(A_i^TA_i=V_iD_i^2V_i^T\) is independent from \(U_i\), for obtaining necessary and sufficient conditions for \(A_i\) so that \(f\) is continuous, the authors analyze the conditions for \(D_i\) and \(V_i\) that affirm the existence of \(U_i\) such that matrix \(A_i\) satisfies the desired property.NEWLINENEWLINEFirstly, the simplest case when the domain \(Q\) is a union of two simplices sharing a common face is studied. After that, the authors analyze the case of a domain that is a union of four simplices sharing a common edge. Finally, a result for a domain that is a union of three simplices is presented.
0 references
0.7334768772125244
0 references
0.6883904933929443
0 references
0.6486266851425171
0 references
0.6486266851425171
0 references