Efficient Rotation Algorithms for Texture Evolution

Texture evolution is a vital component of many computational tools that link structure, properties and processes of polycrystalline materials. By definition, this evolution process involves the manipulation, via rotation, of points in orientation space. The computational requirements of the current...

Full description

Bibliographic Details
Main Author: Esty, Mark W.
Format: Others
Published: BYU ScholarsArchive 2009
Subjects:
MSD
Online Access:https://scholarsarchive.byu.edu/etd/1985
https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=2984&context=etd
id ndltd-BGMYU2-oai-scholarsarchive.byu.edu-etd-2984
record_format oai_dc
spelling ndltd-BGMYU2-oai-scholarsarchive.byu.edu-etd-29842021-09-01T05:01:40Z Efficient Rotation Algorithms for Texture Evolution Esty, Mark W. Texture evolution is a vital component of many computational tools that link structure, properties and processes of polycrystalline materials. By definition, this evolution process involves the manipulation, via rotation, of points in orientation space. The computational requirements of the current methods being used to rotate crystalline orientations are a significant limiting factor in the drive to merge the texture information of materials into the engineering design process. The goal of this research is to find and implement a practical rotation algorithm that can significantly decrease the computation time required to rotate macroscopic and microscopic crystallographic textures. Three possible algorithms are considered in an effort to improve the computational efficiency and speed of the rotation process. The first method, which will be referred to as the Gel'fand method, is based on a paper, [1], that suggests a practical application of some of Gel'fand's theories for rotations [2]. The second method, which will be known as the streamline method, is a variation on the Gel'fand method. The third method will be known as the principal orientation method. In this method, orientations in Fourier space are written as linear combinations of points on the convex surface of the microstructure hull to reduce the number of points that must be rotated during each step in the texture evolution process. This thesis will discuss each of these methods, their strengths and weaknesses, and the accuracy of the computational results obtained from their implementation. 2009-12-17T08:00:00Z text application/pdf https://scholarsarchive.byu.edu/etd/1985 https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=2984&context=etd http://lib.byu.edu/about/copyright/ Theses and Dissertations BYU ScholarsArchive microstructure sensitive design MSD texture rotations streamlines principal orientations microstructure hull Mechanical Engineering
collection NDLTD
format Others
sources NDLTD
topic microstructure sensitive design
MSD
texture
rotations
streamlines
principal orientations
microstructure hull
Mechanical Engineering
spellingShingle microstructure sensitive design
MSD
texture
rotations
streamlines
principal orientations
microstructure hull
Mechanical Engineering
Esty, Mark W.
Efficient Rotation Algorithms for Texture Evolution
description Texture evolution is a vital component of many computational tools that link structure, properties and processes of polycrystalline materials. By definition, this evolution process involves the manipulation, via rotation, of points in orientation space. The computational requirements of the current methods being used to rotate crystalline orientations are a significant limiting factor in the drive to merge the texture information of materials into the engineering design process. The goal of this research is to find and implement a practical rotation algorithm that can significantly decrease the computation time required to rotate macroscopic and microscopic crystallographic textures. Three possible algorithms are considered in an effort to improve the computational efficiency and speed of the rotation process. The first method, which will be referred to as the Gel'fand method, is based on a paper, [1], that suggests a practical application of some of Gel'fand's theories for rotations [2]. The second method, which will be known as the streamline method, is a variation on the Gel'fand method. The third method will be known as the principal orientation method. In this method, orientations in Fourier space are written as linear combinations of points on the convex surface of the microstructure hull to reduce the number of points that must be rotated during each step in the texture evolution process. This thesis will discuss each of these methods, their strengths and weaknesses, and the accuracy of the computational results obtained from their implementation.
author Esty, Mark W.
author_facet Esty, Mark W.
author_sort Esty, Mark W.
title Efficient Rotation Algorithms for Texture Evolution
title_short Efficient Rotation Algorithms for Texture Evolution
title_full Efficient Rotation Algorithms for Texture Evolution
title_fullStr Efficient Rotation Algorithms for Texture Evolution
title_full_unstemmed Efficient Rotation Algorithms for Texture Evolution
title_sort efficient rotation algorithms for texture evolution
publisher BYU ScholarsArchive
publishDate 2009
url https://scholarsarchive.byu.edu/etd/1985
https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=2984&context=etd
work_keys_str_mv AT estymarkw efficientrotationalgorithmsfortextureevolution
_version_ 1719473275733540864