An Efficient Convolution Algorithm for the Non-Markovian Two-Node Cyclic Network

<div>The model with <span class="nowrap"><svg height="8.8423pt" id="M275" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 34.1394 8.8423" width="34.1394pt" 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="M962 650H795L470 145L347 650H176L170 622C268 613 275 606 244 503L190 322C150 188 132 126 118 91C102 50 80 33 18 28L12 0H245L251 28C175 35 170 48 174 93C177 128 191 180 220 284L292 542H294C331 392 383 150 409 4H432L774 555H776L714 137C700 40 694 34 612 28L606 0H868L874 28C793 34 784 37 797 137L849 533C859 612 863 616 956 622L962 650Z"></path></g><g transform="matrix(.013,0,0,-0.013,16.439,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,27.702,0)"><path d="M137 343C167 482 260 545 321 574C357 591 397 603 429 609L423 641C382 634 335 622 295 608C189 570 37 457 37 238C37 84 125 -12 242 -12C362 -12 447 89 447 209C447 311 374 393 267 393C247 393 226 386 204 376L137 343ZM227 337C318 337 361 256 361 173C361 105 336 22 258 22C176 22 126 120 126 240C126 266 127 291 132 310C155 323 189 337 227 337Z"></path></g></svg>,</span> <span class="nowrap"><svg height="8.8423pt" id="M276" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 32.2343 8.8423" width="32.2343pt" 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="M822 650H589L583 622C660 617 677 607 674 561C672 534 664 481 647 390L600 137H596L273 650H126L120 622C176 620 194 615 207 594C221 571 225 557 214 504L161 257C141 166 129 112 121 85C108 42 83 30 29 28L23 0H260L266 28C193 33 173 42 176 89C178 122 186 172 202 255L256 527H259L583 -8H612L690 390C708 481 720 535 728 558C744 603 756 619 816 622L822 650Z"></path></g><g transform="matrix(.013,0,0,-0.013,14.542,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,25.805,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z"></path></g></svg>,</span> <span class="nowrap"><svg height="8.8423pt" id="M277" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 29.7941 8.8423" width="29.7941pt" 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="M640 650H413L406 622L438 617C475 611 483 605 463 571C422 503 346 400 296 333C264 403 215 529 199 575C189 604 191 614 228 618L262 622L271 650H30L23 622C90 615 97 609 119 553L212 321C222 295 223 285 218 259L193 127C176 39 167 33 82 28L76 0H350L356 28C266 36 257 40 275 127L303 266C308 290 314 302 328 322C396 418 454 493 498 546C551 610 565 616 631 622L640 650Z"></path></g><g transform="matrix(.013,0,0,-0.013,12.113,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,23.376,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z"></path></g></svg>,</span> and <span class="nowrap"><svg height="11.7782pt" id="M278" style="vertical-align:-3.42938pt" version="1.1" viewbox="-0.0498162 -8.34882 37.5581 11.7782" width="37.5581pt" 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="M516 277C516 378 460 448 376 448C335 448 288 434 240 401C158 345 127 277 107 159C53 -161 38 -221 23 -247L28 -261C43 -260 95 -250 114 -226C122 -216 129 -199 146 -75C152 -29 157 0 164 31C182 9 206 -12 237 -12C267 -12 325 8 376 46C451 102 516 179 516 277ZM432 259C432 134 366 40 259 40C236 40 204 48 171 76L195 203C219 327 253 400 326 400C398 400 432 336 432 259Z"></path></g><g transform="matrix(.013,0,0,-0.013,10.642,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,21.905,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z"></path></g><g transform="matrix(.013,0,0,-0.013,28.145,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,31.109,0)"><path d="M249 635C141 635 70 555 70 471C70 401 114 353 179 316C143 294 106 267 90 252C68 231 45 202 45 157C45 50 130 -12 237 -12C322 -12 435 52 435 169C435 256 372 304 303 343C349 374 375 398 383 407C401 429 411 458 411 487C411 569 344 635 249 635ZM238 603C285 603 337 567 337 482C337 422 310 385 276 358C205 393 145 426 145 500C145 552 179 603 238 603ZM248 20C183 20 125 70 125 163C125 218 158 268 206 300C284 261 355 217 355 143C355 66 308 20 248 20Z"></path></g></svg>.</span></div>

Journal of Applied Mathematics

tab2

Table 2

Table 2: An Efficient Convolution Algorithm for the Non-Markovian Two-Node Cyclic Network 