Franklin

An Introduction to Grids, Graphs, and Networks.

Author/Creator:
Pozrikidis, C.
Publication:
New York : Oxford University Press, Incorporated, 2014.
Format/Description:
Book
1 online resource (299 pages)
Status/Location:
Loading...

Options
Location Notes Your Loan Policy

Details

Other records:
Subjects:
Graph theory.
Differential equations, Partial -- Numerical solutions.
Finite differences.
Form/Genre:
Electronic books.
Summary:
A concise introduction to graphs and networks, presenting theoretical concepts at a level accessible to both professionals and students.
Contents:
Cover
CONTENTS
PREFACE
ONE-DIMENSIONAL GRIDS
1.1 POISSON EQUATION IN ONE DIMENSION
1.2 DIRICHLET BOUNDARY CONDITION AT BOTH ENDS
1.3 NEUMANN-DIRICHLET BOUNDARY CONDITIONS
1.4 DIRICHLET-NEUMANN BOUNDARY CONDITIONS
1.5 NEUMANN BOUNDARY CONDITIONS
1.6 PERIODIC BOUNDARY CONDITIONS
1.7 ONE-DIMENSIONAL GRAPHS
1.7.1 Graph Laplacian
1.7.2 Adjacency Matrix
1.7.3 Connectivity Lists and Oriented Incidence Matrix
1.8 PERIODIC ONE-DIMENSIONAL GRAPHS
1.8.1 Periodic Adjacency Matrix
1.8.2 Periodic Oriented Incidence Matrix
1.8.3 Fourier Expansions
1.8.4 Cosine Fourier Expansion
1.8.5 Sine Fourier Expansion
GRAPHS AND NETWORKS
2.1 ELEMENTS OF GRAPH THEORY
2.1.1 Adjacency Matrix
2.1.2 Node Degrees
2.1.3 The Complete Graph
2.1.4 Complement of a Graph
2.1.5 Connectivity Lists and the Oriented Incidence Matrix
2.1.6 Connected and Unconnected Graphs
2.1.7 Pairwise Distance and Diameter
2.1.8 Trees
2.1.9 Random and Real-Life Networks
2.2 LAPLACIAN MATRIX
2.2.1 Properties of the Laplacian Matrix
2.2.2 Complete Graph
2.2.3 Estimates of Eigenvalues
2.2.4 Spanning Trees
2.2.5 Spectral Expansion
2.2.6 Spectral Partitioning
2.2.7 Complement of a Graph
2.2.8 Normalized Laplacian
2.2.9 Graph Breakup
2.3 CUBIC NETWORK
2.4 FABRICATED NETWORKS
2.4.1 Finite-Element Network on a Disk
2.4.2 Finite-Element Network on a Square
2.4.3 Delaunay Triangulation of an Arbitrary Set of Nodes
2.4.4 Delaunay Triangulation of a Perturbed Cartesian Grid
2.4.5 Finite Element Network Descending from an Octahedron
2.4.6 Finite Element Network Descending from an Icosahedron
2.5 LINK REMOVAL AND ADDITION
2.5.1 Single and Multiple Link
2.5.2 Link Addition
2.6 INFINITE LATTICES
2.6.1 Bravais Lattices
2.6.2 Archimedean Lattices.
2.6.3 Laves Lattices
2.6.4 Other Two-Dimensional Lattices
2.6.5 Cubic Lattices
2.7 PERCOLATION THRESHOLDS
2.7.1 Link (Bond) Percolation Threshold
2.7.2 Node Percolation Threshold
2.7.3 Computation of Percolation Thresholds
SPECTRA OF LATTICES
3.1 SQUARE LATTICE
3.1.1 Isolated Network
3.1.2 Periodic Strip
3.1.3 Doubly Periodic Network
3.1.4 Doubly Periodic Sheared Network
3.2 MÖBIUS STRIPS
3.2.1 Horizontal Strip
3.2.2 Vertical Strip
3.2.3 Klein Bottle
3.3 HEXAGONAL LATTICE
3.3.1 Isolated Network
3.3.2 Doubly Periodic Network
3.3.3 Alternative Node Indexing
3.4 MODIFIED UNION JACK LATTICE
3.4.1 Isolated Network
3.4.2 Doubly Periodic Network
3.5 HONEYCOMB LATTICE
3.5.1 Isolated Network
3.5.2 Brick Representation
3.5.3 Doubly Periodic Network
3.5.4 Alternative Node Indexing
3.6 KAGOMÉ LATTICE
3.6.1 Isolated Network
3.6.2 Doubly Periodic Network
3.7 SIMPLE CUBIC LATTICE
3.8 BODY-CENTERED CUBIC (BCC) LATTICE
3.9 FACE-CENTERED CUBIC (FCC) LATTICE
NETWORK TRANSPORT
4.1 TRANSPORT LAWS AND CONVENTIONS
4.1.1 Isolated and Embedded Networks
4.1.2 Nodal Sources
4.1.3 Linear Transport
4.1.4 Nonlinear Transport
4.2 UNIFORM CONDUCTANCES
4.2.1 Isolated Networks
4.2.2 Embedded Networks
4.3 ARBITRARY CONDUCTANCES
4.3.1 Scaled Conductance Matrix
4.3.2 Weighed Adjacency Matrix
4.3.3 Weighed Node Degrees
4.3.4 Kirchhoff Matrix
4.3.5 Weighed Oriented Incidence Matrix
4.3.6 Properties of the Kirchhoff Matrix
4.3.7 Normalized Kirchhoff Matrix
4.3.8 Summary of Notation
4.4 NODAL BALANCES IN ARBITRARY NETWORKS
4.4.1 Isolated Networks
4.4.2 Embedded Networks and the Modified Kirchhoff Matrix
4.4.3 Properties of the Modified Kirchhoff Matrix
4.5 LATTICES
4.5.1 Square Lattice
4.5.2 Möbius Strip.
4.5.3 Hexagonal Lattice
4.5.4 Modified Union Jack Lattice
4.5.5 Simple Cubic Lattice
4.6 FINITE DIFFERENCE GRIDS
4.7 FINITE ELEMENT GRIDS
4.7.1 One-Dimensional Grid
4.7.2 Two-Dimensional Grid
GREEN'S FUNCTIONS
5.1 EMBEDDED NETWORKS
5.1.1 Green's Function Matrix
5.1.2 Normalized Green's Function
5.2 ISOLATED NETWORKS
5.2.1 Moore-Penrose Green's Function
5.2.2 Spectral Expansion
5.2.3 Normalized Moore-Penrose Green's Function
5.2.4 One-Dimensional Network
5.2.5 Periodic One-Dimensional Network
5.2.6 Free-Space Green's Function in One Dimension
5.2.7 Complete Network
5.2.8 Discontiguous Networks
5.3 LATTICE GREEN'S FUNCTIONS
5.3.1 Periodic Green's Functions
5.3.2 Free-Space Green's Functions
5.4 SQUARE LATTICE
5.4.1 Periodic Green's Function
5.4.2 Free-Space Green's Function
5.4.3 Helmholtz Equation Green's Function
5.4.4 Kirchhoff Green's Function
5.5 HEXAGONAL LATTICE
5.5.1 Periodic Green's Function
5.5.2 Free-Space Green's Function
5.6 MODIFIED UNION JACK LATTICE
5.6.1 Periodic Green's Function
5.6.2 Free-Space Green's Function
5.7 HONEYCOMB LATTICE
5.7.1 Periodic Green's Function
5.7.2 Free-Space Green's Function
5.8 SIMPLE CUBIC LATTICE
5.8.1 Periodic Green's Function
5.8.2 Free-Space Green's Function
5.9 BODY-CENTERED CUBIC (BCC) LATTICE
5.10 FACE-CENTERED CUBIC (FCC) LATTICE
5.11 FREE-SPACE LATTICE GREEN'S FUNCTIONS
5.11.1 Probability Lattice Green's Function
5.12 FINITE DIFFERENCE SOLUTION IN TERMS OF GREEN'S FUNCTIONS
NETWORK PERFORMANCE
6.1 PAIRWISE RESISTANCE
6.1.1 Embedded Networks
6.1.2 Isolated Networks
6.1.3 One-Dimensional Network
6.1.4 One-Dimensional Periodic Network
6.1.5 Infinite Lattices
6.1.6 Triangle Inequality
6.1.7 Random Walks
6.2 MEAN PAIRWISE RESISTANCE.
6.2.1 Spectral Representation
6.2.2 Complete Network
6.2.3 One-Dimensional Isolated Network
6.2.4 One-Dimensional Periodic Network
6.2.5 Periodic Lattice Patches
6.3 DAMAGED NETWORKS
6.3.1 Damaged Kirchhoff Matrix
6.3.2 Embedded Networks
6.3.3 One Damaged Link
6.3.4 Clipped Links
6.3.5 Isolated Networks
6.4 REINFORCED NETWORKS
6.5 DAMAGED LATTICES
6.5.1 One Damaged Link
6.5.2 Effective-Medium Theory
6.5.3 Percolation Threshold
6.6 DAMAGED SQUARE LATTICE
6.7 DAMAGED HONEYCOMB LATTICE
6.8 DAMAGED HEXAGONAL LATTICE
6.8.1 Longitudinal Transport
6.8.2 Lateral Transport
EIGENVALUES OF MATRICES
A.1 EIGENVALUES AND EIGENVECTORS
A.2 THE CHARACTERISTIC POLYNOMIAL
A.2.1 Eigenvalues, Trace, and the Determinant
A.2.2 Powers, Inverse, and Functions of a Matrix
A.2.3 Hermitian Matrices
A.2.4 Diagonal Matrix of Eigenvalues
A.3 EIGENVECTORS AND PRINCIPAL VECTORS
A.3.1 Properties of Eigenvectors
A.3.2 Left Eigenvectors
A.3.3 Matrix of Eigenvectors
A.3.4 Eigenvalues and Eigenvectors of the Adjoint
A.3.5 Eigenvalues of Positive Definite Hermitian Matrices
A.4 CIRCULANT MATRICES
A.5 BLOCK CIRCULANT MATRICES
THE SHERMAN-MORRISON AND WOODBURY FORMULAS
B.1 THE WOODBURY FORMULA
B.2 THE SHERMAN-MORRISON FORMULA
REFERENCES
INDEX.
Notes:
Description based on publisher supplied metadata and other sources.
Local notes:
Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2021. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.
Other format:
Print version: Pozrikidis, C. An Introduction to Grids, Graphs, and Networks
ISBN:
9780199996735
9780199996728
OCLC:
870588975