Un algorithme d'inversion pour les matrices de Toeplitz par blocs
Dans cet article nous donnons une formule pour les coefficients de l’inverse des matrices de Toeplitz respectivement de symboles (cas singulier) et (cas régulier) où est une fonction appartenant à une classe de fonctions holomorphes sur un disque ouvert contenant le tore et sans zéro sur . Un cas particulier défini par où et sont des polynômes sans zéro sur est traité. Dans le cas où le symbole est singulier, cette formule présente l’intérêt d’avoir un second ordre. Dans tous les...
For the efficient numerical solution of indefinite linear systems arising from curl conforming edge element approximations of the time-harmonic Maxwell equation, we consider local multigrid methods (LMM) on adaptively refined meshes. The edge element discretization is done by the lowest order edge elements of Nédélec’s first family. The LMM features local hybrid Hiptmair smoothers of Jacobi and Gauss–Seidel type which are performed only on basis functions associated with newly created edges/nodal...
For the efficient numerical solution of indefinite linear systems arising from curl conforming edge element approximations of the time-harmonic Maxwell equation, we consider local multigrid methods (LMM) on adaptively refined meshes. The edge element discretization is done by the lowest order edge elements of Nédélec’s first family. The LMM features local hybrid Hiptmair smoothers of Jacobi and Gauss–Seidel type which are performed only on basis functions associated with newly created edges/nodal...
In this paper, our attention is concentrated on the GMRES method for the solution of the system of linear algebraic equations with a nonsymmetric matrix. We perform pre-iterations before starting GMRES and put for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the th powers of eigenvalues of the matrix . Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and numerical...
In this paper we compare the numerical performance on a set of ill conditioned problems of several algorithms for linear systems based upon the explicit QR factorization and the implicit LQ factorization associated with the Huang and the modified Huang algorithms in the ABS class. The results indicate that the modified Huang algorithm is generally more accurate than the Huang algorithm and competitive with commercial codes based upon the QR factorization with Householder of Givens reflections. The...
For a class of anisotropic integrodifferential operators arising as semigroup generators of Markov processes, we present a sparse tensor product wavelet compression scheme for the Galerkin finite element discretization of the corresponding integrodifferential equations u = f on [0,1]n with possibly large n. Under certain conditions on , the scheme is of essentially optimal and dimension independent complexity (h-1| log h |2(n-1)) without corrupting the convergence or smoothness requirements...