A new iterative algorithm for solving a class of matrix nearness problem (Q408473): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / author | |||
Property / author: Xue-Feng Duan / rank | |||
Property / author | |||
Property / author: Chun-Mei Li / rank | |||
Property / author | |||
Property / author: Xue-Feng Duan / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Chun-Mei Li / rank | |||
Normal rank | |||
Property / review text | |||
Summary: Based on the alternating projection algorithm, which was proposed by Von Neumann to treat the problem of finding the projection of a given point onto the intersection of two closed subspaces, we propose a new iterative algorithm to solve the matrix nearness problem associated with the matrix equations \(AXB = E\), \(CXD = F\), which arises frequently in experimental design. If we choose the initial iterative matrix \(X_0 = 0\), the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective. | |||
Property / review text: Summary: Based on the alternating projection algorithm, which was proposed by Von Neumann to treat the problem of finding the projection of a given point onto the intersection of two closed subspaces, we propose a new iterative algorithm to solve the matrix nearness problem associated with the matrix equations \(AXB = E\), \(CXD = F\), which arises frequently in experimental design. If we choose the initial iterative matrix \(X_0 = 0\), the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 15A24 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6022647 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
alternating projection algorithm | |||
Property / zbMATH Keywords: alternating projection algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
matrix nearness problem | |||
Property / zbMATH Keywords: matrix nearness problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
matrix equations | |||
Property / zbMATH Keywords: matrix equations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
experimental design | |||
Property / zbMATH Keywords: experimental design / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
least Frobenius norm solution | |||
Property / zbMATH Keywords: least Frobenius norm solution / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
numerical examples | |||
Property / zbMATH Keywords: numerical examples / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58689788 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.5402/2012/126908 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2010228744 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dykstra's alternating projection algorithm for two sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Best approximation in inner product spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4730687 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear matrix equations from an inverse problem of vibration theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The matrix nearness problem for symmetric matrices associated with the matrix equation \([A^{T}XA, B^{T}XB] = [C, D]\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: LSQR iterative common symmetric solutions to matrix equations \(AXB = E\) and \(CXD = F\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative algorithm for solving a pair of matrix equations \(AYB=E\), \(CYD=F\) over generalized centro-symmetric matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The generalized reflexive solution for a class of matrix equations \( (AX=B, XC=D)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for the least-squares reflexive solution of the matrix equation \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A finite iterative method for solving a pair of linear matrix equations \((AXB,CXD)=(E,F)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The matrix nearness problem associated with the quaternion matrix equation \(AXA^H+BYB^H=C\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A system of matrix equations and a linear matrix equation over arbitrary regular rings with identity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A representation of the general common solution to the matrix equations \(A_1XB_1=C_1\) and \(A_2XB_2=C_2\) with applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative solutions to matrix equations of the form \(A_{i}XB_{i}=F_{i}\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5518786 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Algorithm for Restricted Least Squares Regression / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dykstra's Algorithm for a Constrained Least-squares Matrix Problem / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:06, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new iterative algorithm for solving a class of matrix nearness problem |
scientific article |
Statements
A new iterative algorithm for solving a class of matrix nearness problem (English)
0 references
10 April 2012
0 references
Summary: Based on the alternating projection algorithm, which was proposed by Von Neumann to treat the problem of finding the projection of a given point onto the intersection of two closed subspaces, we propose a new iterative algorithm to solve the matrix nearness problem associated with the matrix equations \(AXB = E\), \(CXD = F\), which arises frequently in experimental design. If we choose the initial iterative matrix \(X_0 = 0\), the least Frobenius norm solution of these matrix equations is obtained. Numerical examples show that the new algorithm is feasible and effective.
0 references
alternating projection algorithm
0 references
matrix nearness problem
0 references
matrix equations
0 references
experimental design
0 references
least Frobenius norm solution
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references