Rational gram - schmidt搜索vs.计算

2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2019-09-01 DOI:10.1109/SYNASC49474.2019.00015

Aaron E. Naiman

{"title":"Rational gram - schmidt搜索vs.计算","authors":"Aaron E. Naiman","doi":"10.1109/SYNASC49474.2019.00015","DOIUrl":null,"url":null,"abstract":"We discuss building square, integer matrices, such that the Gram–Schmidt process leads to rational orthonormal matrices. We show some interesting properties that arise while searching for integer entries, as well as a process for doing this by direct computation.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rational Gram-Schmidt-Searching vs. Computing\",\"authors\":\"Aaron E. Naiman\",\"doi\":\"10.1109/SYNASC49474.2019.00015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We discuss building square, integer matrices, such that the Gram–Schmidt process leads to rational orthonormal matrices. We show some interesting properties that arise while searching for integer entries, as well as a process for doing this by direct computation.\",\"PeriodicalId\":102054,\"journal\":{\"name\":\"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC49474.2019.00015\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC49474.2019.00015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们讨论建立方形，整数矩阵，使Gram-Schmidt过程导致有理标准正交矩阵。我们展示了在搜索整数项时出现的一些有趣的属性，以及通过直接计算完成此操作的过程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Rational Gram-Schmidt-Searching vs. Computing

We discuss building square, integer matrices, such that the Gram–Schmidt process leads to rational orthonormal matrices. We show some interesting properties that arise while searching for integer entries, as well as a process for doing this by direct computation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

自引率

0.00%

发文量