 Krylov Methods and Preconditioning in Computational Economics ProblemsMico Mrkaic and Giorgio Pauletto
No 113, Computing in Economics and Finance 2001 from Society for Computational Economics Abstract: Krylov subspace methods have proven to be powerful methods for solving sparse linear systems arising in several engineering problems. More recently, these methods have been successfully applied in computational economics, for instance in the solution of forward-looking macroeconometric models (Gilli and Pauletto and Pauletto and Gilli), dynamic programming problems (Mrkaic) and pricing of financial options (Gilli, Kellezi and Pauletto). Since Krylov methods can suffer from slow convergence, one can modify the original linear system in order to improve convergence properties. This is known as preconditioning. In this paper, we investigate the effects of several preconditioning techniques in the framework of dynamic programming problems and financial option pricing. Very few theoretical results on preconditioning are known and experiments have to be conducted to recognize which classes of problems can be best solved using a given Krylov method and a given preconditioner. Keywords: Sparse linear systems; computational economics; Krylov methods; preconditioning; dynamic programming; option pricing (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:sce:scecf1:113 Access Statistics for this paper More papers in Computing in Economics and Finance 2001 from Society for Computational Economics Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.