2002
DOI: 10.1364/josaa.19.001817
|View full text |Cite
|
Sign up to set email alerts
|

Multigrid preconditioned conjugate-gradient method for large-scale wave-front reconstruction

Abstract: We introduce a multigrid preconditioned conjugate-gradient (MGCG) iterative scheme for computing open-loop wave-front reconstructors for extreme adaptive optics systems. We present numerical simulations for a 17-m class telescope with n = 48756 sensor measurement grid points within the aperture, which indicate that our MGCG method has a rapid convergence rate for a wide range of subaperture average slope measurement signal-to-noise ratios. The total computational cost is of order n log n. Hence our scheme prov… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
65
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 77 publications
(65 citation statements)
references
References 3 publications
0
65
0
Order By: Relevance
“…Sparse matrix factorization methods [2] have been used with a conjugate-gradient iterative scheme paired with either a multigrid (MG) [3,4] or a Fourier [5] preconditioner. This provides convergence only in a small number of iterations.…”
Section: Introductionmentioning
confidence: 99%
“…Sparse matrix factorization methods [2] have been used with a conjugate-gradient iterative scheme paired with either a multigrid (MG) [3,4] or a Fourier [5] preconditioner. This provides convergence only in a small number of iterations.…”
Section: Introductionmentioning
confidence: 99%
“…However, the local nature of the simplex B-spline basis polynomials allows the definition of a D-SABRE algorithm that can theoretically obtain a computational complexity of ON 2 ∕G 2 when a total of G parallel processors are used. Additionally, the sparse matrix methods from [8,9] and the multigrid preconditioned conjugate-gradient methods from [10,11] can be used with the SABRE to further increase computational efficiency. Two numerical experiments are conducted using a Fourier optics based simulation of a SH lenslet array.…”
Section: Discussionmentioning
confidence: 99%
“…Fueled by the development of a new generation of extremely large optical telescopes, innovations in FD methods are mainly focused on increasing their computational efficiency [6,7]. Examples of such innovations are a computationally efficient sparse matrix inversion method by Ellerbroek [8] and Vogel [9] and a multigrid preconditioned conjugate-gradient method by Gilles et al [10] and Vogel and Yang [11]. More recently, Rosensteiner presented a cumulative reconstruction method based on line integrals that further reduces computational complexity [12].…”
Section: Introductionmentioning
confidence: 99%
“…Many faster methods have been proposed and analyzed using computer simulations. Examples include the conjugate-gradient (CG) [1], Fourier-domain (FD) [2], blended FD-CG [3], and sparse methods [4]. Recently, it was shown through simulation that a single-iteration multigrid (SIMG) method is as effective as CG methods for both multiconjugate [5] and single-conjugate adaptive optics (MCAO and SCAO, respectively) [6].…”
mentioning
confidence: 99%
“…It is worth noting that this simple trick destroys the block-toeplitz with toeplitz block structure of G T G. Although this does not affect the SIMG in any way, methods such as FD reconstruction [2] or Fourierbased preconditioning [11] rely on a shift-invariant structure. To adapt to a circular aperture they must either use a heuristic to correct for edge effects [2] or use an enlarged computational domain [1,11]. No special provisions were made to account for the central obscured region; these measurements are simply zeroed.…”
mentioning
confidence: 99%