1995
DOI: 10.1016/0024-3795(93)00171-u
|View full text |Cite
|
Sign up to set email alerts
|

Best-conditioned circulant preconditioners

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

1996
1996
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…In our method we set D a = D and solve the matrix equation Dx = b for vector x using the conjugate gradients method 30 for each conformation (no preaveraging was used). As the preconditioner we use the inverse of the nearest circulant matrix to D. 31 Choosing this form of a preconditioner allows for efficient calculations using the discrete fast Fourier transform and results in a rapid convergence of the conjugate gradients method. For the diffusion tensor we use the usual Rotne−Prager−Yamakawa form.…”
Section: ■ Experimental Sectionmentioning
confidence: 99%
“…In our method we set D a = D and solve the matrix equation Dx = b for vector x using the conjugate gradients method 30 for each conformation (no preaveraging was used). As the preconditioner we use the inverse of the nearest circulant matrix to D. 31 Choosing this form of a preconditioner allows for efficient calculations using the discrete fast Fourier transform and results in a rapid convergence of the conjugate gradients method. For the diffusion tensor we use the usual Rotne−Prager−Yamakawa form.…”
Section: ■ Experimental Sectionmentioning
confidence: 99%
“…Although the proof is similar to that of Theorem 1 in Chart and Wong [3], we give it here for completeness.…”
Section: Lemma 2 (Huckle [7]) Let a Be An N-by-n Matrix And Mebe Thmentioning
confidence: 86%
“…While fast direct approaches for solving such systems have been proposed in the literature (see for example [5,37]), they tend to be either unstable or problem specific. A more popular approach is to employ some iterative method to solve the system, assisted by an appropriately designed preconditioner, to ensure that the iterative method achieves fast convergence (as in [13,12,36,35,34,8,11,9,7,49,31,10]).…”
Section: Toeplitz Matrices -Circulant Preconditionersmentioning
confidence: 99%
“…Other approximations are possible, however, we focus on the previously presented one. Nevertheless, the reader is referred to [11,49,10], for alternative level-1 circulant approximations. In the following theorem, we summarize some of the wellknown properties of C 1 (•).…”
Section: Toeplitz Matrices -Circulant Preconditionersmentioning
confidence: 99%