Title	Approximate GCRDs of Quaternion Polynomials
Creator	Zhang, Yang
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-11-04T11:00
Description	The study of quaternions, quaternion polynomials and quaternion matrices has a long history back to 1940's, and has recently gained more and more interest in many areas such as quantum mechanics and signal processing. In this talk, we discuss the computing approximate greatest common right divisors of quaternion polynomials. We explore some properties of Sylvester matrices in quaternion case. The difficult thing is that there are no ``good" definitions of the determinate for matrices over division rings. Base on the singular value decomposition for quaternion matrices, we present algorithms to compute approximate GCRDs for quaternion polynomials.
Extent	39 minutes
Subject	Mathematics; Approximations and expansions; Commutative rings and algebras; Classical analysis
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Univesity of Manitoba
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-06
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348100
URI	http://hdl.handle.net/2429/61836
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos