Error Estimates for Miller's Algorithm.
Error estimation on the Padé approximation of transfer functions via the Lanczos process.
Essai d'application de la méthode spectroscopique de Lanczos pour la recherche des valeurs propres des matrices
Estimates and iteration procedures for proper values of almost decomposable matrices
Estimates for Multigrid Methods Based on Red-Black Gauss-Seidel Smoothings.
Estimating the matrix p-norm.
Estudio del error progresivo en la eliminación de Neville
Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées
Euclid΄s algorithm and accelerated iterative methods
Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integrals.
Evaluating scientific products by means of citation-based models: a first analysis and validation.
Evaluating the Frechet derivative of the matrix exponential.
Evaluation de l'incertitude sur la solution d'un système Linéaire.
Evaluation of the condition number in linear systems arising in finite element approximations
This paper derives upper and lower bounds for the -condition number of the stiffness matrix resulting from the finite element approximation of a linear, abstract model problem. Sharp estimates in terms of the meshsize h are obtained. The theoretical results are applied to finite element approximations of elliptic PDE's in variational and in mixed form, and to first-order PDE's approximated using the Galerkin–Least Squares technique or by means of a non-standard Galerkin technique in L1(Ω). Numerical...
Exact Inverses of Certain Band Matrices.
Exact Solution of Linear Equations Using P-Adic Expansions
Experiments with Krylov subspace methods on a massively parallel computer
In this note, we compare some Krylov subspace iterative methods on the MASPAR, a massively parallel computer with 16K processors. In particular, we apply these methods to solve large sparse nonsymmetric linear systems arising from elliptic partial differential equations. The methods under consideration include conjugate gradient type methods, semiiterative methods, and a hybrid variant. Our numerical results show that, on the MASPAR, one should compare iterative methods rather on the basis of total...
Explicit conjugate gradient method with preconditioning
An algorithm of the preconditioned conjugate gradient method in which the solution of an auxiliary system is replaced with multiplication by the matrix for suitably chosen is presented.
Explicit solution for an infinite dimensional generalized inverse eigenvalue problem.
Extension de la méthode Procuste à la comparaison de nuages de points situés dans des espaces de dimensions différentes