Preconditioned diagonally dominant property for linear systems with -matrices.
Preconditioners for least squares problems by LU factorization.
Preconditioners for saddle point linear systems with highly singular blocks.
Preconditioning conforming finite element methods for treating Dirichlet boundary conditions. II.
Preconditioning conforming finite element methods for treating Dirichlet boundary conditions. I.
Preconditioning Indefinite Discretization Matrices.
Preconditioning of conjugate gradients by multigrid solver
Solving a system of linear algebraic equations by the preconditioned conjugate gradient method requires to solve an auxiliary system of linear algebraic equations in each step. In this paper instead of solving the auxiliary system one iteration of the two level method for the original system is done.
Preconditioning P1 nonconforming finite elements: condition numbers and singular value distributions.
Preconditioning strategies for 2D finite difference matrix sequences.
Preconditionings and Splittings for Rectangular Systems.
Probability against condition number and sampling of multivariate trigonometric random polynomials.
Probing methods for saddle-point problems.
Quasi-Newton preconditioners for the inexact Newton method.
Raffinement de la borne spectrale d'un faisceau de matrices
Real and complex pseudozero sets for polynomials with applications
Pseudozeros are useful to describe how perturbations of polynomial coefficients affect its zeros. We compare two types of pseudozero sets: the complex and the real pseudozero sets. These sets differ with respect to the type of perturbations. The first set – complex perturbations of a complex polynomial – has been intensively studied while the second one – real perturbations of a real polynomial – seems to have received little attention. We present a computable formula for the real pseudozero...
Relations Between Condition Numbers and the Convergence of the Jacobi Method for Real Positive Definite Matrices.
Remarques sur les algorithmes de décomposition de domaines
Some theoretical results derived from polynomial numerical hulls of Jordan blocks.
Sparse finite element methods for operator equations with stochastic data
Let be a strongly elliptic operator on a -dimensional manifold (polyhedra or boundaries of polyhedra are also allowed). An operator equation with stochastic data is considered. The goal of the computation is the mean field and higher moments , , , of the solution. We discretize the mean field problem using a FEM with hierarchical basis and degrees of freedom. We present a Monte-Carlo algorithm and a deterministic algorithm for the approximation of the moment for . The key tool...
Stabilité numérique de l'algorithme de Levinson