𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solution of a complex least squares problem with constrained phase

✍ Scribed by Mark Bydder

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
105 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

The least squares solution of a complex linear equation is in general a complex vector with independent real and imaginary parts. In certain applications in magnetic resonance imaging, a solution is desired such that each element has the same phase. A direct method for obtaining the least squares solution to the phase constrained problem is described.

πŸ“œ SIMILAR VOLUMES

Solutions of symmetry-constrained least-
Solutions of symmetry-constrained least-squares problems
✍ Zhen-Yun Peng πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract In this paper, two new matrix‐form iterative methods are presented to solve the least‐squares problem: and matrix nearness problem: where matrices $A\in R^{p\times n\_1},B\in R^{n\_2\times q},C\in R^{p\times m\_1},D\in R^{m\_2\times q},E\in R^{p\times q},\widetilde{X}\in R^{n\_1\time

A new technique of quaternion equality c
A new technique of quaternion equality constrained least squares problem
✍ Tongsong Jiang; Jianli Zhao; Musheng Wei πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 130 KB

By means of complex representation of a quaternion matrix, we study the relationship between the solutions of the quaternion equality constrained least squares problem and that of complex equality constrained least squares problem, and obtain a new technique of finding a solution of the quaternion e

A parallel multisplitting solution of th
A parallel multisplitting solution of the least squares problem
✍ R. A. Renaut πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 143 KB πŸ‘ 2 views

The linear least squares problem, min x Ax-b 2 , is solved by applying a multisplitting(MS) strategy in which the system matrix is decomposed by columns into p blocks. The b and x vectors are partitioned consistently with the matrix decomposition. The global least squares problem is then replaced by