scholarly journals DEGENERATE MATRIX METHOD WITH CHEBYSHEV NODES FOR SOLVING NONLINEAR SYSTEMS OF DIFFERENTIAL EQUATIONS

1999 ◽  
Vol 4 (1) ◽  
pp. 51-57
Author(s):  
T. Cirulis ◽  
O. Lietuvietis

One of the simplest schemes of the degenerate matrix method with nodes as zeroes of Chebyshev polynomials of the second kind is considered. Performance of simple iterations and some modifications of Newton method for the discrete problem is compared.

1998 ◽  
Vol 3 (1) ◽  
pp. 45-56
Author(s):  
T. Cîrulis ◽  
O. Lietuvietis

Degenerate matrix method for numerical solving nonlinear systems of ordinary differential equations is considered. The method is based on an application of special degenerate matrix and usual iteration procedure. The method, which is connected with an implicit Runge‐Kutta method, can be simply realized on computers. An estimation for the error of the method is given.


1996 ◽  
Vol 19 (3) ◽  
pp. 435-440
Author(s):  
Olusola Akinyele

We introduce a new comparison result which will be an important tool when we apply cone valued Lyapunov like functions. We also introduce new concepts ofϕ0-uniform Lipschitz stability and(λ,λ,ϕ0)-practical stability and employ our comparison result to carry out stability analysis of nonlinear systems. Our results are also applicable to nonlinear perturbed systems.


2001 ◽  
Vol 6 (1) ◽  
pp. 58-67
Author(s):  
T. Cirulis ◽  
D. Cirule ◽  
O. Lietuvietis

Two of the simplest general schemes of the degenerate matrix method in the multistep mode are considered. The stability function for these methods is computed by the residue theory in the complex plane. Performances of uniformly and nonuniformly distributed nodes in the standardized interval are compared.


Sign in / Sign up

Export Citation Format

Share Document