Jump to content

Anatoly Karatsuba: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
top: title
No edit summary
Line 17: Line 17:
His textbook ''Foundations of [[analytic number theory]]'' went to two editions, 1975 and 1983.<ref name="1998a"/>
His textbook ''Foundations of [[analytic number theory]]'' went to two editions, 1975 and 1983.<ref name="1998a"/>


The [[Karatsuba algorithm]] is the earliest known divide and conquer [[algorithm]] for [[multiplication]] and lives on as a [[special case]] of its direct generalization, the [[Toom–Cook multiplication|Toom–Cook algorithm]].<ref>D. Knuth, ''[[The Art of Computer Programming|TAOCP]]'' vol. II, sec. 4.3.3</ref> His eponymous algorithm is a fast [[multiplication algorithm|procedure for multiplying large numbers]], a [[divide and conquer algorithm]] later [[Asymptotic computational complexity|asymptotically]] improved by the [[Schönhage–Strassen algorithm]] which is based on the A. A. Karatsuba ideas and its development.<ref>{{cite journal| first=A. A.| last=Karatsuba| title= Comments to My Works,Written by Myself| pages=1–23| journal=Proceedings of the Steklov Institute of Mathematics (Supplementary issues)| issue=282:1| year=2013}}</ref><ref>{{cite journal| first=S.A.| last=Gritsenko, E. A. Karatsuba, M. A. Korolev, I. S. Rezvyakova, D. I. Tolev, M. E. Changa| title= Scientific Achievements of Anatolii Alekseevich Karatsuba | pages=1–22| journal= Proceedings of the Steklov Institute of Mathematics (Supplementary issues)| issue=280:2| year=2013}}</ref>
The [[Karatsuba algorithm]] is the earliest known divide and conquer [[algorithm]] for [[multiplication]] and lives on as a [[special case]] of its direct generalization, the [[Toom–Cook multiplication|Toom–Cook algorithm]].<ref>D. Knuth, ''[[The Art of Computer Programming|TAOCP]]'' vol. II, sec. 4.3.3</ref> His eponymous algorithm is a fast [[multiplication algorithm|procedure for multiplying large numbers]], a [[divide and conquer algorithm]] later [[Asymptotic computational complexity|asymptotically]] improved by the [[Schönhage–Strassen algorithm]] which is based on A. A. Karatsuba's ideas and their development.<ref>{{cite journal| first=A. A.| last=Karatsuba| title= Comments to My Works,Written by Myself| pages=1–23| journal=Proceedings of the Steklov Institute of Mathematics (Supplementary issues)| issue=282:1| year=2013}}</ref><ref>{{cite journal| first=S.A.| last=Gritsenko, E. A. Karatsuba, M. A. Korolev, I. S. Rezvyakova, D. I. Tolev, M. E. Changa| title= Scientific Achievements of Anatolii Alekseevich Karatsuba | pages=1–22| journal= Proceedings of the Steklov Institute of Mathematics (Supplementary issues)| issue=280:2| year=2013}}</ref>


The main research works of Anatoly Karatsuba were published in more than 160 research papers and monographs.<ref>[http://www.mi.ras.ru/~karatsuba/list_e.html List of research works], Anatolii Karatsuba, Steklov Mathematical Institute (accessed March 2012).</ref>
The main research works of Anatoly Karatsuba were published in more than 160 research papers and monographs.<ref>[http://www.mi.ras.ru/~karatsuba/list_e.html List of research works], Anatolii Karatsuba, Steklov Mathematical Institute (accessed March 2012).</ref>

Revision as of 11:33, 27 February 2016

Anatolii Alexeevich Karatsuba
Born(1937-01-31)31 January 1937
Died28 September 2008(2008-09-28) (aged 71)
NationalityRussian
Alma materMoscow State University
Scientific career
FieldsMathematician

Anatoly Alexeevitch Karatsuba (or Karačuba) (Template:Lang-ru; Grozny, Soviet Union, January 31, 1937 – Moscow, Russia, September 28, 2008[1]) was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

For most of his student and professional life he was associated with the Faculty of Mechanics and Mathematics of Moscow State University, defending a D.Sc. there entitled "The method of trigonometric sums and intermediate value theorems" in 1966.[2] He later held a post at the Steklov Institute of Mathematics of the Academy of Sciences.[2]

His textbook Foundations of analytic number theory went to two editions, 1975 and 1983.[2]

The Karatsuba algorithm is the earliest known divide and conquer algorithm for multiplication and lives on as a special case of its direct generalization, the Toom–Cook algorithm.[3] His eponymous algorithm is a fast procedure for multiplying large numbers, a divide and conquer algorithm later asymptotically improved by the Schönhage–Strassen algorithm which is based on A. A. Karatsuba's ideas and their development.[4][5]

The main research works of Anatoly Karatsuba were published in more than 160 research papers and monographs.[6]

See also

References

  1. ^ http://iopscience.iop.org/1064-5632/72/6/E01/pdf/1064-5632_72_6_E01.pdf
  2. ^ a b c 1998 Russian Mathematical Survey 53 419 http://iopscience.iop.org/0036-0279/53/2/M21
  3. ^ D. Knuth, TAOCP vol. II, sec. 4.3.3
  4. ^ Karatsuba, A. A. (2013). "Comments to My Works,Written by Myself". Proceedings of the Steklov Institute of Mathematics (Supplementary issues) (282:1): 1–23.
  5. ^ Gritsenko, E. A. Karatsuba, M. A. Korolev, I. S. Rezvyakova, D. I. Tolev, M. E. Changa, S.A. (2013). "Scientific Achievements of Anatolii Alekseevich Karatsuba". Proceedings of the Steklov Institute of Mathematics (Supplementary issues) (280:2): 1–22.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  6. ^ List of research works, Anatolii Karatsuba, Steklov Mathematical Institute (accessed March 2012).
  • G. I. Archipov; V. N. Chubarikov (1997). "On the mathematical works of professor A. A. Karatsuba". Proc. Steklov Inst. Math. 218.

Template:Persondata