计算层状混合矩阵的组合标准形式

IF 1.4 3区数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Optimization Methods & Software Pub Date : 1998-04-01 DOI:10.1080/10556789808805720

K. Murota, Mark Scharbrodt

{"title":"计算层状混合矩阵的组合标准形式","authors":"K. Murota, Mark Scharbrodt","doi":"10.1080/10556789808805720","DOIUrl":null,"url":null,"abstract":"This paper presents an improved algorithm for computing the Combinatorial Canonical Form (CCF) of a layered mixed matrix which consists of a numerical matrix Q and a generic matrix T. The CCF is the (combinatorially unique) finest block-triangular form obtained by the row operations on the Q-part, followed by permutations of rows and columns of the whole matrix. The main ingredient of the improvements is the introduction of two precalculation phases. Computational results are also reported.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"13 1","pages":"373-391"},"PeriodicalIF":1.4000,"publicationDate":"1998-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Computing the Combinatorial Canonical Form of a Layered Mixed Matrix\",\"authors\":\"K. Murota, Mark Scharbrodt\",\"doi\":\"10.1080/10556789808805720\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an improved algorithm for computing the Combinatorial Canonical Form (CCF) of a layered mixed matrix which consists of a numerical matrix Q and a generic matrix T. The CCF is the (combinatorially unique) finest block-triangular form obtained by the row operations on the Q-part, followed by permutations of rows and columns of the whole matrix. The main ingredient of the improvements is the introduction of two precalculation phases. Computational results are also reported.\",\"PeriodicalId\":54673,\"journal\":{\"name\":\"Optimization Methods & Software\",\"volume\":\"13 1\",\"pages\":\"373-391\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"1998-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Optimization Methods & Software\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1080/10556789808805720\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods & Software","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/10556789808805720","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种计算由数值矩阵Q和一般矩阵t组成的层状混合矩阵的组合标准形式(CCF)的改进算法，CCF是通过对Q部分进行行运算，然后对整个矩阵的行、列进行置换得到的(组合唯一的)最优块三角形式。改进的主要成分是引入了两个预计算阶段。并报道了计算结果。

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

查看原文本刊更多论文

Computing the Combinatorial Canonical Form of a Layered Mixed Matrix

This paper presents an improved algorithm for computing the Combinatorial Canonical Form (CCF) of a layered mixed matrix which consists of a numerical matrix Q and a generic matrix T. The CCF is the (combinatorially unique) finest block-triangular form obtained by the row operations on the Q-part, followed by permutations of rows and columns of the whole matrix. The main ingredient of the improvements is the introduction of two precalculation phases. Computational results are also reported.

求助全文

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

来源期刊

Optimization Methods & Software 工程技术-计算机：软件工程

CiteScore

4.50

自引率

0.00%

发文量

审稿时长

7 months

期刊介绍： Optimization Methods and Software publishes refereed papers on the latest developments in the theory and realization of optimization methods, with particular emphasis on the interface between software development and algorithm design. Topics include: Theory, implementation and performance evaluation of algorithms and computer codes for linear, nonlinear, discrete, stochastic optimization and optimal control. This includes in particular conic, semi-definite, mixed integer, network, non-smooth, multi-objective and global optimization by deterministic or nondeterministic algorithms. Algorithms and software for complementarity, variational inequalities and equilibrium problems, and also for solving inverse problems, systems of nonlinear equations and the numerical study of parameter dependent operators. Various aspects of efficient and user-friendly implementations: e.g. automatic differentiation, massively parallel optimization, distributed computing, on-line algorithms, error sensitivity and validity analysis, problem scaling, stopping criteria and symbolic numeric interfaces. Theoretical studies with clear potential for applications and successful applications of specially adapted optimization methods and software to fields like engineering, machine learning, data mining, economics, finance, biology, or medicine. These submissions should not consist solely of the straightforward use of standard optimization techniques.