Abstract
Some representations of the H1/2 norm are used as Schur complement preconditioner in PCG based domain decomposition algorithms for elliptic problems. These norm representations are efficient preconditioners but the corresponding matrices are dense, so they need FFT algorithm for matrix-vector multiplications. Here we give a new matrix representation of this norm by a special Toeplitz matrix. It contains only O(log(n)) different entries at each row, where n is the number of rows and so a matrix-vector computation can be done by O(nlog(n)) arithmetic operation without using FFT algorithm. The special properties of this matrix assure that it can be used as preconditioner. This is proved by estimating spectral equivalence constants and this fact has also been verified by numerical tests.
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.
