@article {15696,
	title = {A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems},
	journal = {SIAM Journal on Scientific and Statistical Computing},
	volume = {2},
	year = {1981},
	month = {1981///},
	pages = {474 - 489},
	abstract = {In this paper, we consider ill-posed problems which discretize to linear least squares problems with matrices $K$ of high dimensions. The algorithm proposed uses $K$ only as an operator and does not need to explicitly store or modify it. A method related to one of Lanczos is used to project the problem onto a subspace for which $K$ is bidiagonal. It is then an easy matter to solve the projected problem by standard regularization techniques. These ideas are illustrated with some integral equations of the first kind with convolution kernels, and sample numerical results are given.},
	keywords = {first kind integral equation, ill-posed problems, Lanczos algorithm, regularization},
	doi = {10.1137/0902037},
	url = {http://link.aip.org/link/?SCE/2/474/1},
	author = {O{\textquoteright}Leary, Dianne P. and Simmons,John A.}
}
