1984
DOI: 10.1002/aic.690300412
|View full text |Cite
|
Sign up to set email alerts
|

Structural analysis and solution of systems of algebraic design equations

Abstract: A new method for expressing the structure of a system of equations is developed using a type of occurrence matrix entitled the functionality matrix. The functionality matrix indicates not only the Occurrence of variables in equations but also the functional form in which they occur. Since the difficulty of solving an equation for a variable is related to its functional form, analysis of the functionality matrix provides explicit information on the difficulty of solution of the equation.A methodology for the so… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
8
0

Year Published

1987
1987
1999
1999

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 15 publications
0
8
0
Order By: Relevance
“…Several authors have recognized that by specifying different sets for the decision variables, nonlinear sets of different numerical difficulty will occur. The pioneering work of Lee et al for the selection of design variables, using bipartite graph structuring, works very well if an acyclic information structure can be obtained but fails otherwise. , Rudd and Watson 18 present this algorithm in a more familiar form of an occurrence matrix manipulation. Book and Ramirez 23 developed an algorithm, which produces the entire solution set for the decision variables, but only for systems which may be described by an acyclic information structure.…”
Section: Previous Work On the Choice Of Decision Variablesmentioning
confidence: 99%
See 4 more Smart Citations
“…Several authors have recognized that by specifying different sets for the decision variables, nonlinear sets of different numerical difficulty will occur. The pioneering work of Lee et al for the selection of design variables, using bipartite graph structuring, works very well if an acyclic information structure can be obtained but fails otherwise. , Rudd and Watson 18 present this algorithm in a more familiar form of an occurrence matrix manipulation. Book and Ramirez 23 developed an algorithm, which produces the entire solution set for the decision variables, but only for systems which may be described by an acyclic information structure.…”
Section: Previous Work On the Choice Of Decision Variablesmentioning
confidence: 99%
“…In practice, the algorithm is applied in a series of steps, where the designer guesses a structurally valid decision variable set, obtains the solution path, and guesses another set of decision variables if the output subsystems are singular or nearly singular. Thus, this algorithm has the merit of avoiding solution paths, which may be either indeterminate or very ill-conditioned, but on a single pass produces a unique combination of decision and output/tearing variables …”
Section: Previous Work On the Choice Of Decision Variablesmentioning
confidence: 99%
See 3 more Smart Citations