Iterated clique graphs arise when the clique operator is applied to a graph more than once. Determining whether a graph is a clique graph or an iterated clique graph is usually a difficult task. The fact that being a clique ...

Aczél’s and Ryll-Nardzewski’s dyadic iterations are iterative procedures which associate to a given mean M a family of means { Md: d∈ Dyad ([ 0 , 1 ]) } parameterized by Dyad ([ 0 , 1 ]) , the dyadic fractions of the ...

© 2018, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society. We study the convergence of an inexact version of the classical Krasnosel’skii–Mann iteration for computing fixed points ...

Discriminative training of Gaussian Mixture Models (GMMs) for speech or speaker recognition purposes is usually based on the gradient descent method, in which the iteration step-size, ε, uses to be defined experimentally. ...

Solving the nonlinear equation f(x)=0 is a common problem in several areas of Science and Engineering. Since exact solutions of the nonlinear equation are hardly available, scientists best rely on numerical solutions, such ...

Two iterative schemes for the solution of an H-system with Dirichlet boundary data for a revolution surface are studied: a Newton imbedding type procedure, which yields the local quadratic convergence of the iteration and ...

In this paper, a simple family of one-point iterative schemes for approximating the solutions of nonlinear equations, by using the procedure of weight functions, is derived. The convergence analysis is presented, showing ...

A new family of two-steps fourth-order iterative methods for solving nonlinear equations is introduced based on the weight functions procedure. This family is optimal in the sense of Kung-Traub conjecture and it is extended ...