7 research outputs found

    V-cycle optimal convergence for DCT-III matrices

    Full text link
    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

    BTTB preconditioners for BTTB least squares problems

    Get PDF
    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

    Spectral behavior of preconditioned non-Hermitian multilevel block Toeplitz matrices with matrix-valued symbol

    Full text link
    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 Ik:=(−π,π)kI_k:=(-\pi,\pi)^k, let Ms\mathcal M_s be the linear space of complex s×ss\times s matrices, and let f,g:Ik→Msf,g:I_k\to\mathcal M_s be functions whose components fij, gij:Ik→C, i,j=1,…,s,f_{ij},\,g_{ij}:I_k\to\mathbb C,\ i,j=1,\ldots,s, belong to L∞L^\infty. Consider the matrices Tn−1(g)Tn(f)T_n^{-1}(g)T_n(f), where n:=(n1,…,nk)n:=(n_1,\ldots,n_k) varies in Nk\mathbb N^k and Tn(f),Tn(g)T_n(f),T_n(g) are the multilevel block Toeplitz matrices of size n1⋯nksn_1\cdots n_ks generated by f,gf,g. Then {Tn−1(g)Tn(f)}n∈Nk∼λg−1f\{T_n^{-1}(g)T_n(f)\}_{n\in\mathbb N^k}\sim_\lambda g^{-1}f, i.e. the family of matrices {Tn−1(g)Tn(f)}n∈Nk\{T_n^{-1}(g)T_n(f)\}_{n\in\mathbb N^k} has a global (asymptotic) spectral distribution described by the function g−1fg^{-1}f, provided gg possesses certain properties (which ensure in particular the invertibility of Tn−1(g)T_n^{-1}(g) for all nn) and the following topological conditions are met: the essential range of g−1fg^{-1}f, defined as the union of the essential ranges of the eigenvalue functions λj(g−1f), j=1,…,s\lambda_j(g^{-1}f),\ j=1,\ldots,s, 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 g=1g=1. 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

    HOW TO PROVE THAT A PRECONDITIONER CANNOT BE SUPERLINEAR

    No full text
    In the general case of multilevel Toeplitz matrices, we recently proved that any multilevel circulant preconditioner is not superlinear (a cluster it may provide cannot be proper). The proof was based on the concept of quasi-equimodular matrices, although this concept does not apply, for example, to the sine-transform matrices. In this paper, with a new concept of partially equimodular matrices, we cover all trigonometric matrix algebras widely used in the literature. We propose a technique for proving the non-superlinearity of certain frequently used preconditioners for some representative sample multilevel matrices. At the same time, we show that these preconditioners are, in a certain sense, the best among the sublinear preconditioners (with only a general cluster) for multilevel Toeplitz matrices

    How to prove that a preconditioner cannot be superlinear

    No full text

    Spectral features of matrix-sequences, GLT, symbol, and application in preconditioning Krylov methods, image deblurring, and multigrid algorithms.

    Get PDF
    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

    Preconditioned fast solvers for large linear systems with specific sparse and/or Toeplitz-like structures and applications

    Get PDF
    In this thesis, the design of the preconditioners we propose starts from applications instead of treating the problem in a completely general way. The reason is that not all types of linear systems can be addressed with the same tools. In this sense, the techniques for designing efficient iterative solvers depends mostly on properties inherited from the continuous problem, that has originated the discretized sequence of matrices. Classical examples are locality, isotropy in the PDE context, whose discrete counterparts are sparsity and matrices constant along the diagonals, respectively. Therefore, it is often important to take into account the properties of the originating continuous model for obtaining better performances and for providing an accurate convergence analysis. We consider linear systems that arise in the solution of both linear and nonlinear partial differential equation of both integer and fractional type. For the latter case, an introduction to both the theory and the numerical treatment is given. All the algorithms and the strategies presented in this thesis are developed having in mind their parallel implementation. In particular, we consider the processor-co-processor framework, in which the main part of the computation is performed on a Graphics Processing Unit (GPU) accelerator. In Part I we introduce our proposal for sparse approximate inverse preconditioners for either the solution of time-dependent Partial Differential Equations (PDEs), Chapter 3, and Fractional Differential Equations (FDEs), containing both classical and fractional terms, Chapter 5. More precisely, we propose a new technique for updating preconditioners for dealing with sequences of linear systems for PDEs and FDEs, that can be used also to compute matrix functions of large matrices via quadrature formula in Chapter 4 and for optimal control of FDEs in Chapter 6. At last, in Part II, we consider structured preconditioners for quasi-Toeplitz systems. The focus is towards the numerical treatment of discretized convection-diffusion equations in Chapter 7 and on the solution of FDEs with linear multistep formula in boundary value form in Chapter 8
    corecore