<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Shahid Beheshti University</PublisherName>
				<JournalTitle>Computational Mathematics and Computer Modeling with Applications (CMCMA)</JournalTitle>
				<Issn>2783-4859</Issn>
				<Volume>1</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Tensor LU and QR decompositions and their randomized algorithms</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>16</LastPage>
			<ELocationID EIdType="pii">101978</ELocationID>
			
<ELocationID EIdType="doi">10.52547/CMCMA.1.1.1</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Yuefeng</FirstName>
					<LastName>Zhu</LastName>
<Affiliation>School of Mathematical Sciences, Fudan University, Shanghai, P.R. China</Affiliation>

</Author>
<Author>
					<FirstName>Yimin</FirstName>
					<LastName>Wei</LastName>
<Affiliation>School of Mathematical Sciences and Shanghai Key Laboratory of Contemporary Applied Mathematics, Fudan University, Shanghai, PR China</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>12</Month>
					<Day>10</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, we propose two decompositions extended from matrices to tensors, including LU and QR decompositions with their rank-revealing  and  randomized variations. We give the growth order analysis of error of the tensor QR (t-QR) and tensor LU (t-LU) decompositions. Growth order of error and running time are shown by numerical  examples. We test our methods by compressing and analyzing the image-based data, showing that the performance of tensor randomized QR decomposition is better than the tensor randomized SVD (t-rSVD) in terms of the accuracy, running time and memory.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">LU decomposition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">QR decomposition</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">rank-revealing algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">randomized algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">tensor T-product</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">low-rank approximation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cmcma.sbu.ac.ir/article_101978_439808673027f89a058c53eb908c4262.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
