{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/4601"},"canonical_url":"https://search.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/4601","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures","abstract":"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 such information when available. Using symmetry in the second derivative values of the components it is possible to detect the sparsity pattern of the Hessian via products of the Hessian matrix with specially chosen direction vectors. We use graph coloring methods and employ efficient sparse data structures to implement the sparsity pattern detection algorithms.","abstract_html":"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 such information when available. Using symmetry in the second derivative values of the components it is possible to detect the sparsity pattern of the Hessian via products of the Hessian matrix with specially chosen direction vectors. We use graph coloring methods and employ efficient sparse data structures to implement the sparsity pattern detection algorithms.","abstract_has_math":false,"creators":["Sultana, Marzia","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science","degree_name":null,"degree_level":"Masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Hossain, Shahadat"],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-11-19T05:21:24Z","subjects":["algorithmic differentiation tools","black-box gradient","direction vectors","graph coloring","greedy CPR algorithm","sparsity patterns"],"languages":["en_CA"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10133/4601","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/10133/4601","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F4601","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Hossain, Shahadat"]},{"key":"dc:creator","label":"Author","values":["Sultana, Marzia","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2016-09-09T15:58:24Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2016-09-09T15:58:24Z"]},{"key":"dc:date.issued","label":"Date","values":["2016"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics and Computer Science"]},{"key":"dc:publisher.faculty","label":"Dc Publisher Faculty","values":["Arts and Science"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["Thesis (University of Lethbridge. Faculty of Arts and Science)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["algorithmic differentiation tools","black-box gradient","direction vectors","graph coloring","greedy CPR algorithm","sparsity patterns"]},{"key":"dc:subject.proquest","label":"Dc Subject Proquest","values":["0405","0642"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_CA"]},{"key":"dc:rights.proquest","label":"Dc Rights Proquest","values":["Yes"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/4601"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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 such information when available. Using symmetry in the second derivative values of the components it is possible to detect the sparsity pattern of the Hessian via products of the Hessian matrix with specially chosen direction vectors. We use graph coloring methods and employ efficient sparse data structures to implement the sparsity pattern detection algorithms."]},{"key":"dc:embargo.terms","label":"Dc Embargo Terms","values":["No"]},{"key":"dc:title","label":"Title","values":["On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Hossain, Shahadat"],"dc:creator":["Sultana, Marzia","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2016-09-09T15:58:24Z"],"dc:date.available":["2016-09-09T15:58:24Z"],"dc:date.issued":["2016"],"dc:description.abstract":["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 such information when available. Using symmetry in the second derivative values of the components it is possible to detect the sparsity pattern of the Hessian via products of the Hessian matrix with specially chosen direction vectors. We use graph coloring methods and employ efficient sparse data structures to implement the sparsity pattern detection algorithms."],"dc:embargo.terms":["No"],"dc:identifier.uri":["https://hdl.handle.net/10133/4601"],"dc:language.iso":["en_CA"],"dc:publisher":["Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science"],"dc:publisher.department":["Department of Mathematics and Computer Science"],"dc:publisher.faculty":["Arts and Science"],"dc:relation.ispartofseries":["Thesis (University of Lethbridge. Faculty of Arts and Science)"],"dc:rights.proquest":["Yes"],"dc:subject":["algorithmic differentiation tools","black-box gradient","direction vectors","graph coloring","greedy CPR algorithm","sparsity patterns"],"dc:subject.proquest":["0405","0642"],"dc:title":["On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures"],"dc:type":["Thesis"],"others:access_status":["open.access"],"thesis:degree_level":["Masters"]},"updated_at":"2026-11-19T05:21:24Z"}