26 research outputs found
V-cycle optimal convergence for DCT-III matrices
The paper analyzes a two-grid and a multigrid method for matrices belonging
to the DCT-III algebra and generated by a polynomial symbol. The aim is to
prove that the convergence rate of the considered multigrid method (V-cycle) is
constant independent of the size of the given matrix. Numerical examples from
differential and integral equations are considered to illustrate the claimed
convergence properties.Comment: 19 page
Spectral behavior of preconditioned non-Hermitian multilevel block Toeplitz matrices with matrix-valued symbol
This note is devoted to preconditioning strategies for non-Hermitian
multilevel block Toeplitz linear systems associated with a multivariate
Lebesgue integrable matrix-valued symbol. In particular, we consider special
preconditioned matrices, where the preconditioner has a band multilevel block
Toeplitz structure, and we complement known results on the localization of the
spectrum with global distribution results for the eigenvalues of the
preconditioned matrices. In this respect, our main result is as follows. Let
, let be the linear space of complex matrices, and let be functions whose components
belong to .
Consider the matrices , where varies
in and are the multilevel block Toeplitz matrices
of size generated by . Then
, i.e. the family
of matrices has a global (asymptotic)
spectral distribution described by the function , provided
possesses certain properties (which ensure in particular the invertibility of
for all ) and the following topological conditions are met:
the essential range of , defined as the union of the essential ranges
of the eigenvalue functions , does not
disconnect the complex plane and has empty interior. This result generalizes
the one obtained by Donatelli, Neytcheva, Serra-Capizzano in a previous work,
concerning the non-preconditioned case . The last part of this note is
devoted to numerical experiments, which confirm the theoretical analysis and
suggest the choice of optimal GMRES preconditioning techniques to be used for
the considered linear systems.Comment: 18 pages, 26 figure
Multigrid methods for anisotropic BTTB systems
AbstractMultigrid methods are highly efficient solution techniques for large sparse multilevel Toeplitz systems which are positive definite and ill-conditioned. In this paper, we develop multigrid methods which are especially designed for anisotropic two-level Toeplitz (BTTB) matrices. First, a method is described for systems with anisotropy along coordinate axes as a suitable combination of semicoarsening and full coarsening steps. Although the basic idea is known from the solution of partial differential equations, we present it here in a more formal way using generating functions and their level curves. This enables us not only to prove the optimal convergence of the two-grid method, but also to carry over the results to systems with anisotropy in other directions. We introduce new coordinates in order to describe these more complicated systems in terms of generating functions. This enables us to solve them with the same efficiency. For the two-level method, we present a convergence proof in this more general case
BTTB preconditioners for BTTB least squares problems
AbstractIn this paper, we consider solving the least squares problem minx‖b-Tx‖2 by using preconditioned conjugate gradient (PCG) methods, where T is a large rectangular matrix which consists of several square block-Toeplitz–Toeplitz-block (BTTB) matrices and b is a column vector. We propose a BTTB preconditioner to speed up the PCG method and prove that the BTTB preconditioner is a good preconditioner. We then discuss the construction of the BTTB preconditioner. Numerical examples, including image restoration problems, are given to illustrate the efficiency of our BTTB preconditioner. Numerical results show that our BTTB preconditioner is more efficient than the well-known Level-1 and Level-2 circulant preconditioners
V-cycle optimal convergence for certain (multilevel) structured linear systems
In this paper we are interested in the solution by multigrid strategies of multilevel linear systems whose coefficient matrices belong to the circulant, Hartley, or \u3c4 algebras or to the Toeplitz class and are generated by (the Fourier expansion of) a nonnegative multivariate polynomial f. It is well known that these matrices are banded and have eigenvalues equally distributed as f, so they are ill-conditioned whenever f takes the zero value; they can even be singular and need a low-rank correction. We prove the V-cycle multigrid iteration to have a convergence rate independent of the dimension even in presence of ill-conditioning. If the (multilevel) coefficient matrix has partial dimension nr at level r, r = 1, . . . ,d, then the size of the algebraic system is N(n) = \u3a0r=1 d nr, O(N(n)) operations are required by our technique, and therefore the corresponding method is optimal. Some numerical experiments concerning linear systems arising in applications, such as elliptic PDEs with mixed boundary conditions and image restoration problems, are considered and discussed.cussed
Superlinear convergence for PCG using band plus algebra preconditioners for Toeplitz systems
AbstractThe paper studies fast and efficient solution algorithms for n×n symmetric ill conditioned Toeplitz systems Tn(f)x=b where the generating function f is known a priori, real valued, nonnegative, and has isolated roots of even order. The preconditioner that we propose is a product of a band Toeplitz matrix and matrices that belong to a certain trigonometric algebra. The basic idea behind the proposed scheme is to combine the advantages of all components of the product that are well known when every component is used as a stand-alone preconditioner. As a result we obtain a flexible preconditioner which can be applied to the system Tn(f)x=b infusing superlinear convergence to the PCG method. The important feature of the proposed technique is that it can be extended to cover the 2D case, i.e. ill-conditioned block Toeplitz matrices with Toeplitz blocks. We perform many numerical experiments, whose results confirm the theoretical analysis and effectiveness of the proposed strategy
Spectral features of matrix-sequences, GLT, symbol, and application in preconditioning Krylov methods, image deblurring, and multigrid algorithms.
The final purpose of any scientific discipline can be regarded as the solution of real-world problems. With this aim, a mathematical modeling of the considered phenomenon is often compulsory. Closed-form solutions of the arising functional equations are usually not available and numerical discretization techniques are required. In this setting, the discretization of an infinite-dimensional linear equation via some linear approximation method, leads to a sequence of linear systems of increasing dimension whose coefficient matrices could inherit a structure from the continuous problem. For instance, the numerical approximation by local methods of constant or nonconstant coefficients systems of Partial Differential Equations (PDEs) over multidimensional domains, gives rise to multilevel block Toeplitz or to Generalized Locally Toeplitz (GLT) sequences, respectively. In the context of structured matrices, the convergence properties of iterative methods, like multigrid or preconditioned Krylov techniques, are strictly related to the notion of symbol, a function whose role relies in describing the asymptotical distribution of the spectrum.
This thesis can be seen as a byproduct of the combined use of powerful tools like symbol, spectral distribution, and GLT, when dealing with the numerical solution of structured linear systems. We approach such an issue both from a theoretical and practical viewpoint. On the one hand, we enlarge some known spectral distribution tools by proving the eigenvalue distribution of matrix-sequences obtained as combination of some algebraic operations on multilevel block Toeplitz matrices. On the other hand, we take advantage of the obtained results for designing efficient preconditioning techniques. Moreover, we focus on the numerical solution of structured linear systems coming from the following applications: image deblurring, fractional diffusion equations, and coupled PDEs. A spectral analysis of the arising structured sequences allows us either to study the convergence and predict the behavior of preconditioned Krylov and multigrid methods applied to the coefficient matrices, or to design effective preconditioners and multigrid solvers for the associated linear systems