Results 91 to 100 of about 253 (140)

New methods of Laguerre pole optimization for the ARX model expansion on Laguerre bases

ISA Transactions, 2017
The ARX-Laguerre model is a very important reduced complexity representation of linear system. However a significant reduction of this model is subject to an optimal choice of both Laguerre poles. Therefore we propose in this paper two new methods to estimate, from input/output measurements, the optimal values of Laguerre poles of the ARX-Laguerre ...
Hassani Messaoud, Tawfik Najeh, Abdelkader Mbarek, Lotfi Nabli, Kais Bouzrara   +4 more
openaire   +3 more sources

MATLAB Package for Laguerre Spectral Method [PDF]

2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009
The paper describes the MATLAB package LaguerreEig, based on Laguerre functions expansion for problems formulated on the semi-infinite interval. Applications are given for Schroedinger equations, Arrhenius integral and some linear or nonlinear differential problems.
openaire   +1 more source

Analysis of the quasi-Laguerre method

Numerische Mathematik, 1999
The quasi-Laguerre's iteration formula, using first order logarithmic derivatives at two points, is derived for finding roots of polynomials. Three different derivations are presented, each revealing some different properties of the method. For polynomials with only real roots, the method is shown to be optimal, and the global and monotone convergence,
openaire   +2 more sources

Laguerre series direct method for variational problems

Journal of Optimization Theory and Applications, 1983
A direct method for solving variational problems via Laguerre series is presented. First, an operational matrix for the integration of Laguerre polynomials is introduced. The variational problems are reduced to the solution of algebraic equations. An illustrative example is given.
Y. P. Shih, C. Hwang
openaire   +2 more sources

Generalizations of Laguerre’s Method: Higher Order Methods

SIAM Journal on Numerical Analysis, 1981
Laguerre’s method is an efficient and reliable method for finding zeros of polynomials and certain other functions. A new derivation and motivation of Laguerre’s method is given, which allows it to be included in a class of methods as general as methods of order three or more based on direct generalized Hermite or hyperosculatory interpolation. Members
openaire   +2 more sources

Laguerre method to solve parton evolution equations

AIP Conference Proceedings, 2011
The DGLAP evolution equations for non‐singlet sector of parton density is solved in x‐space based on Laguerre polynomial expansion. High numerical accuracy is achieved by expanding over a set of approximately 30 polynomials. The result of evolved parton densities to high energy scales are in good agreement with phenomenological GRV model.
H. R. Sharifinejad, M. M. Yazdanpanah, Abolfazl Mirjalili   +2 more
openaire   +2 more sources

The Laguerre pseudospectral method for the radial Schrödinger equation

Applied Numerical Mathematics, 2015
Abstract By transforming dependent and independent variables, radial Schrodinger equation is converted into a form resembling the Laguerre differential equation. Therefore, energy eigenvalues and wavefunctions of M-dimensional radial Schrodinger equation with a wide range of isotropic potentials are obtained numerically by using Laguerre ...
H. Alıcı, Hasan Taşeli
openaire   +2 more sources

Operational methods and Laguerre–Gould Hopper polynomials

Applied Mathematics and Computation, 2012
Abstract In this paper, the authors introduce the Laguerre–Gould Hopper polynomials by combining the operational methods with the principle of monomiality. Generating function, series definition, differential equation, and certain other properties of Laguerre–Gould Hopper polynomials are derived.
Subuhi Khan, Ahmed Ali Al-Gonah
openaire   +2 more sources

The Laguerre method for finding the zeros of polynomials

IEEE Transactions on Circuits and Systems, 1989
In both the analysis and the design of linear networks, a commonly occurring task is that of locating the zeros of a polynomial. Among the many methods available for doing this, the one due to Laguerre has some remarkable properties that include a guarantee of convergence for polynomials with only real zeros. Moreover, for simple zeros, real or complex,
openaire   +2 more sources

The Laguerre Collocation Method

2014
The chapter introduces first the functional framework corresponding to the spectral collocation method based on Laguerre functions. The main advantage of these functions is the fact that they decrease smoothly to zero at infinity along with their derivatives. We speculate this behavior in imposing boundary conditions at large distances.
openaire   +2 more sources