The General Minimum Fill-In Problem (Q3802913)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4070667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The General Minimum Fill-In Problem |
scientific article; zbMATH DE number 4070667 |
Statements
The General Minimum Fill-In Problem (English)
0 references
1987
0 references
minimum fill-in problem
0 references
optimal ordering
0 references
sparse linear equations
0 references
separating set
0 references
tearing a graph
0 references
graph-theoretical elimination process
0 references
Gaussian elimination
0 references
system of linear equations
0 references
Initial Theorem
0 references
separation approach
0 references
load-flow calculation
0 references
0.8178606629371643
0 references
0.8121602535247803
0 references
0.8062509298324585
0 references
0.797368586063385
0 references
