Estimation of polynomial roots by continued fractions
Estimation of simple linear regression model using ranked set sampling.
Estimation of the condition number of a matrix in the direct discretization of the Symm equation on a quasi-uniform grid.
Estimation of the conductivity in the one-phase Stefan problem : numerical results
Estimation of the Effect of Numerical Integration in Finite Element Eigenvalue Approximation.
Estimation of the parameters of the reversed generalized logistic distribution with progressive censoring data.
Estimations d'erreur pour des éléments finis droits presque dégénérés
Estimations des erreurs de meilleure approximation polynomiale et d'interpolation de Lagrange dans les espaces de Sobolev d'ordre non entier.
Estimators of the asymptotic variance of stationary point processes - a comparison
We investigate estimators of the asymptotic variance of a –dimensional stationary point process which can be observed in convex and compact sampling window . Asymptotic variance of is defined by the asymptotic relation (as ) and its existence is guaranteed whenever the corresponding reduced covariance measure has finite total variation. The three estimators discussed in the paper are the kernel estimator, the estimator based on the second order intesity of the point process and the...
Estudio computacional de algunos nuevos algoritmos heurísticos para el problema de planificación de proyectos con limitación de recursos.
El trabajo describe dos métodos de diseño de algoritmos heurísticos para el problema de planificación de un proyecto con limitación de recursos. El primer método es constructivo: las actividades del proyecto se intentan incorporar a la secuencia posible tan pronto como lo permiten sus relaciones de precedencia, resolviendo de diversas formas los conflictos provocados por la limitación de recursos. El segundo enfoque está basado en la idea de incorporar arcos disjuntos para resolver las incompatibilidades...
Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...
Estudio del error progresivo en la eliminación de Neville
Étude de deux schémas numériques pour les équations de la thermoélasticité
É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
Etude de la vitesse de convergence de l'algorithme en cascade dans la construction des ondelettes d'Ingrid Daubechies.
The aim of this paper is the study of the convergence of algorithms involved in the resolution of two scale equations. They are fixed point algorithms, often called cascade algorithms, which are used in the construction of wavelets. We study their speed of convergence in Lebesgue and Besov spaces, and show that the quality of the convergence depends on two independent factors. The first one, as we could foresee, is the regularity of the scaling function which is the solution of the equation. The...
Etude de l'algorithme de Rémès en l'absence de condition de Haar.
Étude d'un schéma aux différences finies pour la résolution numérique des équations de Navier-Stokes couplées à celle de la chaleur
Étude mathématique d'un modèle de flamme laminaire sans température d'ignition : I - cas scalaire
Étude numérique des oscillations des systèmes semi-linéaires
Étude numérique des pôles de résonance associés à la diffraction d'ondes acoustiques et élastiques par un obstacle en dimension 2