Abstract
The paper presents performance considerations for Krylov space iterative solvers used in hp-adaptive finite element codes. The design of optimal data structures and algorithms in terms of memory requirements and computing efficiency is shown. Preliminary computational results prove the correctness of basic assumptions and indicate the direction of further research.
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.
