Boundary Value Problems on Finite Networks

DOI10.1007/978-3-319-70953-6_5zbMath1404.15006OpenAlexW2795268541MaRDI QIDQ4557580

Ángeles Carmona

Publication date: 26 November 2018

Published in: Advanced Courses in Mathematics - CRM Barcelona (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-70953-6_5

zbMATH Keywords

inverse problem\(M\)-matrixminimum principlePoisson operatorfinite networkselfadjoint boundary value problemdiscrete vector calculus

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Inverse problems in linear algebra (15A29) Discrete potential theory (31C20) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)

Related Items (2)

Eigenvalues with respect to a weight for general boundary value problems on networks ⋮ Boundary Value Problem on a Weighted Graph Relevant to the Static Analysis of Truss Structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Overdetermined partial boundary value problems on finite networks
• The \(M\)-matrix inverse problem for singular and symmetric Jacobi matrices
• Shilla distance-regular graphs
• Generalized inverses of symmetric \(M\)-matrices
• Characterization of symmetric \(M\)-matrices as resistive inverses
• Circular planar graphs and resistor networks
• Some characterizations of symmetric inverse \(M\)-matrices
• Discrete Green's functions
• Description of the sub-Markov kernel associated to generalized ultrametric matrices. An algorithmic approach
• Generalized inverses. Theory and applications.
• Group inverses of \(M\)-matrices associated with nonnegative matrices having few eigenvalues
• Ultrametric matrices and induced Markov chains
• A combinatorial Laplacian with vertex weights
• Solving boundary value problems on networks using equilibrium measures
• A note on distance-regular graphs with a small number of vertices compared to the valency
• Potential theory for Schrödinger operators on finite networks
• Distance–regular graphs having theM-property
• The curl of a weighted network
• Inverse of Strictly Ultrametric Matrices are of Stieltjes Type
• Uniqueness in the inverse conductivity problem for nonsmooth conductivities in two dimensions
• Algebraic Potential Theory on Graphs
• The M-Matrix Group Generalized Inverse Problem for Weighted Trees
• Distance-Regular Graphs with Diameter Three
• Nonnegative Matrices whose Inverses are M-Matrices
• Group generalized inverses of M-matrices associated with periodic and nonperiodic jacobi matrices
• Resistor network approaches to electrical impedance tomography
• Minimizing Effective Resistance of a Graph

This page was built for publication: Boundary Value Problems on Finite Networks