Finite-Time <svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-4.3443pt" id="M1" height="15.7437pt" version="1.1" viewBox="-0.0657574 -11.3994 26.6531 15.7437" width="26.6531pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-73" d="M828 650H570L564 622C646 614 650 609 634 524L604 366H253L281 524C296 608 308 615 382 622L388 650H132L126 622C211 615 214 609 198 524L121 122C106 42 102 35 23 28L17 0H276L282 28C196 35 191 40 206 122L243 324H597L559 123C544 42 537 35 452 28L446 0H710L716 28C632 35 628 43 643 122L719 524C735 610 741 615 822 622L828 650Z"/></g><g transform="matrix(.012,0,0,-0.012,13.299,4.134)"><path id="g50-30" d="M1000 227C1000 351 905 451 780 451C658 451 590 380 530 279C465 385 388 451 261 451C168 451 38 376 38 210C38 98 121 -12 261 -12C381 -12 448 59 508 160C573 53 652 -12 780 -12C879 -12 1000 64 1000 227ZM485 199C434 109 370 25 271 25C188 25 133 117 133 241C133 355 189 414 249 414C357 414 426 302 485 199ZM903 204C903 70 852 25 790 25C681 25 611 136 552 240C603 330 669 414 768 414C855 414 903 321 903 204Z"/></g></svg> Filtering for Singular Stochastic Markovian Jump Systems with Time-Varying Delays

<div>The local optimal bound of <svg height="9.14241pt" id="M232" style="vertical-align:-3.1815pt" version="1.1" viewbox="-0.0498162 -5.96091 9.23472 9.14241" width="9.23472pt" 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="M383 397C383 424 344 448 299 448C244 448 172 409 132 375C66 319 23 227 23 146C23 42 74 -12 146 -12C208 -12 298 30 359 103L343 124C315 95 248 48 192 48C145 48 111 85 111 163C111 228 129 294 151 330C171 363 201 401 241 401C275 401 302 384 325 356C332 347 339 344 348 348C373 360 383 381 383 397Z" id="g113-100"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="406" vert-adv-y="406"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,4.173,3.132)"><path d="M414 144C384 79 371 75 317 75H135L276 221C367 316 408 376 408 465C408 570 327 635 237 635C179 635 131 609 100 575L42 494L67 471C94 510 138 565 205 565C277 565 321 517 321 435C321 348 258 270 195 195C146 137 88 81 33 26V0H411C423 44 433 88 446 135L414 144Z" id="g50-51"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="487" vert-adv-y="487"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig2

Figure 2

Figure 2: Finite-Time <svg xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://www.w3.org/2000/svg" style="vertical-align:-4.3443pt" id="M1" height="15.7437pt" version="1.1" viewBox="-0.0657574 -11.3994 26.6531 15.7437" width="26.6531pt"><g transform="matrix(.017,0,0,-0.017,0,0)"><path id="g113-73" d="M828 650H570L564 622C646 614 650 609 634 524L604 366H253L281 524C296 608 308 615 382 622L388 650H132L126 622C211 615 214 609 198 524L121 122C106 42 102 35 23 28L17 0H276L282 28C196 35 191 40 206 122L243 324H597L559 123C544 42 537 35 452 28L446 0H710L716 28C632 35 628 43 643 122L719 524C735 610 741 615 822 622L828 650Z"/></g><g transform="matrix(.012,0,0,-0.012,13.299,4.134)"><path id="g50-30" d="M1000 227C1000 351 905 451 780 451C658 451 590 380 530 279C465 385 388 451 261 451C168 451 38 376 38 210C38 98 121 -12 261 -12C381 -12 448 59 508 160C573 53 652 -12 780 -12C879 -12 1000 64 1000 227ZM485 199C434 109 370 25 271 25C188 25 133 117 133 241C133 355 189 414 249 414C357 414 426 302 485 199ZM903 204C903 70 852 25 790 25C681 25 611 136 552 240C603 330 669 414 768 414C855 414 903 321 903 204Z"/></g></svg> Filtering for Singular Stochastic Markovian Jump Systems with Time-Varying Delays 

Mathematical Problems in Engineering

Finite-Time Filtering for Singular Stochastic Markovian Jump Systems with Time-Varying Delays

Figure 2