Results 21 to 30 of about 17,217 (243)
Chebyshev Polynomial Iterations and Approximate Solutions of Linear Operator Equations
Zeitschrift für Analysis und ihre Anwendungen, 1994 An iteration scheme for the approximate solution of a linear operator equation in a Banach space is discussed from the viewpoint of Chebyshev polynomials. The optimal rate of convergence is described by numerical characteristics which are similar to (but different from) the classical Chebyshev constants.
A.P. Zabrejko, Petr P. Zabrejko
openalex +5 more sources
Dynamic multi‐objective optimisation of complex networks based on evolutionary computation
IET Networks, EarlyView., 2022 Abstract As the problems concerning the number of information to be optimised is increasing, the optimisation level is getting higher, the target information is more diversified, and the algorithms are becoming more complex; the traditional algorithms such as particle swarm and differential evolution are far from being able to deal with this situation ...
Linfeng Huang
wiley +1 more source
Results in Physics, 2022 In current study, the modified variational iteration algorithm-I is investigated in the form of the analytical and numerical treatment of different types of nonlinear partial differential equations modelling physical phenomena where particles, energy, or
Hijaz Ahmad +4 more
doaj +1 more source
Chebyshev iteration for the problem with nonlocal boundary condition
Lietuvos Matematikos Rinkinys, 2004 We considered Poisson differential equation with Dirichlet boundary conditions and one nonlocal boundary condition. Finite-difference scheme was investigated for this problem.
Mifodijus Sapagovas +2 more
doaj +3 more sources
Fast matrix inversion based on Chebyshev acceleration for linear detection in massive MIMO systems
Electronics Letters, 2022 To circumvent the prohibitive complexity of linear minimum mean square error detection in a massive multiple‐input multiple‐output system, several iterative methods have been proposed.
Salah Berra +2 more
doaj +1 more source
ON COMPARISONS OF CHEBYSHEV-HALLEY ITERATION FUNCTIONS BASED ON THEIR ASYMPTOTIC CONSTANTS [PDF]
International Journal of Pure and Apllied Mathematics, 2013 Using the Chebyshev-Halley family of iteration functions and numerical examples, we discuss the influence of both the asymptotic constant and the choice of the initial trial in the basin of attraction on the rapidity of convergence of an iterative method.
François Dubeau
openalex +2 more sources
ON THE STABILITY OF THE CHEBYSHEV ITERATIVE METHOD
DYNAMICS OF SYSTEMS, MECHANISMS AND MACHINES, 2023 Numerical solution of the systems of linear equations (linear system), especially in case of nonstationary problems, takes a significant part of computer time. Normally, for solving linear system the applied program packages use either Chebyshev iterative method (wave linear problems etc.), which requires setting the optimal parameter, or gradient ...
Y. N. Zakharov, A. I. Zimin
openaire +1 more source
Parallel Self-Consistent-Field Calculations via Chebyshev-Filtered Subspace Acceleration [PDF]
, 2006 Solving the Kohn-Sham eigenvalue problem constitutes the most computationally expensive part in self-consistent density functional theory (DFT) calculations.
B. Fornberg +10 more
core +1 more source
Low-rank Linear Fluid-structure Interaction Discretizations [PDF]
, 2020 Fluid-structure interaction models involve parameters that describe the solid and the fluid behavior. In simulations, there often is a need to vary these parameters to examine the behavior of a fluid-structure interaction model for different solids and ...
Benner, Peter +2 more
core +2 more sources
AIMS Mathematics, 2023 A new eighth-order Chebyshev-Halley type iteration is proposed for solving nonlinear equations and matrix sign function. Basins of attraction show that several special cases of the new method are globally convergent.
Xiaofeng Wang , Ying Cao
doaj +1 more source