Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Doklady Akademii Nauk SSSR, 1991, Volume 318, Number 2, Pages 285–288 (Mi dan6054)  

MATHEMATICS

Numerical algorithms for analytic continuation from discrete sets, and an algorithmic proof of uniqueness theorems

A. M. Fedotov

Computer Centre of USSR Academy of Sciences, Siberian Branch, Krasnoyarsk
Presented: M. M. Lavrent'ev
Received: 15.12.1990
Bibliographic databases:
Document Type: Article
UDC: 517.988
Language: Russian
Citation: A. M. Fedotov, “Numerical algorithms for analytic continuation from discrete sets, and an algorithmic proof of uniqueness theorems”, Dokl. Akad. Nauk SSSR, 318:2 (1991), 285–288; Dokl. Math., 43:3 (1991), 701–704
Citation in format AMSBIB
\Bibitem{Fed91}
\by A.~M.~Fedotov
\paper Numerical algorithms for analytic continuation from discrete sets,
and an algorithmic proof of uniqueness theorems
\jour Dokl. Akad. Nauk SSSR
\yr 1991
\vol 318
\issue 2
\pages 285--288
\mathnet{http://mi.mathnet.ru/dan6054}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1126096}
\zmath{https://zbmath.org/?q=an:0781.65018}
\transl
\jour Dokl. Math.
\yr 1991
\vol 43
\issue 3
\pages 701--704
Linking options:
  • https://www.mathnet.ru/eng/dan6054
  • https://www.mathnet.ru/eng/dan/v318/i2/p285
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024