Displaying 1201 – 1220 of 1330

Showing per page

Un théorème de Spitzer-Stone fort pour une matrice de Toeplitz à  symbole singulier défini par une classe de fonctions analytiques

Philippe Rambour, Jean-Marc Rinkel (2007)

Annales de la faculté des sciences de Toulouse Mathématiques

Dans cet article nous donnons une formule pour les coefficients de l’inverse des matrices de Toeplitz respectivement de symboles f ( e i θ ) = ( 1 - cos θ ) | f 1 ( e i θ ) | 2 (cas singulier) et | f 1 ( e i θ ) | 2 (cas régulier) où f 1 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 f 1 = Q P P et Q 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...

Uniform convergence of local multigrid methods for the time-harmonic Maxwell equation

Huangxin Chen, Ronald H. W. Hoppe, Xuejun Xu (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

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...

Uniform convergence of local multigrid methods for the time-harmonic Maxwell equation∗

Huangxin Chen, Ronald H.W. Hoppe, Xuejun Xu (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

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...

Using successive approximations for improving the convergence of GMRES method

Jan Zítko (1998)

Applications of Mathematics

In this paper, our attention is concentrated on the GMRES method for the solution of the system ( I - T ) x = b of linear algebraic equations with a nonsymmetric matrix. We perform m pre-iterations y l + 1 = T y l + b before starting GMRES and put y m for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the m th powers of eigenvalues of the matrix T . Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and numerical...

Variations on the Gram-Schmidt and the Huang algorithms for linear systems: A numerical study

Emilio Spedicato, Maria Teresa Vespucci (1993)

Applications of Mathematics

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...

Wavelet compression of anisotropic integrodifferential operators on sparse tensor product spaces

Nils Reich (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

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...

Currently displaying 1201 – 1220 of 1330