Open AccessGiải bài toán Carleman suy rộng trên trục thực bằng phương pháp chiếu lặp trên cơ sở phép chiếu bình phương tối thiểu
Author(s) -
Le Xuan Quang
Publication year - 2018
Publication title -
journal of computer science and cybernetics (vietnam academy of science and technology)/journal of computer science and cybernetics
Language(s) - English
Resource type - Journals
eISSN - 2815-5939
pISSN - 1813-9663
DOI - 10.15625/1813-9663/6/1/11133
Subject(s) - combinatorics , projection (relational algebra) , physics , function (biology) , mathematics , algorithm , biology , evolutionary biology
In this paper the projection iterative method is used for solving the generalized Carleman problem A(t) F+(t) + B(t) F+(-t) + C(t) F-(t) = h(t), tÎR Where R is the real axis; A(t), B(t), C(t) are Holder continuous functions; h(t)ÎL2, and F+(t), F-(t) is a boundary value of analytic function upper (lower) half-plane.