Vol 35, 2009, pp. 375-392 S. Shellmann, and K. Sikorski, “A Note on Location and Algorithms for Fixed Points, “International Journal of Pure and Applied Mathematics, vol. 65, No. 2 , 2010, pp. 147-153.
Kris Sikorski Professor www.cs.utah.edu/~sikorski email@example.com
Professor Sikorski received his MS from the Department of Mathematics, Computer Science and Mechanics at the University of Warsaw, and his Ph.D. from the Department of Mathematics at the University of Utah. Professor Sikorski’s research interests are in the areas of scientific computation, computational complexity and numerical analysis, with special emphasis on Information Based Complexity. Of special interest are optimal algorithms for fixed points and nonlinear equations, optimal algorithms for signal reconstruction, forward and inverse problems in geophysics, combustion engineering, computational sensor networks, numerical verification and validation of nonlinear solvers as well as nonlinear optimization for inverse problems in urban modeling. Professor Sikorski was awarded First Degree Prize of the Secretary of Education of Poland (jointly with M. Kowalski and F. Stenger) for research leading to the publication of the monograph: Selected Topics in Approximation and Computation (1996). In 2001-2010 he received 7 Dean’s letters for excellence in teaching as well as best paper award in 2008. He published 2 research monographs with Oxford Press, 1 textbook and numerous papers in wide spread areas from theory of scientific computation and numerical analysis, algorithmic design, through software and hardware design. He is the founding Director (2001) of the Master of Science program in Computational Engineering and Science (www.ces.utah.edu) at the University of Utah. He currently directs the MS CES program. He held positions at universities in USA, Poland, Germany, and Italy. He chairs WG1.1 Research Group on Continuous Algorithms and Complexity/Foundations of Computer Science of the International Federation for Information Processing. He supervised 13 Ph.D. and 28 MS students. His students hold top positions in academia and industry.
Publications Journals B. Bialecki, B. R. Kearfott, K. A. Sikorski, M. Sugihara, Journal of Complexity, Vol 25 Issue 3, June 2009, pp. 233-236. Preface: Issue dedicated to Professor Frank Stenger K. Sikorski, B. Addepalli, E. R. Pardyjak and M. Zhdanov, “Quasi- Monte Carlo, Monte Carlo, and regularized gradient optimization methods for source characterization of atmospheric releases, in Algorithms and Complexity for Continuous Problems” 2009, editors T. Muller-Gronbach, L. Plaskota and J. F. Traub, Dagstuhl Seminar Proceedings, ISSN = (1862-4405), Dagstuhl, Germany K. Sikorski, “Computational Complexity of Fixed Points,” Journal of Fixed Points Theory and Applications, Birkhauser Basel, Vol 6 No 2, Dec 2009, pp. 249- 283, (dedicated to S. Smale on his 80th birthday) Edited, Special Issue of Journal of Complexity devoted to Frank Stenger’s Festschrift, Vol 25, Issue 3, 2009, pp. 231-310. F. Sawo, T. C. Henderson, C. Sikorski, and U. D. Hanebeck, “Passive Localization Methods exploiting Models of Distributed Natural Phenomena,” Lecture Notes in Electrical Engineering, (Collection of best papers from MFI 2008), Springer Verlag,
72 >> 2009 & 2010 REPORT
Refereed Conference and Workshops B. Addepalli, E. Pardyjak, K. Sikorski and M. Zhdanov, “Source characterization of atmospheric releases using stochastic search and regularized gradient optimization,” Inverse Problems in Science & Engineering, paper ID GIPE-2010-0049, 2010. Ch. Booniasiriwat, K. Sikorski and Ch-W, Tsay, “The Exterior Ellipsoid Algorithm for Fixed Points, Mathematics of Computation,” 2010, (dedicated to the memory of Leo Khachiyan). pp. 952-961. Book Chapter Coauthored Book Chapter in: “Computational Sensor Networks,” Thomas C. Henderson, Springer-Verlag, New York, NY, 2009.
Invited Talks & Presentations “Computational Complexity of Fixed Points” University of Warsaw, Poland, 9/2009 “Optimal Algorithms for Fixed Points” UKSW University, Warsaw, Poland, 9/2009 “Quasi- Monte Carlo, Monte Carlo, and regularized gradient optimization methods for source characterization of atmospheric releases” Schloss Dagstuhl - LeibnizZentrum fuer Informatik, Germany, Dagstuhl, 9/2009 “Uncertainty quantification and verification: the MGS Method” University of Utah, Department of Chemical Engineering, 3/2010. “Tools to Characterize the source of hazardous releases” National Conference on Advancing Tools and Solutions for Nuclear Material Detection, Salt Lake City, 2/2010 “Inverse source problems with QMC/MC methods “Dept. of Applied Mathematics and Statistics, University of Notre Dame, 5/ 2010 “ Hybrid Algorithms for Fixed Points” Dept. of Applied Mathematics and Statistics, University of Notre Dame, 5/ 2010 Efficient Adaption of Simulated Annealing and Genetic Algorithms to Atmospheric Inverse-Source Problems, jont with B. Addepalli, session: “Role of chemical engineering in nuclear forensics”, AIChE Annual Meeting, Salt Lake City, 11/2010
Professional Participation Chair: WG1.1 Group on Continuous Algorithms and Complexity/Foundations of Computer Science of the International Federation for Information Processing Discussion Session Chair: IFIP Group WG1.1, Dagstuhl, Germany 9/2009 Member: Scientific Program Committee, International Multiconference on Computer Science and Information Technology (IMCIST) organized by the Polish Information Processing Society in cooperation with the IEEE Computer Society (Poland Chapter), Council of European Professional Informatics Societies (CEPIS), the Systems Research Institute Polish Academy of Sciences, and the Institute of Computer Science Polish Academy of Sciences, Wisla, Poland, Oct. 2010 (www.imcsit.org).