Zobrazeno 1 - 10
of 52 887
pro vyhledávání: '"ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION"'
Autor:
Kay Jin Lim
Publikováno v:
Journal of Algebra. 628:98-162
The article focuses on four aspects related to the descent algebras of type $A$. They are modular idempotents, higher Lie powers, higher Lie modules and the right ideals of the symmetric group algebras generated by the Solomon's descent elements. Mor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::401365ab8f058897e9f0562b5891357f
https://doi.org/10.1016/j.jalgebra.2023.03.011
https://doi.org/10.1016/j.jalgebra.2023.03.011
Publikováno v:
SIAM Journal on Matrix Analysis and Applications. 44:670-692
We describe a Lanczos-based algorithm for approximating the product of a rational matrix function with a vector. This algorithm, which we call the Lanczos method for optimal rational matrix function approximation (Lanczos-OR), returns the optimal app
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4deab72fe0836686d0eee5f3106d4f2
https://doi.org/10.1137/22m1479853
https://doi.org/10.1137/22m1479853
Publikováno v:
Journal of Symbolic Computation. 116:146-182
A Las Vegas randomized algorithm is given to compute the Smith multipliers for a nonsingular integer matrix $A$, that is, unimodular matrices $U$ and $V$ such that $AV=US$, with $S$ the Smith normal form of $A$. The expected running time of the algor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db31b86da3a0544782d89a8b225bbb6d
https://doi.org/10.1016/j.jsc.2022.09.002
https://doi.org/10.1016/j.jsc.2022.09.002
Publikováno v:
Annali di Matematica Pura ed Applicata, 202(2), 967-991. Springer
The Maximum Likelihood Decoding Problem (MLD) is known to be NP-hard and its complexity is strictly related to the security of some post-quantum cryptosystems, that is, the so-called code-based primitives. Analogously, the Multivariate Quadratic Syst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa2cde4c7e14159e8bd281f5c7c86da8
http://www.scopus.com/inward/record.url?scp=85138144930&partnerID=8YFLogxK
http://www.scopus.com/inward/record.url?scp=85138144930&partnerID=8YFLogxK
Publikováno v:
Miruna-Stefana Sorea
A colored Gaussian graphical model is a linear concentration model in which equalities among the concentrations are specified by a coloring of an underlying graph. The model is called RCOP if this coloring is given by the edge and vertex orbits of a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e46a6923b991de6c3be2f854bc6862f1
https://doi.org/10.1137/21m1466943
https://doi.org/10.1137/21m1466943
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2023, ⟨10.1016/j.jsc.2022.08.014⟩
Journal of Symbolic Computation, 2023, ⟨10.1016/j.jsc.2022.08.014⟩
International audience; An interpolation problem is defined by a set of linear forms on the (multivariate) polynomial ring and values to be achieved by an interpolant. For Lagrange interpolation the linear forms consist of evaluations at some nodes,w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80ec7f28314e29a3e529eebbcd8b7067
https://doi.org/10.1016/j.jsc.2022.08.014
https://doi.org/10.1016/j.jsc.2022.08.014
Publikováno v:
IEEE Transactions on Automatic Control
IEEE Transactions on Automatic Control, In press, ⟨10.1109/tac.2022.3168487⟩
IEEE Transactions on Automatic Control, In press, ⟨10.1109/tac.2022.3168487⟩
International audience; Razumikhin-like theorems on hyperexponential and fixed-time stability of time-delay systems are proposed for both explicitly and implicitly defined Lyapunov functions. While the former method is useful for stability analysis,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::89bd41220c9895ec40cf677146d24724
https://doi.org/10.1109/tac.2022.3168487
https://doi.org/10.1109/tac.2022.3168487
Publikováno v:
Compositio Mathematica. 159:530-589
One fundamental consequence of a scheme $X$ being proper is that the functor classifying maps from $X$ to any other suitably nice scheme or algebraic stack is representable by an algebraic stack. This result has been generalized by replacing $X$ with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::30c7c165f1334b17673752381d0bb46e
https://doi.org/10.1112/s0010437x22007667
https://doi.org/10.1112/s0010437x22007667
Autor:
Magron, Victor, Wang, Jie
Publikováno v:
Journal of Symbolic Computation
Journal of Symbolic Computation, 2023, 115, pp.346-370. ⟨10.1016/j.jsc.2022.08.002⟩
Journal of Symbolic Computation, Elsevier, In press
Journal of Symbolic Computation, 2023, 115, pp.346-370. ⟨10.1016/j.jsc.2022.08.002⟩
Journal of Symbolic Computation, Elsevier, In press
The second-order cone (SOC) is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a represe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b56444b9a2413bb075b4185398f952ec
https://doi.org/10.1016/j.jsc.2022.08.002
https://doi.org/10.1016/j.jsc.2022.08.002
Publikováno v:
SIAM Journal on Numerical Analysis. 61:194-222
A rank-adaptive integrator for the approximate solution of high-order tensor differential equations by tree tensor networks is proposed and analyzed. In a recursion from the leaves to the root, the integrator updates bases and then evolves connection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::714bd6a58b0725a0607f59e60b8ba185
https://doi.org/10.1137/22m1473790
https://doi.org/10.1137/22m1473790