𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel solution of certain Toeplitz least-squares problems

✍ Scribed by A. Bojańczyk; R.P. Brent

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
691 KB
Volume
77
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Generalization of Strang's Preconditione
Generalization of Strang's Preconditioner with Applications to Toeplitz Least Squares Problems
✍ Raymond H. Chan; Michael K. Ng; Robert J. Plemmons 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 969 KB

In this paper, we propose a method to generalize Strang's circulant preconditioner for arbitrary n-by-n matrices A,,. The 181th column of our circulant preconditioner S,, is equal to the 151 th column of the given matrix A,,. Thus if A,, is a square Toeplitz matrix, then S,, is just the Strang circu

Solution of large-scale weighted least-s
Solution of large-scale weighted least-squares problems
✍ Venansius Baryamureeba 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 467 KB

## Abstract A sequence of least‐squares problems of the form min~__y__~∥__G__^1/2^(__A__^T^ __y__−__h__)∥~2~, where __G__ is an __n__×__n__ positive‐definite diagonal weight matrix, and __A__ an __m__×__n__ (__m__⩽__n__) sparse matrix with some dense columns; has many applications in linear program

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