The nearness problems for symmetric matrix with a submatrix constraint (Q2469623): Difference between revisions
From MaRDI portal
Latest revision as of 16:29, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The nearness problems for symmetric matrix with a submatrix constraint |
scientific article |
Statements
The nearness problems for symmetric matrix with a submatrix constraint (English)
0 references
6 February 2008
0 references
The authors determine the general form of a solution of the problem: given a matrix \(X\in \mathbb R^{n \times p}\) and symmetric matrices \(B\in\mathbb R^{p \times p}\) and \(C\in\mathbb R^{r \times r}\), find an \(n \times n\) symmetric matrix \(A\) such that \(\| X^T A X - B \| = \min\), such that the \(r \times r \) leading principal submatrix of \(A\) is \(C\). They use the above solution set to solve the problem of updating the mass or stiffness matrix in a generalized eigenvalue finite element formulation.
0 references
symmetric matrix
0 references
singular value decomposition
0 references
best approximation
0 references
model updating
0 references
finite element
0 references
0 references