AGMonien/whitaker3_dual
2D finite element problem
Name 
whitaker3_dual 
Group 
AGMonien 
Matrix ID 
2425 
Num Rows

19,190 
Num Cols

19,190 
Nonzeros

57,162 
Pattern Entries

57,162 
Kind

2D/3D Problem 
Symmetric

Yes 
Date

1998 
Author

R. Diekmann, R. Preis 
Editor

R. Diekmann, R. Preis 
Structural Rank 
19,190 
Structural Rank Full 
true 
Num Dmperm Blocks

1 
Strongly Connect Components

1 
Num Explicit Zeros

0 
Pattern Symmetry

100% 
Numeric Symmetry

100% 
Cholesky Candidate

no 
Positive Definite

no 
Type

binary 
SVD Statistics 
Matrix Norm 
2.999169e+00 
Minimum Singular Value 
3.108109e17 
Condition Number 
9.649500e+16

Rank 
19,163 
sprank(A)rank(A) 
27 
Null Space Dimension 
27 
Full Numerical Rank? 
no 
Download Singular Values 
MATLAB

Download 
MATLAB
Rutherford Boeing
Matrix Market

Notes 
AGMonien Graph Collection, Ralf Diekmann and Robert Preis
http://www2.cs.unipaderborn.de/fachbereich/AG/monien/RESEARCH/PART/graphs.html
A collection of test graphs from various sources. Many of the graphs
include XY or XYZ coordinates. This set also includes some graphs from
the HarwellBoeing collection, the NASA matrices, and some random matrices
which are not included here in the AGMonien/ group of the UF Collection.
In addition, two graphs already appear in other groups:
AGMonien/big : same as Nasa/barth5, Pothen/barth5 (not included here)
AGMonien/cage_3_11 : same as Pajek/GD98_c (included here)
The AGMonien/GRID subset is not included. It contains square grids that
are already wellrepresented in the UF Collection.
Six of the problem sets are included as sequences, each sequence being
a single problem instance in the UF Collection:
bfly: 10 butterfly graphs 3..12
cage: 45 cage graphs 3..12
cca: 10 cubeconnected cycle graphs, no wrap
ccc: 10 cubeconnected cycle graphs, with wrap
debr: 18 De Bruijn graphs
se: 13 shuffleexchange graphs
Problem.aux.G{:} are the graphs in these 6 sequences. Problem.aux.Gname{:}
are the original names of each graph, and Problemm.aux.Gcoord{:} are the
xy or xyz coordinates of each node, if present.
