Maximizing the algebraic connectivity of meshed electrical pathways used as current return network

DOI10.1016/J.MATCOM.2018.05.002MaRDI QIDQ1997383zbMATH OpenOpenAlexWikidataFDO

Authors Etienne Goddet, Nicolas Retière, Vojislav Stojanović, Anca Dieudonné, Jérôme Genoulaz, Jean-Michel Guichon

Publication date 2 March 2021

Published in Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.matcom.2018.05.002

zbMATH Keywords

optimizationgraph theoryspectral analysisalgebraic connectivitycurrent return networks

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites work

• scientific article; zbMATH DE number 878889 (Why is no real title available?)
• A trust region method based on interior point techniques for nonlinear programming.
• Algorithm 875
• Complex networks: structure and dynamics
• Convex optimization of graph Laplacian eigenvalues
• Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory
• Eigenvectors of random graphs: nodal domains
• Energy transmission and synchronization in complex networks. Mathematical principles
• Linear Matrix Inequalities in System and Control Theory
• Multi-Terminal Network Flows
• Oscillations of networks: the role of soft nodes
• Stability and Continuity of Centrality Measures in Weighted Graphs
• The power grid as a complex network: a survey

Describes a project that uses

Uses Software

• DSDP5

This page was built for publication: Maximizing the algebraic connectivity of meshed electrical pathways used as current return network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997383)