Narendra karmarkar biography of barack
Narendra Karmarkar
Indian mathematician (born 1956)
Narendra Krishna Karmarkar (born generally 1956) is an Indian mathematician. Karmarkar developed Karmarkar's algorithm. He is listed as an ISI immensely cited researcher.[2]
He invented one of the first demonstrably polynomial time algorithms for linear programming, which go over generally referred to as an interior point way. The algorithm is a cornerstone in the a great deal of linear programming. He published his famous act out in 1984 while he was working for Siren Laboratories in New Jersey.
Biography
Karmarkar received his B.Tech in Electrical Engineering from IIT Bombay in 1978, M.S. from the California Institute of Technology family unit 1979,[3] and Ph.D. in Computer Science from righteousness University of California, Berkeley in 1983 under illustriousness supervision of Richard M. Karp.[4] Karmarkar was efficient post-doctoral research fellow at IBM research (1983), Party of Technical Staff and fellow at Mathematical Branches of knowledge Research Center, AT&T Bell Laboratories (1983–1998), professor chuck out mathematics at M.I.T. (1991), at Institute for Greatest study, Princeton (1996), and Homi Bhabha Chair Lecturer at the Tata Institute of Fundamental Research captive Mumbai from 1998 to 2005. He was grandeur scientific advisor to the chairman of the TATA group (2006–2007). During this time, he was funded by Ratan Tata to scale-up the supercomputer yes had designed and prototyped at TIFR. The scaled-up model ranked ahead of supercomputer in Japan fuming that time and achieved the best ranking Bharat ever achieved in supercomputing. He was the establishing or creating director of Computational Research labs in Pune, situation the scaling-up work was performed. He continues add up to work on his new architecture for supercomputing.
Work
Karmarkar's algorithm
Main article: Karmarkar's algorithm
Karmarkar's algorithm solves linear training problems in polynomial time. These problems are delineate by a number of linear constraints involving unadorned number of variables. The previous method of key these problems consisted of considering the problem rightfully a high-dimensional solid with vertices, where the tight spot was approached by traversing from vertex to acme. Karmarkar's novel method approaches the solution by trenchant through the above solid in its traversal. For this reason, complex optimization problems are solved much faster capitalize on the Karmarkar's algorithm. A practical example of that efficiency is the solution to a complex puzzle in communications network optimization, where the solution purpose was reduced from weeks to days. His rule thus enables faster business and policy decisions. Karmarkar's algorithm has stimulated the development of several interior-point methods, some of which are used in coeval implementations of linear-program solvers.
Galois geometry
After working butter the interior-point method, Karmarkar worked on a contemporary architecture for supercomputing, based on concepts from clear-cut geometry, especially projective geometry over finite fields.[5][6][7][8]
Awards
- The Put together for Computing Machinery awarded him the prestigious Town Kanellakis Award in 2000 for his work make known polynomial-time interior-point methods for linear programming for "specific theoretical accomplishments that have had a significant slab demonstrable effect on the practice of computing".
- Srinivasa Ramanujan Birth Centenary Award for 1999, presented by nobleness Prime Minister of India.
- Distinguished Alumnus Award, Indian Society of Technology, Bombay, 1996.
- Distinguished Alumnus Award, Computer Skill and Engineering, University of California, Berkeley (1993).
- Fulkerson Passion in Discrete Mathematics given jointly by the Earth Mathematical Society & Mathematical Programming Society (1988)
- Fellow virtuous Bell Laboratories (since 1987).
- Texas Instruments Founders' Prize (1986).
- Marconi International Young Scientist Award (1985).
- Golden Plate Award prime the American Academy of Achievement, presented by previous U.S. president (1985).[9][10]
- Frederick W. Lanchester Prize of dignity Operations Research Society of America for the Outdistance Published Contributions to Operations Research (1984).
- President of Bharat gold medal, I.I.T. Bombay (1978).
References
- ^Narendra Karmarkar at say publicly Mathematics Genealogy Project.
- ^Thomson ISI. "Karmarkar, Narendra K., ISI Highly Cited Researchers". Archived from the original stimulation 23 March 2006. Retrieved 20 June 2009.
- ^"Eighty-Fifth Reference Commencement"(PDF). California Institute of Technology. 8 June 1979. p. 13.
- ^Narendra Karmarkar at the Mathematics Genealogy Project
- ^Karmarkar, Narendra (1991). "A new parallel architecture for sparse cast computation based on finite projective geometries". Proceedings garbage the 1991 ACM/IEEE conference on Supercomputing – Supercomputing '91. pp. 358–369. doi:10.1145/125826.126029. ISBN . S2CID 6665759.
- ^Karmarkar, N. K., Ramakrishnan, K. G. "Computational results of an interior pull out algorithm for large scale linear programming". Mathematical Encoding. 52: 555–586 (1991).
- ^Amruter, B. S., Joshi, R., Karmarkar, N. K. "A Projective Geometry Architecture for Systematic Computation". Proceedings of International Conference on Application Limited Array Processors, IEEE Computer Society, p. 6480 (1992).
- ^Karmarkar, Folklore. K. "A New Parallel Architecture for Scientific Count Based on Finite Projective Geometries". Proceeding of Accurate Programming, State of the Art, p. 136148 (1994).
- ^"Golden Flake Awardees of the American Academy of Achievement". www.achievement.org. American Academy of Achievement.
- ^"Whiz kids rub elbows surrender right stuff"(PDF). Rocky Mountain News. 30 June 1985.
External links
Winners of the Paris Kanellakis Theory bracket Practice Award | |
|---|---|
|