Brève communication. Inversion de matrices tridiagonales symétriques
Brève communication. Localisation de valeurs propres, régions de Gudkov
Brève communication. Sur la convergence de l’algorithme pour une matrice hermitienne
Brève communication. Une borne d'erreur dans la résolution de problèmes linéaires perturbes et régularises
Brèves communications. Étude de l'erreur d'arrondi dans la résolution de systèmes linéaires par des méthodes itératives
Cache optimization for structured and unstructured grid multigrid.
Calculation of Gauss Quadratures with Multiple Free and Fixed Knots
Calculation of the Weights of Interpolarory Quadratures
Calculs de complexité relatifs à une méthode de dissection emboîtée.
Characterization of Linear Stationary Iterative Processes for Solving a Singular System of Linear Equations.
Chebyshev approximation via polynomial mappings and the convergence behaviour of Krylov subspace methods.
Chebyshev semi-iteration in preconditioning for problems including the mass matrix.
Checking nonsingularity of tridiagonal matrices.
Checking positive definiteness or stability of symmetric interval matrices is NP-hard
It is proved that checking positive definiteness, stability or nonsingularity of all [symmetric] matrices contained in a symmetric interval matrix is NP-hard.
Chipman pseudoinverse of matrix, its computation and application in spline theory
Cholesky-like factorizations of skew-symmetric matrices.
Circulant preconditioners for convolution-like integral equations with higher-order quadrature rules.
Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils .
Coarsening invariance and bucket-sorted independent sets for algebraic multigrid.
Combinatorial algorithms for computing column space bases that have sparse inverses.