Institutional Repository

Browsing by Author "Hossain, Shahadat"

DSpace/Manakin Repository

Browsing by Author "Hossain, Shahadat"

Sort by: Order: Results:

  • Saha, Anik; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer ScienceArts and ScienceDepartment of Mathematics and Computer Science, 2015)
    Efficient estimation of large sparse Jacobian matrices is a requisite in many large-scale scientific and engineering problems. It is known that estimation of non-zeroes of a matrix can be viewed as a graph coloring problem. ...
  • Haque, Sardar Anisul; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008Arts and ScienceMathematics and Computer Science, 2008)
    The efficiency of linear algebra operations for sparse matrices on modern high performance computing system is often constrained by the available memory bandwidth. We are interested in sparse matrices whose sparsity ...
  • Zulkarnine, Ahmed Tahsin (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2012Arts and ScienceDepartment of Mathematics and Computer Science, 2012)
    One of the main objectives of software development in scientific computing is efficiency. Being focused on highly specialized application domain, important software quality metrics, e.g., usability, extensibility ,etc ...
  • Quashem, Rumana; University of Lethbridge, Faculty of Arts and Science (Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer ScienceArts and ScienceDepartment of Mathematics and Computer Science, 2015)
    The Design Structure Matrix model has facilitated the study of design structure and architectural complexity of complex systems by analyzing dependencies between system’s elements. There exists examples and applications ...
  • Hasan, Mahmudul (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2011Arts and ScienceDepartment of Mathematics and Computer Science, 2011)
    DSJM is a software toolkit written in portable C++ that enables direct determination of sparse Jacobian matrices whose sparsity pattern is a priori known. Using the seed matrix S 2 Rn×p, the Jacobian A 2 Rm×n can be ...
  • Goyal, Mini; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2005Arts and ScienceDepartment of Mathematics and Computer Science, 2005)
    There has been extensive research activities in the last couple of years to efficiently determine large sparse Jacobian matrices. It is now well known that the estimation of Jacobian matrices can be posed as a graph coloring ...
  • Zibran, Minhaz Fahim; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007Faculty of Arts and ScienceDepartment of Mathematics and Computer Science, 2007)
    Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be ...
  • Sultana, Marzia; University of Lethbridge. Faculty of Arts and Science. (Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer ScienceArts and ScienceDepartment of Mathematics and Computer Science, 2016)
    Evaluation of the Hessian matrix of a scalar function is a subproblem in many numerical optimization algorithms. For large-scale problems often the Hessian matrix is sparse and structured, and it is preferable to exploit ...
  • Bhattacharjee, Sangita; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, 2010Arts and ScienceDepartment of Mathematics and Computer Science, 2010)
    In this thesis, we study a variant of the maximum cardinality matching problem known as the maximum charge problem. Given a graph with arbitrary positive integer capacities assigned on every vertex and every edge, the ...
  • Khan, Soma Farin (Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer ScienceArts and ScienceDepartment of Mathematics and Computer Science, 2015)
    In this thesis we explore the centrality rankings of functions in call graphs of scientific software using spectral method. Dependency Structure Matrix (DSM) is used as a modeling tool to represent and examine pattern ...