Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability

<div>The sparsity pattern of matrix <svg height="13.8595pt" id="M220" style="vertical-align:-2.2681pt" version="1.1" viewbox="-0.0498162 -11.5914 55.3494 13.8595" width="55.3494pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z" id="g113-41"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,4.498,0)"><path d="M338 0V35C263 42 255 49 255 133V516C255 602 263 608 338 615V650H37V615C112 608 121 602 121 516V133C121 49 112 42 37 35V0H338Z" id="g13-71"></path><glyph.data ascent="1024" descent="-360" horiz-adv-x="378" vert-adv-y="378"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,12.318,0)"><path d="M535 230V280H52V230H535Z" id="g117-33"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="587" vert-adv-y="587"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,22.854,0)"><path d="M945 691C922 698 906 699 898 699C835 699 774 658 715 605C668 562 627 504 584 440C540 483 482 508 423 508C316 508 202 428 202 306C202 214 258 145 333 98C290 58 245 34 202 34C173 34 150 46 141 65V66C181 73 204 102 204 131C204 166 178 201 134 201C87 201 50 161 50 110C50 35 109 -21 201 -21C274 -21 335 14 388 70C433 51 480 41 523 41L505 0H652L670 45C709 53 762 68 797 95L776 138C747 122 728 114 696 105C792 332 862 493 955 674L945 691ZM809 610C756 523 700 420 651 316H649C644 345 634 371 619 395C697 516 743 569 807 612L809 610ZM596 222C596 215 597 202 594 193C582 165 568 135 549 96C509 96 470 104 432 119C506 206 538 265 578 329C589 298 596 265 596 222ZM547 384C496 300 445 219 381 147C329 183 293 238 293 313C293 396 357 448 421 448C462 448 511 429 547 384Z" id="g199-2"></path><glyph.data ascent="699" descent="-224" horiz-adv-x="984" vert-adv-y="984"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,35.646,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z" id="g113-117"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="341" vert-adv-y="341"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,40.079,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z" id="g113-42"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,44.577,-5.741)"><path d="M556 236V289H56V236H556Z" id="g54-33"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="611" vert-adv-y="611"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,50.137,-5.741)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z" id="g50-50"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig8

Figure 8

Figure 8: Algorithm for Identifying Minimum Driver Nodes Based on Structural Controllability 