Petrovych R. Aggregative-iterational algorithms for linear equations with bounded operators.

Українська версія

Thesis for the degree of Candidate of Sciences (CSc)

State registration number

0499U003065

Thesis Registration Form

0499U003065.pdf

Applicant for

Specialization

  • 01.01.07 - Обчислювальна математика

21-10-1999

Specialized Academic Board

Д 35.051.07

Ivan Franko National University of Lviv

Essay

In this thesis new iterative algorithms for the linear equations in finite-dimensional and Banach spaces called aggregative-iterational algorithms are constructed and investigated. Using a technique of construction of these algorithms, the aggregative-iterational analogues of some numerical methods, in particular of a successive overrelaxation method, method of steepest descent, Chebyshev iterative method, method of simple iterations are constructed. The conditions of convergence and estimations of error bounds are obtained.

Read more

Similar theses

0421U100791

Beshley Andriy Volodymyrovych

Numerical solution of planar boundary value problems for an elliptic equation with variable coefficients by integral equations approach

0520U101612

Mayko Nataliya V.

The weighted estimates of the functional-discrete methods for solving boundary value problems

0419U004550

Borachok Ihor V.

Numerical solution of the Cauchy problem for the Laplace equation in three dimensional double connected domains

0419U004485

Drebotiy Roman Hryhorovych

Construction and analysis of hp-adaptive finite element schemes for diffusion-convection-reaction problems

0418U003534

Stelmashchuk Vitalii Volodymyrovych

Analysis of generalized thermopiezoelectricity problems and projection-mesh schemes for their solution