Least squares solutions to AX=B for bisymmetric matrices under a central principal submatrix constraint and the optimal approximation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least-Squares Solutions of the Matrix Equation AXA= B Over Bisymmetric Matrices and its Optimal Approximation

A real n × n symmetric matrix X = (x i j)n×n is called a bisymmetric matrix if x i j = xn+1− j,n+1−i . Based on the projection theorem, the canonical correlation decomposition and the generalized singular value decomposition, a method useful for finding the least-squares solutions of the matrix equation AXA= B over bisymmetric matrices is proposed. The expression of the least-squares solutions ...

متن کامل

Numerical solutions of AXB = C for centrosymmetric matrix X under a specified submatrix constraint

We say that X = [xi j ]n i, j=1 is centrosymmetric if xi j = xn− j+1,n−i+1, 1 i, j n. In this paper, we present an efficient algorithm for minimizing ‖AX B−C‖ where ‖·‖ is the Frobenius norm, A∈Rm×n , B∈ Rn×s , C ∈Rm×s and X ∈Rn×n is centrosymmetric with a specified central submatrix [xi j ]p i, j n−p . Our algorithm produces a suitable X such that AX B=C in finitely many steps, if such an X ex...

متن کامل

The submatrix constraint problem of matrix equation AXB+CYD=E

We say that X = [xij ]i,j=1 is symmetric centrosymmetric if xij = xji and xn−j+1,n−i+1, 1 ≤ i, j ≤ n. In this paper we present an efficient algorithm for minimizing ‖AXB + CY D − E‖ where ‖ · ‖ is the Frobenius norm, A ∈ Rt×n, B ∈ Rn×s, C ∈ Rt×m, D ∈ Rm×s, E ∈ Rt×s and X ∈ Rn×n is symmetric centrosymmetric with a specified central submatrix [xij ]r≤i,j≤n−r, Y ∈ Rm×m is symmetric with a specifie...

متن کامل

An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint

In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

متن کامل

a benchmarking approach to optimal asset allocation for insurers and pension funds

uncertainty in the financial market will be driven by underlying brownian motions, while the assets are assumed to be general stochastic processes adapted to the filtration of the brownian motions. the goal of this study is to calculate the accumulated wealth in order to optimize the expected terminal value using a suitable utility function. this thesis introduced the lim-wong’s benchmark fun...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2008

ISSN: 0024-3795

DOI: 10.1016/j.laa.2007.08.019