Results 1 to 10 of about 254 (139)
Laguerre's Method Applied to the Matrix Eigenvalue Problem [PDF]
Mathematics of Computation, 1964 1. Introduction. We present a new algorithm for the calculation of the eigenvalues of real square matrices of orders up to 100. The basic method is directly applicable to complex matrices as well and, in both cases, with each eigenvalue X of A a vector v is produced for which (A - XI)v is null except for a small last element.
Beresford Ν. Parlett
openalex +3 more sources
Laguerre's iteration and the method of traces for eigenproblems
Applied Mathematics Letters, 1990 Abstract In this note we show that Laguerre's method for finding the root of a polynomial when applied to the characteristic polynomial of a matrix is the same as the method of traces for determining an eigenpair of that matrix.
Christopher T. Lenard
openalex +2 more sources
Comparing parallel Newton's method with parallel Laguerre's method
Computers & Mathematics with Applications, 1976 AbstractNewton's and Laguerre's methods can be used to concurrently refine all separated zeros of a polynomial P(z). This paper analyses the rate convergence of both procedures, and its implication on the attainable number n of correct figures. In two special cases the number m of iterations required to reach an accuracy η = 10−n is shown to grow as ...
Irene Gargantini
openalex +3 more sources
On the application of Laguerre's method to the polynomial eigenvalue problem [PDF]
, 2017 The polynomial eigenvalue problem arises in many applications and has received a great deal of attention over the last decade. The use of root-finding methods to solve the polynomial eigenvalue problem dates back to the work of Kublanovskaya (1969, 1970) and has received a resurgence due to the work of Bini and Noferini (2013).
Thomas R. Cameron, Nikolas I. Steckley
openalex +3 more sources
On optimal parameter of Laguerre's family of zero-finding methods
International Journal of Computer Mathematics, 2018 A one parameter Laguerre's family of iterative methods for solving nonlinear equations is considered. This family includes the Halley, Ostrowski and Euler methods, most frequently used one-point third-order methods for finding zeros. Investigation of convergence quality of these methods and their ranking is reduced to searching optimal parameter of ...
L.D. Petković +2 more
openalex +3 more sources
Laguerre-Intersection Method for Implicit Solvation [PDF]
International Journal of Computational Geometry & Applications, 2018 Explicit solvent molecular dynamics simulations of a macromolecule are slow as the number of solvent atoms considered typically increases by order of magnitude. Implicit methods introduce surface-dependent corrections to the force field, gaining speed at the expense of accuracy. Properties such as molecular interface surfaces, volumes and cavities are
Michelle Hatch Hummel +3 more
openaire +3 more sources
Nonlinear edge waves and shallow-water theory [PDF]
, 1976 Nonlinear effects are considered for shallow-water edge waves on beaches with a general depth distribution. The case of uniform depth away from the shoreline is considered in detail. It is shown that the results obtained are in qualitative agreement with
Minzoni, A. A.
core +3 more sources
Laguerre-like methods for the simultaneous approximation of polynomial multiple zeros [PDF]
, 2006 Two new methods of the fourth order for the simultaneous determination of multiple zeros of a polynomial are proposed. The presented methods are based on the fixed point relation of Laguerre's type and realized in ordinary complex arithmetic as well as ...
Milošević Dušan +2 more
core +1 more source
Generalization of the Analytical Exponential Model for Homogeneous Reactor Kinetics Equations
Journal of Applied Mathematics, 2012 Mathematical form for two energy groups of three-dimensional homogeneous reactor kinetics equations and average one group of the precursor concentration of delayed neutrons is presented.
Abdallah A. Nahla, Mohammed F. Al-Ghamdi
doaj +1 more source
Can Any Stationary Iteration Using Linear Information Be Globally Convergent? [PDF]
, 1980 All known globally convergent iterations for the solution of a nonlinear operator equation f(x) = 0 are either nonstationary or use nonlinear information.
Wasilkowski, Grzegorz W.
core +2 more sources