Smoothing and Regularization with Modified Sparse Approximate Inverses
Sparse approximate inverses 𝑀 which satisfy min𝑀‖𝐴𝑀−𝐼‖𝐹 have shown to be an attractive alternative to classical smoothers like Jacobi or Gauss-Seidel (Tang and Wan; 2000). The static and dynamic computation of a SAI and a SPAI (Grote and Huckle; 1997), respectively, comes along with advantages lik...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2010-01-01
|
| Series: | Journal of Electrical and Computer Engineering |
| Online Access: | http://dx.doi.org/10.1155/2010/930218 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547569333436416 |
|---|---|
| author | T. Huckle M. Sedlacek |
| author_facet | T. Huckle M. Sedlacek |
| author_sort | T. Huckle |
| collection | DOAJ |
| description | Sparse approximate inverses 𝑀 which satisfy min𝑀‖𝐴𝑀−𝐼‖𝐹
have shown to be an attractive alternative to classical
smoothers like Jacobi or Gauss-Seidel (Tang and Wan; 2000).
The static and dynamic computation of a SAI and a SPAI
(Grote and Huckle; 1997), respectively, comes along with advantages like
inherent parallelism and robustness with equal smoothing
properties (Bröker et al.; 2001). Here, we are interested in
developing preconditioners that can incorporate probing conditions
for improving the approximation relative to high- or low-frequency
subspaces. We present analytically derived optimal smoothers for
the discretization of the constant-coefficient Laplace operator.
On this basis, we introduce probing conditions in the
generalized Modified SPAI (MSPAI) approach (Huckle and Kallischko; 2007)
which yields efficient smoothers for multigrid. In the second
part, we transfer our approach to the domain of ill-posed problems to
recover original information from blurred signals. Using the probing
facility of MSPAI, we impose the preconditioner to act as
approximately zero on the noise subspace. In combination with an
iterative regularization method, it thus becomes possible to
reconstruct the original information more accurately in many cases.
A variety of numerical results demonstrate the usefulness of this approach. |
| format | Article |
| id | doaj-art-53ceb2d6e3654cb7a877441875ecc184 |
| institution | Kabale University |
| issn | 2090-0147 2090-0155 |
| language | English |
| publishDate | 2010-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Electrical and Computer Engineering |
| spelling | doaj-art-53ceb2d6e3654cb7a877441875ecc1842025-02-03T06:44:01ZengWileyJournal of Electrical and Computer Engineering2090-01472090-01552010-01-01201010.1155/2010/930218930218Smoothing and Regularization with Modified Sparse Approximate InversesT. Huckle0M. Sedlacek1Technische Universität München, Boltzmannstraße 3, 80748 Garching, GermanyTechnische Universität München, Boltzmannstraße 3, 80748 Garching, GermanySparse approximate inverses 𝑀 which satisfy min𝑀‖𝐴𝑀−𝐼‖𝐹 have shown to be an attractive alternative to classical smoothers like Jacobi or Gauss-Seidel (Tang and Wan; 2000). The static and dynamic computation of a SAI and a SPAI (Grote and Huckle; 1997), respectively, comes along with advantages like inherent parallelism and robustness with equal smoothing properties (Bröker et al.; 2001). Here, we are interested in developing preconditioners that can incorporate probing conditions for improving the approximation relative to high- or low-frequency subspaces. We present analytically derived optimal smoothers for the discretization of the constant-coefficient Laplace operator. On this basis, we introduce probing conditions in the generalized Modified SPAI (MSPAI) approach (Huckle and Kallischko; 2007) which yields efficient smoothers for multigrid. In the second part, we transfer our approach to the domain of ill-posed problems to recover original information from blurred signals. Using the probing facility of MSPAI, we impose the preconditioner to act as approximately zero on the noise subspace. In combination with an iterative regularization method, it thus becomes possible to reconstruct the original information more accurately in many cases. A variety of numerical results demonstrate the usefulness of this approach.http://dx.doi.org/10.1155/2010/930218 |
| spellingShingle | T. Huckle M. Sedlacek Smoothing and Regularization with Modified Sparse Approximate Inverses Journal of Electrical and Computer Engineering |
| title | Smoothing and Regularization with Modified Sparse Approximate Inverses |
| title_full | Smoothing and Regularization with Modified Sparse Approximate Inverses |
| title_fullStr | Smoothing and Regularization with Modified Sparse Approximate Inverses |
| title_full_unstemmed | Smoothing and Regularization with Modified Sparse Approximate Inverses |
| title_short | Smoothing and Regularization with Modified Sparse Approximate Inverses |
| title_sort | smoothing and regularization with modified sparse approximate inverses |
| url | http://dx.doi.org/10.1155/2010/930218 |
| work_keys_str_mv | AT thuckle smoothingandregularizationwithmodifiedsparseapproximateinverses AT msedlacek smoothingandregularizationwithmodifiedsparseapproximateinverses |