Truncated Errors of the Operator Matrix Mpdx

Author(s):  
Tiberiu Colosi ◽  
Mihail-Ioan Abrudean ◽  
Mihaela-Ligia Unguresan ◽  
Vlad Muresan
Keyword(s):  
Filomat ◽  
2017 ◽  
Vol 31 (16) ◽  
pp. 5169-5175 ◽  
Author(s):  
H.H.G. Hashem

In this paper, we study the existence of solutions for a system of quadratic integral equations of Chandrasekhar type by applying fixed point theorem of a 2 x 2 block operator matrix defined on a nonempty bounded closed convex subsets of Banach algebras where the entries are nonlinear operators.


2005 ◽  
Vol 15 (05n06) ◽  
pp. 1261-1272 ◽  
Author(s):  
WOLFGANG WOESS

Let L≀X be a lamplighter graph, i.e., the graph-analogue of a wreath product of groups, and let P be the transition operator (matrix) of a random walk on that structure. We explain how methods developed by Saloff-Coste and the author can be applied for determining the ℓp-norms and spectral radii of P, if one has an amenable (not necessarily discrete or unimodular) locally compact group of isometries that acts transitively on L. This applies, in particular, to wreath products K≀G of finitely-generated groups, where K is amenable. As a special case, this comprises a result of Żuk regarding the ℓ2-spectral radius of symmetric random walks on such groups.


2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Ze Long Liu ◽  
Bianka Mecaj ◽  
Matthias Neubert ◽  
Xing Wang

Abstract Building on the recent derivation of a bare factorization theorem for the b-quark induced contribution to the h → γγ decay amplitude based on soft-collinear effective theory, we derive the first renormalized factorization theorem for a process described at subleading power in scale ratios, where λ = mb/Mh « 1 in our case. We prove two refactorization conditions for a matching coefficient and an operator matrix element in the endpoint region, where they exhibit singularities giving rise to divergent convolution integrals. The refactorization conditions ensure that the dependence of the decay amplitude on the rapidity regulator, which regularizes the endpoint singularities, cancels out to all orders of perturbation theory. We establish the renormalized form of the factorization formula, proving that extra contributions arising from the fact that “endpoint regularization” does not commute with renormalization can be absorbed, to all orders, by a redefinition of one of the matching coefficients. We derive the renormalization-group evolution equation satisfied by all quantities in the factorization formula and use them to predict the large logarithms of order $$ {\alpha \alpha}_s^2{L}^k $$ αα s 2 L k in the three-loop decay amplitude, where $$ L=\ln \left(-{M}_h^2/{m}_b^2\right) $$ L = ln − M h 2 / m b 2 and k = 6, 5, 4, 3. We find perfect agreement with existing numerical results for the amplitude and analytical results for the three-loop contributions involving a massless quark loop. On the other hand, we disagree with the results of previous attempts to predict the series of subleading logarithms $$ \sim {\alpha \alpha}_s^n{L}^{2n+1} $$ ∼ αα s n L 2 n + 1 .


2017 ◽  
Vol 921 ◽  
pp. 585-688 ◽  
Author(s):  
J. Ablinger ◽  
J. Blümlein ◽  
A. De Freitas ◽  
A. Hasselhuhn ◽  
C. Schneider ◽  
...  

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Caiqin Song

We investigate the matrix equationX−AX¯B=C. For convenience, the matrix equationX−AX¯B=Cis named as Kalman-Yakubovich-conjugate matrix equation. The explicit solution is constructed when the above matrix equation has unique solution. And this solution is stated as a polynomial of coefficient matrices of the matrix equation. Moreover, the explicit solution is also expressed by the symmetric operator matrix, controllability matrix, and observability matrix. The proposed approach does not require the coefficient matrices to be in arbitrary canonical form. At the end of this paper, the numerical example is shown to illustrate the effectiveness of the proposed method.


Mathematics ◽  
2021 ◽  
Vol 9 (21) ◽  
pp. 2803
Author(s):  
Sudam Surasinghe ◽  
Erik Bollt

A data-driven analysis method known as dynamic mode decomposition (DMD) approximates the linear Koopman operator on a projected space. In the spirit of Johnson–Lindenstrauss lemma, we will use a random projection to estimate the DMD modes in a reduced dimensional space. In practical applications, snapshots are in a high-dimensional observable space and the DMD operator matrix is massive. Hence, computing DMD with the full spectrum is expensive, so our main computational goal is to estimate the eigenvalue and eigenvectors of the DMD operator in a projected domain. We generalize the current algorithm to estimate a projected DMD operator. We focus on a powerful and simple random projection algorithm that will reduce the computational and storage costs. While, clearly, a random projection simplifies the algorithmic complexity of a detailed optimal projection, as we will show, the results can generally be excellent, nonetheless, and the quality could be understood through a well-developed theory of random projections. We will demonstrate that modes could be calculated for a low cost by the projected data with sufficient dimension.


Sign in / Sign up

Export Citation Format

Share Document