Abstract
This chapter focuses on three analytic complexity topics, which are the subject of active research in the Department of Computer Science of Yale University. The first topic deals with the complexity of interpolation problems. The second topic discusses the optimal storage algorithms introduced for the direct solution of sparse linear systems of equations. The chapter presents the application of these algorithms to the 5-point difference equations that arise as approximations to partial differential equations in two independent variables. This class of algorithms is a good example of the general phenomenon of being able to construct algorithms for particular problems that trade-off computing time for storage. The third topic deals with a special case of the general problem for finding fixed points.
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.
