Abstract
An algebraic multilevel iteration method for solving a system of linear algebraic equations arising in H(curl) and H(div) spaces is presented. The algorithm is developed for the discrete problem obtained by using the space of lowest-order Nedelec and Raviart–Thomas–Nedelec elements. The theoretical analysis of the method is based only on some algebraic sequences and generalized eigenvalues of local (element-wise) problems. In the hierarchical basis framework, explicit recursion formulas are derived to compute the element matrices and the constant γ (which measures the quality of the space splitting) at any given level. It is proved that the proposed method is robust with respect to the problem parameters and is of optimal order complexity. Supporting numerical results, including the case when the parameters have jumps, are also presented.
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.
