Zobrazeno 1 - 10
of 2 144
pro vyhledávání: '"Saunders B"'
Autor:
Campbell P, Hill JC, Protheroe J, Afolabi EK, Lewis M, Beardmore R, Hay EM, Mallen CD, Bartlam B, Saunders B, van der Windt DA, Jowett S, Foster NE, Dunn KM
Publikováno v:
Journal of Pain Research, Vol Volume 9, Pp 807-818 (2016)
Paul Campbell,1 Jonathan C Hill,1 Joanne Protheroe,1 Ebenezer K Afolabi,1 Martyn Lewis,1 Ruth Beardmore,1 Elaine M Hay,1 Christian D Mallen,1 Bernadette Bartlam,1 Benjamin Saunders,1 Danielle A van der Windt,1 Sue Jowett,2 Nadine E Foster,1 Kate M Du
Externí odkaz:
https://doaj.org/article/737cc3efa899483094afa4487f02cb21
Publikováno v:
In Musculoskeletal Science and Practice August 2024 72
Autor:
Bateman, M., Skeggs, A., Whitby, E., Fletcher-Barrett, V., Stephens, G., Dawes, M., Davis, D., Beckhelling, J., Cooper, K., Saunders, B., Littlewood, C., Vicenzino, B., Foster, N.E., Hill, J.C.
Publikováno v:
In Musculoskeletal Science and Practice February 2024 69
One useful standard method to compute eigenvalues of matrix polynomials ${\bf P}(z) \in \mathbb{C}^{n\times n}[z]$ of degree at most $\ell$ in $z$ (denoted of grade $\ell$, for short) is to first transform ${\bf P}(z)$ to an equivalent linear matrix
Externí odkaz:
http://arxiv.org/abs/2102.09726
We determine the probability, structure dependent, that the block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for the probability, structure independent. We show, using block size slightly large
Externí odkaz:
http://arxiv.org/abs/1803.03864
Publikováno v:
In Musculoskeletal Science and Practice December 2022 62
Publikováno v:
In Journal of Symbolic Computation January-February 2022 108:98-116
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Physiotherapy September 2021 112:16-30
Blackbox algorithms for linear algebra problems start with projection of the sequence of powers of a matrix to a sequence of vectors (Lanczos), a sequence of scalars (Wiedemann) or a sequence of smaller matrices (block methods). Such algorithms usual
Externí odkaz:
http://arxiv.org/abs/1412.5071