Shahadat Hossain, Ph.D.

(Short Bio)

I am an associate professor of computer science in the Department of Mathematics and Computer Science, University of Lethbridge.

After receiving a B.Tech. in Textiles (first class second position in the graduating class) from the University of Dhaka, Bangladesh, I availed an opportunity to study computational optimization in the Department of Informatics, University of Bergen, Norway under Professor Trond Steihaug. I was awarded a University of Bergen Fellowship (Universitetsstipendiat) for my doctoral studies during which (1996) I was a visiting graduate student of Cornell CS department. Before coming to Lethbridge I was on the faculty of Math/CS department of the University of Northern British Columbia. I spent a part of my sabbatical leave (in 2006) at Humboldt University in Berlin, Germany. My academic ancestry can be traced back, starting at Forsythe Tree , all the way to Gottfried Wilhelm Leibniz at The Mathematics Genealogy Project.

Contact Information


Seminar in Optimization (Spring 2010)

 

Teaching (Spring 2010)

Research.

I am interested in numerical optimization (broadly interpreted) and its applications. Scientific problems that are large-scale and display``exploitable'' special properties such as sparsity and structural information such as symmetry are particularly intriguing. I find graph theory to be an important tool for exploiting the combinatorial structure inherent in many sub-problems in nonlinear and linear optimization. My current research is concerned with the design of efficient algorithms for sparse matrix problems:efficient determination of Jacobian and Hessian matrices, linear algebra of sparse matrices with special properties, and high-performance computing. 

Recent Publications.

Recent Talks (by invitation)

The CPR Method and Beyond, CMS/CSHPM Summer Meeting 2009, Memorial University of Newfoundland, St. John's,Newfoundland, June 6 - 8, 2009.

Pattern Graphs for Sparse Matrices, SIAM Conference on Optimization, Boston, USA , May 10 -- 13, 2008.

On Efficient Data Structures for Sparse Matrix Storage, Computing by the Numbers: Algorithms, Precision, and Complexity, Matheon Workshop 2006 in honor of the 60th birthday of Richard Brent, Weierstrass Institute for Applied Analysis and Stochastics, July 20 - 21, 2006, Berlin.

Software.

CsegGraph : Column Segment Graph Generator (To appear in International Journal of Computer Mathematics)2009.

(With Minhaz Zibran) M-Sched: A University Course Timetabler, The 7th International Conference on the Practice and Theory of Automated Timetabling, 2008.

Graduate Students.

 

[I am recruiting graduate students; write to me if you are interested in high performance computing, mathematical optimization, or numerical linear algebra and have a solid mathematical background.]

Undergraduate Research Assistants.

Ben Burnett, Jesse Dunn, Meru Brunn, Zhenshuan Zhang, Matt Voronoi, VivekTrivedi

 Research Funding

My research is mainly supported by NSERC Discovery Grant (DG) Individual and NSERC Collaborative Research and Development (CRD) Grant held jointly with Colleagues in the Department of Computing and Software at McMaster University and Sponsored by IBM (Canada).