Structured decompositions for matrix triples: SVD-like concepts for structured matrices

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

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

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

منابع مشابه

Structured decompositions for matrix triples: SVD-like concepts for structured matrices

Canonical forms for matrix triples (A,G, Ĝ), where A is arbitrary rectangular andG, Ĝare either real symmetric or skew symmetric, or complex Hermitian or skew Hermitian, arederived. These forms generalize classical singular value decompositions. In [1] a similarcanonical form has been obtained for the complex case. In this paper, we provide analternative proof for the comple...

متن کامل

Approximate iterations for structured matrices

Important matrix-valued functions f(A) are, e.g., the inverse A−1, the square root √ A, the sign function and the exponent. Their evaluation for large matrices arising from pdes is not an easy task and needs techniques exploiting appropriate structures of the matrices A and f(A) (often f(A) possesses this structure only approximately). However, intermediate matrices arising during the evaluatio...

متن کامل

Structured Matrices

The expression structured matrices appeared for the first time in a conference title in 1995, specifically in the session “Algorithms for Structured Matrices”, organized within the SPIE conference, held in San Diego (USA) [1, Session 6] and in the “Minisymposium on Structured Matrices” within the ILAS conference, held in Atlanta (USA) [2]. These first experiences led to the organization, in 199...

متن کامل

Matrix Completion for Structured Observations

The need to predict or fill-in missing data, often referred to as matrix completion, is a common challenge in today’s data-driven world. Previous strategies typically assume that no structural difference between observed and missing entries exists. Unfortunately, this assumption is woefully unrealistic in many applications. For example, in the classic Netflix challenge, in which one hopes to pr...

متن کامل

Minimization problems for certain structured matrices

For given Z,B ∈ C, the problem of finding A ∈ C, in some prescribed class W , that minimizes ‖AZ − B‖ (Frobenius norm) has been considered by different authors for distinct classes W . Here, this minimization problem is studied for two other classes, which include the symmetric Hamiltonian, symmetric skew-Hamiltonian, real orthogonal symplectic and unitary conjugate symplectic matrices. The pro...

متن کامل

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


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

ژورنال

عنوان ژورنال: Operators and Matrices

سال: 2009

ISSN: 1846-3886

DOI: 10.7153/oam-03-19