Videolibrary
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
Video Library
Archive
Most viewed videos

Search
RSS
New in collection






Probability Techniques in Analysis and Algorithms on Networks
November 29, 2025 10:00–10:45, Plenary talks, St. Petersburg, St. Petersburg State University, Department of Mathematics and Computer Science (14th Line of Vasilievsky Island, 29b), room 201
 


Approximation by simplest fractions and simplest bianalytic fractions

K. Yu. Fedorovskiy

Lomonosov Moscow State University

Abstract: This talk will examine issues of uniform approximation of functions in domains and on compact sets in the complex plane by sums of analytic kernels (which can be fundamental solutions of various elliptic differential equations, reproducing kernels of various spaces of analytic functions, and other similar analytic objects). Importantly, the approximation aggregates are sums with unit coefficients (such sums are often called simplest or quantized ones). Particular attention will be paid to approximation by simplest fractions (sums of Cauchy kernels) and approximation by simplest bianalytic fractions (sums of bianalytic kernels-fundamental solutions to the Bitsadze equation). Recent results and open problems will be presented.

Language: English

* Zoom ID: 675-315-555, Password: mkn
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025