On the theory of the elimination process

DOI10.1016/0022-247X(71)90234-4zbMath0233.90024OpenAlexW2040944815MaRDI QIDQ2551436

U. Bertele, Francesco Brioschi

Publication date: 1971

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(71)90234-4

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Computational methods of linear algebra, The General Minimum Fill-In Problem

Cites Work

• Unnamed Item
• A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming
• Contribution to nonserial dynamic programming
• A theorem in nonserial dynamic programming
• Triangulated graphs and the elimination process
• Optimal elimination for sparse symmetric systems as a graph problem.
• Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems