Results 11 to 20 of about 262 (105)
An improvement of the Euler–Chebyshev iterative method
The computation of a simple root of a sufficiently smooth scalar function \(f\) is discussed. The Newton method and the Euler-Chebyshev method are briefly presented. A method based on the Euler-Chebyshev method using a linear combination of function values of \(f\) with a convergence order of 5 is constructed.
Grau, Miquel, Díaz-Barrero, José Luis
openaire +4 more sources
The current article introduces a Petrov–Galerkin method (PGM) to address the fourth-order uniform Euler–Bernoulli pinned–pinned beam equation. Utilizing a suitable combination of second-kind Chebyshev polynomials as a basis in spatial variables, the ...
Youssri Hassan Youssri +3 more
doaj +3 more sources
Initial approximations in Euler-Chebyshev's method
The author considers a polynomial \(f(x)\) of degree \(n\) and the Euler-Chebyshev iterative method for approximating its zeros. He proves that for any monic polynomial \(f(x)\) of degree \(n\), there exists a set \(\Gamma_f\subset \mathbb{C}^n\) such that the Euler-Chebyshev method starting from \(x^0= x\in \Gamma_f\) does not converge to the zeros of
openaire +4 more sources
Wilkinson Polynomials: Accuracy Analysis Based on Numerical Methods of the Taylor Series Derivative
Some of the numeric methods for solutions of non-linear equations are taken from a derivative of the Taylor series, one of which is the Newton-Raphson method. However, this is not the only method for solving cases of non-linear equations.
Vera Mandailina +4 more
doaj +1 more source
The possibilities of transition from the practice of approximate determination of deformations of fabrics, clothes by the “Chebyshev networks” method to their accurate assessment are described.
doaj
We proposed a Chebyshev spectral method with a null space approach for investigating the boundary-value problem of a nonprismatic Euler-Bernoulli beam with generalized boundary or interface conditions.
C. P. Hsu, C. F. Hung, J. Y. Liao
doaj +1 more source
High order iterative methods for decomposition‐coordination problems
Many real‐life optimization problems are of the multiobjective type and highdimensional. Possibilities for solving large scale optimization problems on a computer network or multiprocessor computer using a multi‐level approach are studied.
Otu Vaarmann
doaj +1 more source
A semilocal convergence analysis for the method of tangent parabolas
We present a semilocal convergence analysis for the method of tangent parabolas (Euler-Chebyshev) using a combination of Lipschitz and center Lipschitz conditions on the Fréchet derivatives involved.
Ioannis K. Argyros
doaj +2 more sources
Monetary Policy When Preferences Are Quasi‐Hyperbolic
Abstract We study discretionary monetary policy in an economy where economic agents have quasi‐hyperbolic discounting. We demonstrate that a benevolent central bank is able to keep inflation under control for a wide range of discount factors. If the central bank, however, does not adopt the household's time preferences and tries to discourage early ...
RICHARD DENNIS, OLEG KIRSANOV
wiley +1 more source
What If Each Voxel Were Measured With a Different Diffusion Protocol?
ABSTRACT Purpose Expansion of diffusion MRI (dMRI) both into the realm of strong gradients and into accessible imaging with portable low‐field devices brings about the challenge of gradient nonlinearities. Spatial variations of the diffusion gradients make diffusion weightings and directions non‐uniform across the field of view, and deform perfect ...
Santiago Coelho +7 more
wiley +1 more source

