Abstract
We consider large-scale linear inverse problems with a simulation-based algorithm that approximates the solution within a low-dimensional subspace. The algorithm uses Tikhonov regularization, regression, and low-dimensional linear algebra calculations and storage. For sampling efficiency, we implement importance sampling schemes, specially tailored to the structure of inverse problems. We emphasize various alternative methods for approximating the optimal sampling distribution and we demonstrate their impact on the reduction of simulation noise. The performance of our algorithm is tested on a practical inverse problem arising from Fredholm integral equations of the first kind.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Unless otherwise stated, from now on we deal exclusively with G lq . A simplified analysis applies to c l .
References
Asmussen, S., and Glynn, P. W.: Stochastic Simulation. Springer, New York (2007)
Bertero, M., and Boccacci, P.: Introduction to Inverse Problems in Imaging. IoP, Bristol (2002)
Bertsekas, D.P., and Tsitsiklis, J.: Neuro-Dynamic Programming. Athena Scientific (1996)
Bertsekas D.P., and Yu, H.: Projected Equation Methods for Approximate Solution of Large Linear Systems. J. Comp. Appl. Math., 227, 27–50 (2009)
Biegler, L., Biros, G., Ghattas, O., Heinkenschloss, M., Keyes, D., Mallick, B., Marzouk, Y., Tenorio, L., van Blomen Waanders, B., and Willcox, K. (eds.): Large-Scale Inverse Problems and Quantification of Uncertainty. Wiley, Chichester (2011)
Curtiss, J. H.: Monte Carlo Methods for the Iteration of Linear Operators. J. Math. Phys., 32(4), 209–232 (1953)
Drineas, P., Kannan, R., and Mahoney, M.W.: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication. SIAM J. Comput. 36, 132–157 (2006)
Drineas, P., Kannan, R., and Mahoney M.W.: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix. SIAM J. Comput. 36, 158–183 (2006)
Drineas, P., Kannan, R., and Mahoney M.W.:, Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition. SIAM J. Comput. 36, 184–206 (2006)
Forsythe, G.E., and Leibler, R.A.: Matrix Inversion by a Monte Carlo Method. Math. Tabl. Aids to Comp., 6(38), 78–81 (1950)
Groetsch, C.W.: The Theory of Tikhonov Regularization for Fredholm Equations of the First Kind. Pitman, London (1984)
Halton, J.H.: A Retrospective and Prospective Survey of the Monte Carlo Method. SIAM Review, 12(1) (1970)
Hansen, P.C.: Discrete Inverse Problems: Insight and Algorithms. SIAM, Philadelphia (2010)
Kaipio, J., and Somersalo, E.: Statistical and Computational Inverse Problems. Springer, New York (2004)
Lemieux, C.: Monte Carlo and Quasi-Monte Carlo Sampling, Springer, New York (2009)
Matlab, The Mathworks Ltd
O’Leary, D.P.: Near-optimal Parameters for Tikhonov and Other Regularization Methods. SIAM J. on Scientific Computing, 23(4), 1161–1171 (2001)
Sutton, R.S., and Barto, A.G.: Reinforcement Learning: An Introduction. The MIT Press, Boston (1998)
Wang, M., Polydorides, N., and Bertsekas, D.P.: Approximate Simulation-Based Solution of Large-Scale Least Squares Problems, Report LIDS-P-2819, MIT (2009)
Acknowledgements
Research is supported by the Cyprus Program at MIT Energy Initiative, the LANL Information of Science and Technology Institute, and by NSF Grant ECCS-0801549.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Polydorides, N., Wang, M., Bertsekas, D.P. (2012). A Quasi Monte Carlo Method for Large-Scale Inverse Problems. In: Plaskota, L., Woźniakowski, H. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2010. Springer Proceedings in Mathematics & Statistics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27440-4_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-27440-4_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27439-8
Online ISBN: 978-3-642-27440-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)