Computational Technology Resources - CCP

B. Kiss* and A. Krebsz#

*Department of Mathematics, Istvan Szechenyi College, Gyor, Hungary
#Department of Numerical Analysis, Lorand Eotvos University, Budapest, Hungary

doi:10.4203/ccp.38.8.1

purchase the full-text of this paper

B. Kiss, A. Krebsz, "On the H1/2 Norm based Schur Complement Preconditioners", in B.H.V. Topping, (Editor), "Advances in Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, pp 343-349, 1996. doi:10.4203/ccp.38.8.1

Abstract

Some representations of the H^1/2 norm are used as Schur complement preconditioner in PCG based domain decomposition algorithms for elliptic problems. These norm representations are efficient preconditioners. Here we g-ive a new matrix representation of this norm by a special sparse Toeplitz matrix. It contains only O(log(N)) nonzero entries at each row, where N is the number of rows. The special properties of this matrix assure that can be used as preconditioner. This is proved by estimating spectral equivalence constants and this fact has also been verified by numerical tests.

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £82 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 38 ADVANCES IN COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: B.H.V. Topping Paper VIII.1 On the H1/2 Norm based Schur Complement Preconditioners B. Kiss* and A. Krebsz# Department of Mathematics, Istvan Szechenyi College, Gyor, Hungary #Department of Numerical Analysis, Lorand Eotvos University, Budapest, Hungary doi:10.4203/ccp.38.8.1 purchase the full-text of this paper Full Bibliographic Reference for this paper B. Kiss, A. Krebsz, "On the H1/2 Norm based Schur Complement Preconditioners", in B.H.V. Topping, (Editor), "Advances in Computational Structures Technology", Civil-Comp Press, Edinburgh, UK, pp 343-349, 1996. doi:10.4203/ccp.38.8.1 Abstract Some representations of the H^1/2 norm are used as Schur complement preconditioner in PCG based domain decomposition algorithms for elliptic problems. These norm representations are efficient preconditioners. Here we g-ive a new matrix representation of this norm by a special sparse Toeplitz matrix. It contains only O(log(N))* nonzero entries at each row, where N is the number of rows. The special properties of this matrix assure that can be used as preconditioner. This is proved by estimating spectral equivalence constants and this fact has also been verified by numerical tests. purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £82 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions