Abstract
This chapter discusses computational methods for approximating portfolio and asset pricing problems. Formulation of these problems is usually specified along with components, preferences, payoffs, etc., that are analytic functions. This implies that the solutions to these problems acquire this property, so that these solutions can be accurately approximated by polynomials within a specified region. It is also possible to obtain a uniform upper bound for the approximation error within a subset of this region. Sections 2 and 3 address each problem in discrete time, while Sections 4 and 5 examine these problems in continuous time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
