• 検索結果がありません。

ETNAKent State University [email protected]

N/A
N/A
Protected

Academic year: 2022

シェア "ETNAKent State University [email protected]"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

Electronic Transactions on Numerical Analysis.

Volume 28, pp. 149-167, 2008.

Copyright2008, Kent State University.

ISSN 1068-9613.

ETNA

Kent State University [email protected]

A WEIGHTED-GCV METHOD FOR LANCZOS-HYBRID REGULARIZATION

JULIANNE CHUNGy, JAMES G. NAGYy,ANDDIANNE P. O’LEARYz

In memory of Gene Golub

Abstract. Lanczos-hybrid regularization methods have been proposed as effective approaches for solving large- scale ill-posed inverse problems. Lanczos methods restrict the solution to lie in a Krylov subspace, but they are hindered by semi-convergence behavior, in that the quality of the solution first increases and then decreases. Hybrid methods apply a standard regularization technique, such as Tikhonov regularization, to the projected problem at each iteration. Thus, regularization in hybrid methods is achieved both by Krylov filtering and by appropriate choice of a regularization parameter at each iteration. In this paper we describe a weighted generalized cross validation (W- GCV) method for choosing the parameter. Using this method we demonstrate that the semi-convergence behavior of the Lanczos method can be overcome, making the solution less sensitive to the number of iterations.

Key words. generalized cross validation, ill-posed problems, iterative methods, Lanczos bidiagonalization, LSQR, regularization, Tikhonov

AMS subject classifications. 65F20, 65F30

Received March 7, 2007. Accepted for publication September 12, 2007. Recommended by L. Reichel. The work of the first author was supported in part by a DOE Computational Sciences Graduate Research Fellowship.

The work of the second author was supported in part by NSF grant DMS-05-11454 and by an Emory University Research Committee grant. The work of the third author was supported in part by NSF Grant CCF 0514213.

yDepartment of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA (fjmchung,nagyg@mathcs.emory.edug).

zDepartment of Computer Science and Institute for Advanced Computer Studies, University of Maryland, Col- lege Park, MD 20742, USA; and National Institute for Standards and Technology, Gaithersburg, MD 20899, USA ([email protected]).

149

参照

関連したドキュメント

In particular, in the one-class model, we prove that a paper which receives a new citation has an increase of its rank which is larger than the increase received by the other

The models rely on certain adjacency matrices obtained from the relationships between citations, authors and publications, which together give a suitable irreducible stochastic

Examples are presented for: general dense ma- trices, upper triangular matrices, higher order generator semiseparable matrices, quasiseparable matrices, Givens- vector

The resulting variational problem is proved to be well posed and error estimates are settled for a numerical method based on standard nodal finite elements..

SOLVING REGULARIZED LINEAR LEAST-SQUARES PROBLEMS BY THE ALTERNATING DIRECTION METHOD WITH APPLICATIONS TO IMAGE..

It is based on a Petrov-Galerkin process and multistep schemes and consists of building, throughout the iterations, an approximation subspace using the previous computations, where

We then introduced the convection-diffusion control problem and illustrated that, with a suitable stabilization technique (the Local Projection Stabilization), the same saddle

We have seen that under rather natural source condi- tions error estimates in Bregman distances can be extended from the well-known quadratic fitting (Gaussian noise) case to