Related papers: Polynomial Subtraction Method for Disconnected Qua…
This paper presents a new approach to quadrify a polynomial programming problem, i.e. reduce the polynomial program to a quadratic program, before solving it. The proposed approach, QUAD-RLT, exploits the Reformulation-Linearization…
This paper proposes new quadratic constraints (QCs) to bound a quadratic polynomial. Such QCs can be used in dissipation ineqaulities to analyze the stability and performance of nonlinear systems with quadratic vector fields. The proposed…
We investigate the computational efficiency of two stochastic based alternatives to the Sequential Propagator Method used in Lattice QCD calculations of heavy-light semileptonic form factors. In the first method, we replace the sequential…
In a wide range of applications, we are required to rapidly solve a sequence of convex multiparametric quadratic programs (mp-QPs) on resource-limited hardwares. This is a nontrivial task and has been an active topic for decades in control…
Accurate measurements of K, D and B meson mixing amplitudes provide stringent constraints in the Unitary Triangle analysis, as well as useful bounds on New Physics scales. Lattice QCD provides a non perturbative tool to compute the hadronic…
A generalization of a recently introduced recursive numerical method for the exact evaluation of integrals of regular solid harmonics and their normal derivatives over simplex elements in $\mathbb{R}^3$ is presented. The original Quadrature…
Work on generalizing the deflated, restarted GMRES algorithm, useful in lattice studies using stochastic noise methods, is reported. We first show how the multi-mass extension of deflated GMRES can be implemented. We then give a deflated…
We present a polynomial hybrid Monte Carlo (PHMC) algorithm for lattice QCD with odd numbers of flavors of O(a)-improved Wilson quark action. The algorithm makes use of the non-Hermitian Chebyshev polynomial to approximate the inverse…
Layer factorization has emerged as a widely used technique for training memory-efficient neural networks. However, layer factorization methods face several challenges, particularly a lack of robustness during the training process. To…
We have made significant progress on extending lattice QCD calculation of the polarizability of the neutron and other hadrons to include the effects of charged dynamical quarks. This is done by perturbatively reweighting the charges of the…
We consider a lattice-inspired random matrix model for the QCD chiral phase transition at finite chemical potential. Useful features of the usual RMM for QCD at finite chemical potential are reobtained, some being brought closer to their…
We explore application of the domain wall fermion formalism of lattice QCD to calculate the $K\to\pi\pi$ decay amplitudes in terms of the $K\to\pi$ and $K\to 0$ hadronic matrix elements through relations derived in chiral perturbation…
The cyclic reduction (CR) algorithm is an efficient method for solving quadratic matrix equations that arise in quasi-birth-death (QBD) stochastic processes. However, its convergence is not guaranteed when the associated matrix polynomial…
The determination of renormalization factors is of crucial importance. They relate the observables obtained on finite, discrete lattices to their measured counterparts in the continuum in a suitable renormalization scheme. Therefore, they…
We study the possible significance of four-quark states in the iso-singlet scalar mesons ($J^{PC}=0^{++}$, $I=0$) by performing two-flavor full lattice QCD simulations on an $8^3 \times 16$ lattice using the improved gauge action and the…
We investigate an alternative to the Sequential Propagator Method used in Lattice QCD calculations of semileptonic form factors. We replace the sequential propagator with a stochastic propagator so that, in principle, all momentum and sink…
The features of the ordinary least squares method, which gives a possible way to a solution of the overdetermined systems of algebraic equations and allows to estimate the uncertainties of the obtained solutions, are considered. As the…
The reduction of constraints to obtain minimal representations of sets is a very common problem in many engineering applications. While well-established methodologies exist for the case of linear constraints, the problem of how to detect…
In these lectures, we discuss different types of renormalization problems in QCD and their non-perturbative solution in the framework of the lattice formulation. In particular the recursive finite size methods to compute the…
It is proposed the modification of the Jacobi polynomial expansion method (MJEM) which is based on the application of the truncated moments instead of the full ones. This allows to reconstruct with a high precision the local quark helicity…